Advertisement

A Priority-Rule Based Method for Batch Production Scheduling in the Process Industries

  • Christoph Schwindt
  • Norbert Trautmann
Part of the Operations Research Proceedings book series (ORP, volume 2003)

Abstract

We present a priority-rule based method for batch production scheduling in the process industries. The problem consists in scheduling a given set of operations on a batch plant such that the makespan is minimized. Each operation consumes given amounts of input materials at its start and produces given amounts of output materials at its completion. An initial, a maximum, and a minimum stock level are specified for each material. Some materials are perishable and thus cannot be stored. The operations may be executed on alternative processing units. Processing units require cleaning between certain operations and before any idle time. Due to the constraints on material availability and storage capacity, classical schedule-generation schemes cannot be applied to this problem. That is why we propose a new two-phase approach dealing with the two types of constraints separately.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Blömer, F., Günther, H.-O. (1998): Scheduling of a multi-product batch process in the chemical industry. Computers in Industry 36, 245–259CrossRefGoogle Scholar
  2. 2.
    Blömer, F., Günther, H.-O. (2000): LP-based heuristics for scheduling chemical batch processes. International Journal of Production Research 35, 1029–1052CrossRefGoogle Scholar
  3. 3.
    Burkard, R.E., Kocher, M., Rudolf, R. (1998): Rounding strategies for mixed integer programs arising from chemical production planning. Yugoslav Journal of Operations Research 8, 9–23Google Scholar
  4. 4.
    Kondili, E., Pantelides, C.C., Sargent, R.W.H. (1993): A general algorithm for short-term scheduling of batch operations: I. MILP Formulation. Computers and Chemical Engineering 17, 211–227CrossRefGoogle Scholar
  5. 5.
    Neumann, K., Schwindt, C. (2002): Project scheduling with inventory con-straints. Mathematical Methods of Operations Research 56, 513–533CrossRefGoogle Scholar
  6. 6.
    Neumann, K., Schwindt, O, Trautmann, N. (2002): Advanced production scheduling for batch plants in process industries. OR Spectrum 24, 251–279CrossRefGoogle Scholar
  7. 7.
    Neumann, K., Schwindt, C, Zimmermann, J. (2003): Project Scheduling with Time Windows and Scarce Resources, 2nd ed. Springer, BerlinCrossRefGoogle Scholar
  8. 8.
    Westenberger, H., Kallrath, J. (1995): Formulation of a job shop problem in process industry. Bayer AG, Leverkusen and BASF AG, LudwigshafenGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Christoph Schwindt
    • 1
  • Norbert Trautmann
    • 2
  1. 1.Institut für Wirtschaftsinformatik und Operations ResearchUniversität Halle-WittenbergHalle (Saale)Germany
  2. 2.Institut für Wirtschaftstheorie und Operations ResearchUniversität KarlsruheKarlsruheGermany

Personalised recommendations