Solving a chemical batch scheduling problem by local search

P. Brucker, Johann L. Hurink

Research output: Contribution to journalArticleAcademicpeer-review

19 Citations (Scopus)
1 Downloads (Pure)


In this paper the following chemical batch scheduling problem is considered: a set of orders has to be processed on a set of facilities. For each order a given amount of a product must be produced by means of chemical reactions before a given deadline. The production consists of a sequence of processes whereby each process has to be performed by one facility out of a given subset of facilities allowed for this process. The processing times depend on the choice of the facility and the processing is done in batch mode with given minimum and maximum sizes. The problem is to assign the processes to the facilities, splitting them into batches, and scheduling these batches in order to produce the demands within the given deadlines. For the scheduling part of the problem we present an approach based on the following steps. First, a procedure to calculate the minimum number of batches needed to satisfy the demands is presented. Based on this, the given problem is modeled in two different ways: as a general shop scheduling problem with set-up times or as scheduling problem with positive time-lags. Finally, a two-phase tabu search method is presented which is based on the two different formulations of the problem. The method is tested on some real world data.
Original languageUndefined
Article number10.1023/A:1018959704264
Pages (from-to)17-38
Number of pages22
JournalAnnals of operations research
Issue number1-4
Publication statusPublished - 2000


  • EWI-7585
  • IR-63580
  • MSC-90B35

Cite this