Multi-product lot sizing and scheduling on unrelated parallel machines

Alexandre Dolgui, Anton Eremeev, Mikhail Kovalyov and Pavel Kuznetsov

IISE Transactions, 2010, vol. 42, issue 7, 514-524

Abstract: This article studies a problem of optimal scheduling and lot sizing a number of products on m unrelated parallel machines to satisfy given demands. 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 criterion is to minimize the time at which all the demands are satisfied, Cmax, or the maximum lateness of the product completion times from the given due dates, Lmax. The problem is motivated by the real-life scheduling applications in multi-product plants. The properties of optimal solutions, NP-hardness proofs, enumeration, and dynamic programming algorithms for various special cases of the problem are presented. A greedy-type heuristic is proposed and experimentally tested. The major contributions are an NP-hardness proof, pseudo-polynomial algorithms linear in m for the case, in which the number of products is a given constant and the heuristic. The results can be adapted for solving a production line design problem.

Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1080/07408170903542649 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:42:y:2010:i:7:p:514-524

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/07408170903542649

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().