Summary
In the process industries, final products arise from chemical and physical transformations of materials on processing units. In batch production mode, the total requirements for intermediate and final products are divided into individual batches. Storage facilities of limited capacity are available for stocking raw materials, intermediates, and final products. We present a novel approach to solving large-scale instances of the minimum-makespan production scheduling problem. The basic idea consists in constructing a production schedule by concatenating copies of a cyclic subschedule. For generating an appropriate subschedule we formulate a mixed-integer nonlinear program providing the set of batches of one cycle and the number of cycles needed to satisfy the primary requirements. The subschedule is then obtained by allocating the processing units, intermediates, and storage facilities over time to the batches executed in the cycle.
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
Ahuja RK, Magnanti TL, Orlin JB (1993): Network Flows. Prentice Hall, Englewood Cliffs
Blömer F, Günther HO (1998): Scheduling of a multi-product batch process in the chemical industry. Computers in Industry 36:245–259
Brucker P, Hurink J (2000): Solving a chemical batch scheduling problem by local search. Annals of Operations Research 96:17–36
Castro P, Barbosa-Póvoa AP, Matos H (2001): An improved RTN continuous-time formulation for the short-term scheduling of multipurpose batch plants. Industrial & Engineering Chemistry Research 40:2059–2068
Gentner K (2005): Dekompositionsverfahren für die ressourcenbeschränkte Projektplanung. Shaker Verlag, Aachen
Gentner K, Neumann K, Schwindt C, Trautmann N (2004): Batch production scheduling in the process industries. In: Leung JYT (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton
Ierapetritou MG, Floudas CA (1998): Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes, Industrial & Engineering Chemistry Research 37:4341–4359
Kallrath J (2002): Planning and scheduling in the process industry. OR Spectrum 24:219–250
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
Maravelias CT, Grossmann IE (2004): A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants. Computers & Chemical Engineering 28:1921–1949
Neumann K, Schwindt C, Trautmann N (2002): Advanced production scheduling for batch plants in process industries. OR Spectrum 24:251–279
Schwindt C, Trautmann N (2004): A priority-rule based method for batch production scheduling in the process industries. In: Ahr D, Fahrion R, Oswald M, Reinelt G (eds) Operations Research Proceedings 2003. Springer, Berlin
Trautmann N (2005): Operative Planung der Chargenproduktion. Deutscher Universitäts-Verlag, Wiesbaden
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trautmann, N., Schwindt, C. (2006). A Heuristic Method for Large-Scale Batch Scheduling in the Process Industries. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_25
Download citation
DOI: https://doi.org/10.1007/3-540-32539-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)