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

Abstract

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. 2005 Elsevier B.V. All rights reserved.

DOI: 10.1016/j.ejor.2005.03.011

11 Figures and Tables

Cite this paper

@article{Burkard2006ACT, title={A complex time based construction heuristic for batch scheduling problems in the chemical industry}, author={Rainer E. Burkard and Johannes Hatzl}, journal={European Journal of Operational Research}, year={2006}, volume={174}, pages={1162-1183} }