Scheduling intermediate storage multipurpose batch plants using the S-graph

A graph theoretical approach is proposed for the optimal scheduling of multipurpose batch plants when constraints on intermediate storage allocation are met. The novel S-graph representation is extended and combined with a set of rationales to consider intermediate storage policy in production scheduling. This set of rationales accelerates the optimization procedure, reducing the searching tree from the very beginning, without losing optimality. It is assumed that the storage units can be commonly used throughout the plant to achieve maximum plant flexibility. Therefore, the problem solved suggests the more general batch-process transfer strategy, common intermediate storage policy (CIS). This policy is suggested for more flexible use of intermediate storage units. The accuracy of this proposed algorithm is tested with an exhaustive B&B search algorithm. The methodology is compared with other CIS algorithms and is applied to solve several case studies. The benefits of considering this kind of storage coupled with the use of the proposed algorithm are discussed through motivating examples. © 2004 American Institute of Chemical Engineers AIChE J, 50: 403– 417, 2004

[1]  R. Sargent,et al.  A general algorithm for short-term scheduling of batch operations */I , 1993 .

[2]  Ignacio E. Grossmann,et al.  Assignment and sequencing models for thescheduling of process systems , 1998, Ann. Oper. Res..

[3]  Ferenc Friedler,et al.  Combinatorial framework for effective scheduling of multipurpose batch plants , 2002 .

[5]  In-Beum Lee,et al.  Scheduling of non-sequential multipurpose batch processes under finite intermediate storage policy , 2000 .

[6]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[7]  Christodoulos A. Floudas,et al.  Short-term scheduling : New mathematical models vs algorithmic improvements , 1998 .

[8]  J. M. Pinto,et al.  A Continuous Time Mixed Integer Linear Programming Model for Short Term Scheduling of Multistage Batch Plants , 1995 .

[9]  C. Pantelides,et al.  A simple continuous-time process scheduling formulation and a novel solution algorithm , 1996 .

[10]  L. T. Fan,et al.  Graph-theoretic approach to process synthesis: axioms and theorems , 1992 .

[11]  H. Ku,et al.  Scheduling in serial multiproduct batch processes with finite interstage storage: mixed integer linear program formulation , 1988 .

[12]  In-Beum Lee,et al.  Completion times algorithm of multi-product batch processes for common intermediate storage policy (CIS) with nonzero transfer and set-up times , 1996 .

[13]  Ferenc Friedler,et al.  SCHEDULING OF MULTIPURPOSE BATCH PROCESSES WITH MULTIPLE BATCHES OF THE PRODUCTS , 2002 .

[14]  In-Beum Lee,et al.  Optimal Scheduling of Multiproduct Batch Processes for Various Intermediate Storage Policies , 1996 .

[15]  Iftekhar A. Karimi,et al.  Completion time algorithms for serial multiproduct batch processes with shared storage , 1990 .

[16]  I. Grossmann,et al.  MILP model for scheduling and design of a special class of multipurpose batch plants , 1996 .