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.
Type de document :
Communication dans un congrès
A. Dolgui. 13th IFAC Symposium on Information Control Problems in Manufacturing (INCOM09), 2009, Moscou, Russia. Elsevier Science, p. 832-837, 2009, 〈10.3182/20090603-3-RU-2001.00136〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00679075
Contributeur : Florent Breuil <>
Soumis le : mercredi 14 mars 2012 - 16:21:32
Dernière modification le : dimanche 28 janvier 2018 - 15:22:05

Identifiants

Citation

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

Partager

Métriques

Consultations de la notice

55