Discrete Lotsizing and Scheduling by Batch Sequencing

Carsten Jordan and Andreas Drexl
Additional contact information
Carsten Jordan: Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, 24098 Kiel, Germany
Andreas Drexl: Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, 24098 Kiel, Germany

Management Science, 1998, vol. 44, issue 5, 698-713

Abstract: The discrete lotsizing and scheduling problem for one machine with sequence-dependent setup times and setup costs is solved as a single machine scheduling problem, which we term the batch sequencing problem. The relationship between the lotsizing problem and the batch sequencing problem is analyzed. The batch sequencing problem is solved with a branch & bound algorithm which is accelerated by bounding and dominance rules. The algorithm is compared with recently published procedures for solving variants of the DLSP and is found to be more efficient if the number of items is not large.

Keywords: Discrete Lotsizing and Scheduling; Sequence-Dependent Setup Times and Setup Costs; Batch Sequencing; Branch-and-Bound Algorithm; Bounding/Dominance Rules (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.44.5.698 (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:44:y:1998:i:5:p:698-713

Access Statistics for this article

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