𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Economic lot scheduling heuristic for random demands

✍ Scribed by P. Kelle; G. Clendenen; P. Dardeau

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
470 KB
Volume
35
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lot scheduling problem for continuous de
Lot scheduling problem for continuous demand
✍ Yoichi Seki; Keiji Kogure πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 698 KB

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 se

Demand shuffleβ€”A method for multilevel p
Demand shuffleβ€”A method for multilevel proportional lot sizing and scheduling
✍ A. Kimms πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 162 KB

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

A compact heuristic for common cycle lot
A compact heuristic for common cycle lot-size scheduling in multi-stage, multi-product production processes
✍ M.K. El-Najdawi πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 1018 KB

Common Cycle Scheduling Problem (CCSP) is concerned with determining production lot sizes for a given set of products using a common facility. It is based on scheduling all products using a common (base) cycle time, so that the lot size for each product is the forecasted demand for that product over