𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Demand shuffle—A method for multilevel proportional lot sizing and scheduling

✍ Scribed by A. Kimms

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
162 KB
Volume
44
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

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 scheduling, which is of great practical importance. The PLSP model refines well-known mixed-integer programming formulations for dynamic capacitated lot sizing and scheduling as, for instance, the DLSP or the CSLP. A special emphasis is given on a new method called demand shuffle to solve multilevel PLSP instances efficiently but suboptimally. Although the basic idea is very simple, it becomes clear that in the presence of precedence and capacity constraints many nontrivial details are to be concerned. Computational studies show that the presented approach decidedly improves recent results.

📜 SIMILAR VOLUMES

Proportional lot sizing and scheduling:
Proportional lot sizing and scheduling: Some extensions
✍ Kimms, A.; Drexl, A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB

This contribution generalizes the work of Drexl and Haase about the so-called proportional lot sizing and scheduling problem which was published in 1995. While the early paper considered singlelevel cases only, the paper at hand describes multilevel problems, i.e., items are interconnected via a dir