𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of scheduling tasks with discrete starting times

✍ Scribed by J Mark Keil

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
210 KB
Volume
12
Category
Article
ISSN
0167-6377

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