A chemical batch scheduling problem is modelled in two different ways as a discrete optimization problem. Both models are used to solve the batch scheduling problem in a two-phase tabu search procedure. The method is tested on real-world data.
|Place of Publication||Enschede|
|Publisher||University of Twente|
|Publication status||Published - 1999|
|Publisher||Department of Applied Mathematics, University of Twente|