Multi-Product Lot-Sizing and Scheduling on Unrelated Parallel Machines to Minimize Makespan

Abstract : We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands, minimizing the makespan criterion. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The problem is motivated by the real-life scheduling applications in multi-product plants. We derive properties of optimal solutions, NP-hardness proof, enumeration and dynamic programming algorithms for various special cases of the problem. A greedy-type heuristic is proposed and tested in computational experiments.
Document type :
Conference papers
Complete list of metadatas

https://hal-emse.ccsd.cnrs.fr/emse-00679075
Contributor : Florent Breuil <>
Submitted on : Wednesday, March 14, 2012 - 4:21:32 PM
Last modification on : Saturday, March 30, 2019 - 5:36:02 PM

Identifiers

Citation

Alexandre Dolgui, Anton Eremeev, Mikhail Y. Kovalyov, Pavel M. Kuznetsov. Multi-Product Lot-Sizing and Scheduling on Unrelated Parallel Machines to Minimize Makespan. 13th IFAC Symposium on Information Control Problems in Manufacturing (INCOM09), 2009, Moscou, Russia. p. 832-837, ⟨10.3182/20090603-3-RU-2001.00136⟩. ⟨emse-00679075⟩

Share

Metrics

Record views

85