Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/149058
Authors: 
Jordan, Carsten
Drexl, Andreas
Year of Publication: 
1997
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 438
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 brauch & 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.
Subjects: 
DISCRETE LOTSIZING AND SCHEDULING
SEQUENCE DEPENDENT SETUP TIMES AND SETUP COSTS
BATCH SEQUENCING
BRANCH & BOUND ALGORITHM
BOUNDING/DOMINANCE RULES
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.