Lot scheduling problem for continuous demand
β Scribed by Yoichi Seki; Keiji Kogure
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 698 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0925-5273
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper deals with a lot scheduling problem for multi-item continuous demand utilizing a single machine with setup times. The problem involves dynamic determination of lot-sizes to minimize the inventory level. In such systems, the lowest inventory level is realized by maximizing the number of setups under the condition of no stockout. Based on the above fact, first, an analytical solution of lot-sizes for a cyclic schedule is given based on a constant-demand model. Secondly, a stochastic-demand model is developed, and some heuristic setup rules are studied using the concept of time inventory, defined from the solution based on a constant-demand model. These rules realize a stable system with a lower average stockout level and a lower inventory level. Effects of the setup rules on the system are revealed by Monte Carlo simulations.
π SIMILAR VOLUMES
## Abstract In this paper we consider the multiproduct, multiperiod productionβscheduling model of Manne under the assumption that, across products, demands are interrelated over time. When demand requirements are proportional we show that the solution has a specific structure determined by the rat
This contribution acquaints the reader with a model for multilevel single-machine proportional lot sizing and scheduling problems (PLSPs) that appear in the scope of short-term production planning. It is one of the first articles that deals with dynamic capacitated multilevel lot sizing and scheduli
We study a deterministic lot-size problem, in which the demand rate is a (piecewise) continuous function of time and shortages are backordered. The problem is to find the order points and order quantities to minimize the total costs over a finite planning horizon. We show that the optimal order poin