𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times

✍ Scribed by C. Gicquel; M. Minoux; Y. Dallery

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
714 KB
Volume
37
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

✦ Synopsis

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. Computational results confirm the benefits of the proposed solution procedure.

πŸ“œ SIMILAR VOLUMES

Some unrelated parallel machine scheduli
Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects
✍ Wen-Hung Kuo; Chou-Jung Hsu; Dar-Li Yang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 205 KB

Total absolute deviation of job completion times Total load a b s t r a c t In this paper, we study an unrelated parallel machine scheduling problem with setup time and learning effects simultaneously. The setup time is proportional to the length of the already processed jobs. That is, the setup ti

The open shop scheduling problem with a
The open shop scheduling problem with a given sequence of jobs on one machine
✍ Y.M. Shafransky; V.A. Strusevich πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 186 KB πŸ‘ 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a