Solving a chemical batch scheduling problem by local search

P. Brucker, Johann L. Hurink

Research output: Book/ReportReportOther research output

66 Downloads (Pure)


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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente
Publication statusPublished - 1999

Publication series

PublisherDepartment of Applied Mathematics, University of Twente
ISSN (Print)0169-2690


  • EWI-3326
  • IR-65694
  • MSC-90B35

Cite this