A New Global Optimization Algorithm for Batch Process Scheduling
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.
KeywordsOptimization global batch scheduling event timing
Unable to display preview. Download preview PDF.
- 2.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.Google Scholar
- 5.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.Google Scholar
- 9.Xueya Z. and R.W.H. Sargent, A new unified formulation for process scheduling. AIChE annual meeting, Paper No. 144c, St.Louis, Missouri, 1993.Google Scholar
- 10.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.Google Scholar
- 11.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.Google Scholar