An MILP continuous-time approach to short-term scheduling of resource-constrained multistage flowshop batch facilities

Abstract This work presents a new MILP mathematical formulation for the resource-constrained short-term scheduling of flowshop batch facilities with a known topology and limited supplies of discrete resources. The processing structure is composed of multiple stages arranged in series and several units working in parallel at each one. All production orders consist of a single batch and follow the same processing sequence throughout the plant. The proposed MILP approach is based on a continuous time domain representation that relies on the notion of order predecessor and accounts for sequence-dependent setup times. Assignment and sequencing decisions are independently handled through separate sets of binary variables. A proper formulation of the sequencing constraints provides a substantial saving in sequencing variables and constraints. By postulating a pair of conditions for the simultaneous execution of processing tasks, rather simple resource constraints requiring a few extra binary variables are derived. The proposed MILP scheduling approach shows a remarkable computational efficiency when applied to real-world problems.

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

[2]  Jaime Cerdá,et al.  Optimal scheduling of batch plants satisfying multiple product orders with different due-dates , 2000 .

[3]  Christodoulos A. Floudas,et al.  Effective Continuous-Time Formulation for Short-Term Scheduling. 2. Continuous and Semicontinuous Processes , 1998 .

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

[5]  G. Reklaitis,et al.  Mathematical programming formulation for scheduling of batch operations based on nonuniform time discretization , 1997 .

[6]  R. Sargent,et al.  The optimal operation of mixed production facilities—a general formulation and some approaches for the solution , 1996 .

[7]  I. Grossmann,et al.  A Mixed-Integer Linear Programming Model for Short-Term Scheduling of Single-Stage Multiproduct Batch Plants with Parallel Lines , 1997 .

[8]  Gintaras V. Reklaitis,et al.  Overview of Scheduling and Planning of Batch Process Operations , 1996 .

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

[10]  R. Sargent,et al.  A general algorithm for short-term scheduling of batch operations—II. Computational issues , 1993 .

[11]  C. Floudas,et al.  Effective Continuous-Time Formulation for Short-Term Scheduling. 1. Multipurpose Batch Processes , 1998 .

[12]  Ignacio E. Grossmann,et al.  A logic-based approach to scheduling problems with resource constraints , 1997 .