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...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2006-10, Vol.174 (2), p.1162-1183
Main Authors: Burkard, Rainer E., Hatzl, Johannes
Format: Article
Language:English
Subjects:
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
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 within a reasonable computational time could only be obtained for small instances. We propose an iterative construction algorithm which alternates between construction and deconstruction phases. Moreover, we suggest diversification and intensification strategies in order to obtain good suboptimal solutions within moderate running times. Computational results show the power of this algorithm.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2005.03.011