𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The discrete lot-sizing and scheduling problem

✍ Scribed by Bernhard Fleischmann

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
743 KB
Volume
44
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the discrete lot-sizing and schedulin
On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
✍ C. Gicquel; M. Minoux; Y. Dallery πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 714 KB

We consider the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs and times and propose solving it as a mixed-integer program using a commercial solver. Our approach is based on the extension of an existing tight formulation for the case without changeover times. Co

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