✦ LIBER ✦

The discrete lot-sizing and scheduling problem with sequence-dependent setup costs

✍ Scribed by Bernhard Fleischmann

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 714 KB
Volume: 75
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90083-3

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

The discrete lot-sizing and scheduling p

The discrete lot-sizing and scheduling problem

✍ Bernhard Fleischmann 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 743 KB

A linear description of the discrete lot

A linear description of the discrete lot-sizing and scheduling problem

✍ Stan van Hoesel; Antoon Kolen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 632 KB

The economic lot scheduling problem with

The economic lot scheduling problem with finite backorder costs

✍ Guillermo Gallego; Robin Roundy 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 568 KB

A grasp for single machine scheduling wi

A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties

✍ Thomas A. Feo; Kishore Sarathy; John McGahan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 812 KB

A tabu search heuristic for the multipro

A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times

✍ Paulo M. França; Michel Gendreau; Gilbert Laporte; Felipe M. Müller 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 961 KB