Some Extensions of the Discrete Lotsizing and Scheduling Problem

Marc Salomon, Leo G. Kroon, Roelof Kuik and Luk N. Van Wassenhove
Additional contact information
Marc Salomon: Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands
Leo G. Kroon: Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands
Roelof Kuik: Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands
Luk N. Van Wassenhove: INSEAD, Boulevard de Constance, F-77305 Fontainebleau Cedex, France

Management Science, 1991, vol. 37, issue 7, 801-812

Abstract: In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) is considered. DLSP relates to capacitated lotsizing as well as to job scheduling problems and is concerned with determining a feasible production schedule with minimal total costs in a single-stage manufacturing process. This involves the sequencing and sizing of production lots for a number of different items over a discrete and finite planning horizon. Feasibility of production schedules is subject to production quantities being within bounds set by capacity. A problem classification for DLSP is introduced and results on computational complexity are derived for a number of single and parallel machine problems. Furthermore, efficient algorithms are discussed for solving special single and parallel machine variants of DLSP.

Keywords: production planning; lotsizing; sequencing; computational complexity (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (44)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.37.7.801 (application/pdf)

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:inm:ormnsc:v:37:y:1991:i:7:p:801-812

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().