Single bottleneck systems with proportional expected yields and rigid demand

Article Abstract:

The single bottleneck manufacturing system was examined to develop an optimal production policy for such systems under a regime of proportional expected yields and rigid demand. The results showed that the optimal lotsizing problem may be reduced to optimally lotsizing a single-stage equivalent machine if units are processed one by one on the non-bottleneck areas. The equivalent machine has binomial yields if the bottleneck has binomial yields. The non-intuitive nature of the optimal policy was also demonstrated with examples.

Research, Economic lot size

---

Production to order on a two machine line with random yields and rigid demand

Article Abstract:

Multiple production runs are needed when demand is rigid and the manufacturing yield is uncertain. The rigid demand regime was applied to a two-machine setup in which there is an intermediate inventory of inspected units. Based on remaining demand and intermediate inventory level, the production policy must specify which machine to run next and the lot size. A policy improvement algorithm was developed to yield an optimal production policy under rigid demand with uncertain yield.

Models, Production planning

---

Lot-sizing two-echelon assembly systems with random yields and rigid demand

Article Abstract:

Solution for a cost minimization problem of a two-echelon assembly line manufacturing only one product is derived. Algorithms are a developed to solve linear equations.

United States, Management dynamics, Methods, Management, Tests, problems and exercises, Usage, Algorithms, Company business management, Algorithm, Assembly-line methods, Assembly lines, Cost control, Cost reduction, Systems of equations

Similar abstracts:

• Abstracts: Optimal design of unreliable production-inventory systems with variable production rate. A deteriorating inventory model with time-varying demand and shortage-dependent partial backlogging
• Abstracts: Integrating process optimization and inventory planning cutting-stock with skiving option: an optimization model and its application
• Abstracts: Strip generation algorithms for constrained two-dimensional two-staged cutting problems. A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
• Abstracts: How a global web of activists gives Coke problems in India. Silicon Valley, where conversation comes with a caveat; nondisclosure forms invade dates and dinner parties; NDA-ing the rabbi's wife

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.