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.
- Sprache
-
Englisch
- Erschienen in
-
Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; No. 343
- Klassifikation
-
Management
- Thema
-
Discrete Lotsizing And Scheduling
Setup-Times
Batch Sequencing
Sequencing Algorithm
Bounding/ Dominance Rules
Produktionssteuerung
Theorie
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Jordan, Carsten
Drexl, Andreas
- Ereignis
-
Veröffentlichung
- (wer)
-
Universität Kiel, Institut für Betriebswirtschaftslehre
ZBW – Leibniz Information Centre for Economics
- (wo)
-
Kiel
- (wann)
-
1994
- Handle
- Letzte Aktualisierung
-
20.09.2024, 08:23 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- Jordan, Carsten
- Drexl, Andreas
- Universität Kiel, Institut für Betriebswirtschaftslehre
- ZBW – Leibniz Information Centre for Economics
Entstanden
- 1994
Ähnliche Objekte (12)
Drexl, Andreas
Scheduling of project networks by job assignment
Discrete lotsizing and scheduling by batch sequencing
A comparison of logic and mixed-integer programming solvers for batch sequencing with sequence-dependent setups
Nonpreemptive multi-mode resource-constrained project scheduling
Scheduling sports leagues using branch- and price
Lot sizing and scheduling: Survey and extensions
Proportional lot sizing and scheduling: Some extensions
Some insights into proportional lot sizing and scheduling
Project scheduling with multiple modes: A comparison of exact algorithms
Local search for nonpreemptive multi-mode resource-constrained project scheduling
Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling
Drexl, Andreas
Scheduling of project networks by job assignment
Discrete lotsizing and scheduling by batch sequencing
A comparison of logic and mixed-integer programming solvers for batch sequencing with sequence-dependent setups
Nonpreemptive multi-mode resource-constrained project scheduling
Scheduling sports leagues using branch- and price
Lot sizing and scheduling: Survey and extensions
Proportional lot sizing and scheduling: Some extensions
Some insights into proportional lot sizing and scheduling
Project scheduling with multiple modes: A comparison of exact algorithms
Local search for nonpreemptive multi-mode resource-constrained project scheduling
Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling
Drexl, Andreas
Scheduling of project networks by job assignment
Discrete lotsizing and scheduling by batch sequencing
A comparison of logic and mixed-integer programming solvers for batch sequencing with sequence-dependent setups
Nonpreemptive multi-mode resource-constrained project scheduling
Scheduling sports leagues using branch- and price
Lot sizing and scheduling: Survey and extensions
Proportional lot sizing and scheduling: Some extensions
Some insights into proportional lot sizing and scheduling
Project scheduling with multiple modes: A comparison of exact algorithms
Local search for nonpreemptive multi-mode resource-constrained project scheduling