Arbeitspapier

Lotsizing and scheduling by batch sequencing

The discrete lotsizing and scheduling problem with setup-times is transformed into a single-machine scheduling problem, denoted as batch sequencing problem, which integrates sequence-dependent setups as well. The relationship between the lotsizing and the batch sequencing problem is analyzed. The batch sequencing problem is solved with an enumerative algorithm which is accelerated through bounding and dominance rules. Computational results show that this algorithm solves even the special case of sequence-independent setups more efficiently than a procedure for the discrete lotsizing and scheduling problem which has been recently published.

Language
Englisch

Bibliographic citation
Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; No. 343

Classification
Management
Subject
Discrete Lotsizing And Scheduling
Setup-Times
Batch Sequencing
Sequencing Algorithm
Bounding/ Dominance Rules
Produktionssteuerung
Theorie

Event
Geistige Schöpfung
(who)
Jordan, Carsten
Drexl, Andreas
Event
Veröffentlichung
(who)
Universität Kiel, Institut für Betriebswirtschaftslehre
ZBW – Leibniz Information Centre for Economics
(where)
Kiel
(when)
1994

Handle
Last update
10.03.2025, 11:45 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Arbeitspapier

Associated

  • Jordan, Carsten
  • Drexl, Andreas
  • Universität Kiel, Institut für Betriebswirtschaftslehre
  • ZBW – Leibniz Information Centre for Economics

Time of origin

  • 1994

Other Objects (12)