Abstract
A general framework for handling a wide range of short-term scheduling problems arising in multiproduct/multi-purpose batch chemical plants is presented. Time events arising in the schedule are modeled directly and thus the use of binary variables over periods during which no changes in system state occur is avoided. The problem is formulated as a mixed integer nonlinear program (MINLP). The Bayesian Heuristic (BH) approach is used to implement a global optimization algorithm which effectively solves the resulting model. Computational comparisons using two test examples are made against a UDM (uniform discretization model) formulation. The results suggest that the BH approach combined with the nonuniform time discretization formulation shows promise for the solution of batch scheduling problems.
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
Das H., P.T. Cummings, find M.D. La Van, Scheduling of serial multiproduct batch processes via simulated annealing. Computers Chem. Engng, 14, 1990, pp. 1351–1362.
Floquet P., P. Pibouleau, and S. Domenech, Scheduling and simulated annealing application to a semiconductor circuit fabrication plant. Computers Chem. Engng, 17, 1993, pp. 39–44.
Mockus J., Bayesian approach to global optimization. Kluwer academic publishers, Dordrecht-London-Boston, 1989.
Mockus A., J. Mockus and L. Mockus, Bayesian approach adapting stochastic and heuristic methods of global and discrete optimization. INFORMATICA, 5, 1994, pp. 123–166.
Mockus L. and G.V. Reklaitis, Mathematical programming formulation for scheduling of batch operations using nonuniform time discretization. AIChE annual meeting, Paper No. 235d, San-Francisco, California, 1994.
Patel A.N., R.S.H. Mah, and I.A. Karimi, Preliminary design of multiproduct noncontinuous plants using simulated annealing. Computers Chem. Engng, 15, 1991, pp. 451–469.
Sahinidis N.V. and I.E. Grossmann, Reformulation of multiperiod MILP models for planning and scheduling of chemical processes. Computers Chem. Engng 15, 1991, pp. 255–272.
Tandon M., P.T. Cummings, and M.D. La Van, Flowshop sequencing with non-permutation schedules. Computers Chem. Engng, 15, 1991, pp. 601–607.
Xueya Z. and R.W.H. Sargent, A new unified formulation for process scheduling. AIChE annual meeting, Paper No. 144c, St.Louis, Missouri, 1993.
Zentner M.G. and G.V. Reklaitis, An interval-based mathematical model for the scheduling of resource-constrained batch chemical processes. Proc. NATO A SI on Batch Processing Systems Engineering, Antalya, Turkey, 1992.
Zentner M.G., J.F. Pekny, D.L. Miller and G.V. Reklaitis, RCSP++: A scheduling system for the chemical process industry. Proc. PSE’94, Kyongju, Korea, 1994, pp. 491–495.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Mockus, L., Reklaitis, G.V. (1996). A New Global Optimization Algorithm for Batch Process Scheduling. In: Floudas, C.A., Pardalos, P.M. (eds) State of the Art in Global Optimization. Nonconvex Optimization and Its Applications, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3437-8_31
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3437-8_31
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3439-2
Online ISBN: 978-1-4613-3437-8
eBook Packages: Springer Book Archive