New Continuous-Time MILP Model for the Short-Term Scheduling of Multistage Batch Plants

This paper presents a new multiple-time-grid, continuous-time mixed-integer linear program (MILP) model for the short-term scheduling of multistage, multiproduct plants. It can handle both release and due dates and different objective functions efficiently, such as the minimization of total cost, total earliness, or makespan. This formulation is compared to other existing mixed-integer linear programming approaches and to a constraint-programming model. The results show that the proposed formulation is much more efficient than its uniform-time-grid counterpart and is comparable to a continuous-time formulation that uses global precedence sequencing variables. Discrete-time formulations are preferred for larger scheduling problems where a reasonable number of time points are sufficient for the exact problem data. The results also show that the constraint-programming model is the best approach for makespan minimization.

[1]  Christodoulos A. Floudas,et al.  Enhanced Continuous-Time Unit-Specific Event-Based Formulation for Short-Term Scheduling of Multipurpose Batch Processes: Resource Constraints and Mixed Storage Policies. , 2004 .

[2]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[3]  Ignacio E. Grossmann,et al.  Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods , 2002 .

[4]  Iftekhar A. Karimi,et al.  An Improved MILP Formulation for Scheduling Multiproduct, Multistage Batch Plants , 2003 .

[5]  Jaime Cerdá,et al.  An efficient MILP continuous-time formulation for short-term scheduling of multiproduct continuous facilities , 2002 .

[6]  Christodoulos A. Floudas,et al.  Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review , 2004, Comput. Chem. Eng..

[7]  Pedro M. Castro,et al.  An efficient MILP model for the short-term scheduling of single stage batch plants , 2006, Comput. Chem. Eng..

[8]  A. Barbosa‐Póvoa,et al.  Simple Continuous-Time Formulation for Short-Term Scheduling of Batch and Continuous Processes , 2004 .

[9]  Ignacio E. Grossmann,et al.  New General Continuous-Time State−Task Network Formulation for Short-Term Scheduling of Multipurpose Batch Plants , 2003 .

[10]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[11]  N. Giannelos,et al.  A Simple New Continuous-Time Formulation for Short-Term Scheduling of Multipurpose Batch Processes , 2002 .

[12]  Pascal Van Hentenryck.  The OPL optimization programming language , 1999 .

[13]  John N. Hooker,et al.  Logic, Optimization, and Constraint Programming , 2002, INFORMS J. Comput..

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

[15]  R. Raman,et al.  Modelling and computational techniques for logic based integer programming , 1994 .

[16]  Ignacio E. Grossmann,et al.  Minimization of the Makespan with a Discrete-Time State−Task Network Formulation , 2003 .