Abstract
The paper deals with short-term planning problems in process industries where final products are obtained by several successive chemical or physical transformations of raw materials using scarce multi-purpose equipment. In batch production mode, the total requirements for intermediate and final products are partitioned into batches. The production start of a batch at a given level requires the availability of all input products. We consider the problem of scheduling the production of given primary requirements for final products such that the makespan is minimized, where the batch sizes can be chosen within prescribed intervals. Further constraints arise from limited production and storage capacities as well as sequence-dependent cleaning times for processing units. We propose a new solution approach which is based on the decomposition of the short-term planning problem into computing appropriate batch sizes (batching) and the subsequent scheduling of batches on processing units (batch scheduling). The former problem is modelled and solved as a nonlinear mixed integer program, whereas the latter problem is addressed using models and methods of resource-constrained project scheduling. The solution procedure proposed (approximately) solves problems of industrial size within a reasonable amount of computing time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahleff J (1995) Analyse von mathematischen Modellen zur Reihenfolgeplanung in der Prozeflindustrie. Master thesis, RWTH Aachen, Germany
Applequist G, Samikoglu O, Pekny J, Reklaitis GV (1997) Issues in the use, design and evolution of process scheduling and planning systems. ISA Transactions 36: 81–121
Bartusch M, Möhring R, Radermacher FJ (1988) Scheduling project networks with resource constraints and time windows. Annals of Operations Research 16: 201–240
Blömer F (1999) Produktionsplanung und -steuerung in der chemischen Industrie — Ressourceneinsatzplanung von Batchprozessen auf Mehrzweckanlagen. Gabler, Wiesbaden.
Blömer F, Günther HO (1998) Scheduling of a multi-product batch process in the chemical industry. Computers in Industry 36: 245–259
Blömer F, Günther HO (2000) LP-based heuristics for scheduling chemical batch processes. International Journal of Production Research 35: 1029–1052
Brucker B, Drexl A, Möhring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models, and methods. European Journal of Operational Research 112: 3–41
Brucker P, Hurink J (1999) Solving a chemical batch scheduling problem by local search. Osnabrücker Schriften zur Mathematik, Heft 215, University of Osnabrück
Burkhard RE, Hujter M, Klinz B, Rudolf R, Wennink M (1998a) A process scheduling problem arising from chemical production planning. Optimization Methods & Software 10: 175–196
Burkhard RE, Kocher M, Rudolf R (1998b) Rounding strategies for mixed integer programs arising from chemical production planning. Yugoslav Journal of Operations Research 8: 9–23
Günther, HO (1992) Netzplanorientierte Auftragsterminierung bei offener Fertigung. OR Spektrum 14: 229–240
Kanakamedala KB, Reklaitis G, Venkatasubramanian V (1994) Reactive schedule modification in multipurpose batch chemical plants. Industrial & Engineering Chemistry Research 33: 77–90
Kondili E, Pantelides CC, Sargent RWH (1993) A general algorithm for short-term scheduling of batch operations — I. MILP formulation. Computers & Chemical Engineering 17: 211–227
Lasdon LS, Waren AD, Jain A, Ratner M (1978) Design and testing of a generalized reduced gradient code for nonlinear programming. Transactions on Mathematical Software 4: 34–50
Lawler EL (1976) Networks and Matroids. Rinehart and Winston, New York
Neumann K, Schwindt C (1997) Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production. OR Spektrum 19: 205–217
Neumann K, Schwindt C (1999) Project scheduling with inventory constraints. Report WIOR-572, University of Karlsruhe
Neumann K, Schwindt C, Zimmermann J (2000) Project scheduling with time windows and scarce resources I. Report WIOR-600, University of Karlsruhe
Pinto M, Grossmann IE (1995) A continuous time mixed integer linear programming model for short term scheduling of multistage batch plants. Industrial & Engineering Chemistry Research 34: 3037–3051
Pinto M, Grossmann IE (1998) Assignment and sequencing models for the scheduling of process systems. Annals of Operations Research 81: 443–466
Rosenau B (1996) Bearbeitung eines Losgrößenproblems aus der chemischen Industrie mit Schnittebenenenverfahren. Diploma thesis, University of Marburg, Germany
Schwindt C, Trautmann N (2000) Batch scheduling in process industries: an application of resource-constrained project scheduling. OR Spektrum 22, to appear
Speranza MG, Stähly P (2000) New Trends in Distribution Logistics. Springer, Berlin
Westenberger H, Kallrath J (1995) Formulation of a job shop problem in process industry. Unpublished working paper, Bayer AG, Leverkusen and BASF AG, Ludwigshafen
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Neumann, K., Schwindt, C., Trautmann, N. (2001). Short-Term Planning of Batch Plants in Process Industries. In: Kischka, P., Möhring, R.H., Leopold-Wildburger, U., Radermacher, FJ. (eds) Models, Methods and Decision Support for Management. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-57603-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-57603-4_12
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-642-63306-5
Online ISBN: 978-3-642-57603-4
eBook Packages: Springer Book Archive