Solving a chemical batch scheduling problem by local search

Abstract

A chemical batch scheduling problem is modeled 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. 
DOI: 10.1023/A:1018959704264

Topics

6 Figures and Tables

Slides referencing similar topics