Abstract
A rigorous mathematical programming framework for the scheduling of multipurpose batch plants operated in a cyclic mode is presented. The proposed formulation can deal with batch operations described by complex processing networks, involving shared intermediates, material recycles, and multiple processing routes to the same end-product or intermediate. Batch aggregation and splitting are also allowed. The formulation permits considerable flexibility in the utilisation of processing equipment and storage capacity, and accommodates problems with limited availability of utilities. The scheduling problem is formulated as a large mixed integer linear program (MILP). For a given cycle time, it is shown that it is sufficient for the formulation to characterize a single cycle of the periodic schedule despite the existence of tasks that span two successive cycles. The optimal cycle time is determined by solving a sequence of fixed cycle time problems. The MILP is solved by a branch-and-bound algorithm modified so as to avoid exploring branches that are cyclic permutations of others already fathomed. The resulting implementation permits the solution of problems of realistic size within reasonable computational effort. Several examples are used to illustrate the applicability of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.B. Birewar and I.E. Grossmann, Incorporating scheduling in the optimal design of batch processes, Comp. Chem. Eng. 13(1989)141–161.
C.A. Crooks, Synthesis of operating procedures for chemical plants, PhD Thesis, University of London (1992).
E. Kondili, C.C. Pantelides and R.W.H. Sargent, A general algorithm for scheduling of batch operations,Proc. 3rd Int. Symp. on Process Systems Engineering, Sydney, Australia (1988) pp. 62–75.
E. Kondili, C.C. Pantelides and R.W.H. Sargent, A general algorithm for short-term scheduling of batch operations. Part I — MILP formulation, Comp. Chem. Eng. 17(1993)211–227.
A. Mauderli and D.W.T. Rippin, Production planning and scheduling for multi-purpose batch chemical plants, Comp. Chem. Eng. 3(1979)199–206.
L.G. Papageorgiou and C.C. Pantelides, A hierarchical approach for campaign planning of multipurpose batch plants, Comp. Chem. Eng. 17S(1993)S27-S32.
G.V. Reklaitis, Review of scheduling of process operations, AIChE Symp. Ser. 78(1982)119–133.
G.V. Reklaitis, Perspectives on scheduling and planning of process operations,Proc. 4th Int. Symp. on Process Systems Engineering, Montreal, Canada (1991).
N. Shah, Efficient scheduling, planning and design of multipurpose batch plants, PhD Thesis, University of London (1992).
N. Shah and C.C. Pantelides, Optimal long-term campaign planning and design of batch plants, Ind. Eng. Chem. Res. 30(1991)2308–2321.
N. Shah, C.C. Pantelides and R.W.H. Sargent, A general algorithm for short-term scheduling of batch operations. Part II — Computational issues, Comp. Chem. Eng. 17(1993)229–244.
M.C. Wellons and G.V. Reklaitis, Optimal schedule generation for a single-product production line. Part I: Problem formulation, Comp. Chem. Eng. 13(1989)201–212.
M.C. Wellons and G.V. Reklaitis, Optimal schedule generation for a single-product production line. Part II: Identification of dominant path sequences, Comp. Chem. Eng. 13(1989)213–227.
M.C. Wellons and G.V. Reklaitis, Scheduling of multipurpose batch chemical plants. 1: Formation of single product campaigns, Ind. Eng. Chem. Res. 30(1991)671–688.
M.C. Wellons and G.V. Reklaitis, Scheduling of multipurpose batch chemical plants. 2: Multiple product campaign formation and production planning, Ind. Eng. Chem. Res. 30(1991)688–705.
B.A. Murtagh and M.A. Saunders,MINOS 5.0 User's Guide, Technical Report SOL 83-20, Stanford University Laboratory (1983).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shah, N., Pantelides, C.C. & Sargent, R.W.H. Optimal periodic scheduling of multipurpose batch plants. Ann Oper Res 42, 193–228 (1993). https://doi.org/10.1007/BF02023176
Issue Date:
DOI: https://doi.org/10.1007/BF02023176