Annals of Operations Research

, Volume 96, Issue 1–4, pp 17–38 | Cite as

Solving a chemical batch scheduling problem by local search

  • Peter Brucker
  • Johann Hurink


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.

case study batch production tabu search general shop problem time-lags mixed graph scheduling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E.H.L. Aarts and J.K. Lenstra, eds., Local Search in Combinatorial Optimization(Wiley, Chichester, 1997).Google Scholar
  2. [2]
    F. Blömer and H.-O. Günther, LP-based heuristics for scheduling chemical batch processes, Technical Report 04.98, Department of Industrial Management, Technical University Berlin (1998). To appear in Computers in Industry.Google Scholar
  3. [3]
    P. Brucker and O. Thiele, A branch and bound method for the general-shop problem with sequence dependent setup-times, OR Spektrum 18 (1996) 145–161.CrossRefGoogle Scholar
  4. [4]
    R.E. Burkard, M. Hujter, B. Klinz, R. Rudolf and M.Wennink, A process scheduling problem arising from chemical production planning, Optimization Methods and Software 10 (1998) 175–196.Google Scholar
  5. [5]
    R.E. Burkard, M. Kocher and R. Rudolf, Rounding strategies for mixed integer programs arising from chemical production planning, Yugoslav Journal of Operations Research 8(1998) 9–23.Google Scholar
  6. [6]
    M. Dell'Amico and M. Trubian, Applying tabu search to the job-shop scheduling problem, Annals of Operations Research 41 (1993) 231–252.CrossRefGoogle Scholar
  7. [7]
    E. Kondili, C.C. Pantelidis and R.W.H. Sargent, A general algorithm for short-term scheduling of batch operations-I. MILP formulation, Computers Chem. Enging. 17 (1993) 211–227.CrossRefGoogle Scholar
  8. [8]
    T. Löhl, C. Schulz and S. Engell, Sequencing of batch operations for a highly coupled production process: genetic algorithms versus mathematical programming, Computers Chem. Enging. 22 (1998) 579–585.CrossRefGoogle Scholar
  9. [9]
    G.V. Reklaitis, Overview of scheduling and planning of batch process operations, in: Batch Processing Systems Engineering, eds. G.V. Reklaitis et al. (Springer, Berlin, 1996) pp. 660–705.Google Scholar
  10. [10]
    D.W.T. Rippui, Batch process systems engineering: a retrospective and prospective review, Computers in Industry (1993).Google Scholar
  11. [11]
    C. Schönemann, Lokale Suche zur Lösung van Batch-Schedulingproblemen in der chemischen Industrie, Diplomarbeit, Universität Osnabrück (1998).Google Scholar
  12. [12]
    O. Thiele, Ein Branch und Bound-Verfahren für das General-Shop Problem mit gruppenabhängigen Rüstzeiten, Diplomarbeit, Universität Osnabrück (1994).Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Peter Brucker
    • 1
  • Johann Hurink
    • 2
  1. 1.Department of MathematicsUniversity of OsnabrückOsnabrückGermany
  2. 2.University of TwenteEnschedeThe Netherlands

Personalised recommendations