A complex time based construction heuristic for batch scheduling problems in the chemical industry

In this paper we investigate a heuristic for batch processing problems occurring in the chemical industry, where the objective is to minimize the makespan. Usually, this kind of problem is solved using mixed-integer linear programs. However, due to the large number of binary variables good results w...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 2006-10, Vol.174 (2), p.1162-1183
Hauptverfasser:	Burkard, Rainer E., Hatzl, Johannes
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Batch processing Batch production systems Chemical industry Exact sciences and technology Heuristic Heuristics Makespan minimization Operational research and scientific management Operational research. Management science Scheduling Scheduling problems Scheduling, sequencing Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!