Simultaneous Batching and Scheduling Using Dynamic Decomposition on a Grid

Scheduling problems arise in many applications in process industries. However, despite various efforts to develop efficient scheduling methods, current approaches cannot be used to solve instances of industrial importance in reasonable time frames. The goal of this paper is the development of a dynamic decomposition framework that exploits the structure of the problem and is well suited for grid computing. The problem we study is the simultaneous batching and scheduling of multistage batch processes for which the binary decision variables are batch selection, batch-unit assignment, and batch sequencing on units. We present methods to decompose the original problem into a number of subproblems in a dynamic fashion. First, we discuss the generation of subproblems based on fixing the batch-selection variables. Second, we generate subproblems by fixing the batch-unit assignment variables in a bottlenecking stage. Third, we generate subproblems by fixing the last batch in the sequence on each unit of the bottlenecking stage. Furthermore, the second and third methods can be carried out in various combinations. Alternatively, a problem can be decomposed into a number of promising subproblems using an automatic strong branching scheme. Our results show that the proposed method can be used on a grid computer to solve large problems to optimality in a reasonable computational time.

[1]  Miron Livny,et al.  A worldwide flock of Condors: Load sharing among workstation clusters , 1996, Future Gener. Comput. Syst..

[2]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[3]  Jeffrey D. Kelly.  Chronological decomposition heuristic for scheduling: Divide and conquer method , 2002 .

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

[5]  Chi Wai Hui,et al.  A novel MILP formulation for short-term scheduling of multistage multi-product batch plants , 2000 .

[6]  P. Castro,et al.  Two New Continuous-Time Models for the Scheduling of Multistage Batch Plants with Sequence Dependent Changeovers , 2006 .

[7]  Pedro M. Castro,et al.  New Continuous-Time MILP Model for the Short-Term Scheduling of Multistage Batch Plants , 2005 .

[8]  Iftekhar A. Karimi,et al.  Scheduling Parallel Production Lines with Resource Constraints. 1. Model Formulation , 2002 .

[9]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[10]  Klaus Neumann,et al.  Advanced production scheduling for batch plants in process industries , 2002, OR Spectr..

[11]  Ignacio E. Grossmann,et al.  A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants , 2004, Comput. Chem. Eng..

[12]  Christos T. Maravelias,et al.  Simultaneous Batching and Scheduling in Multistage Multiproduct Processes , 2008 .

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

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

[15]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

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

[17]  Lazaros G. Papageorgiou,et al.  A hybrid MILP/CLP algorithm for multipurpose batch process scheduling , 2005, Comput. Chem. Eng..

[18]  Christos T. Maravelias,et al.  Batch selection, assignment and sequencing in multi-stage multi-product processes , 2008, Comput. Chem. Eng..

[19]  Jaime Cerdá,et al.  An MILP continuous-time approach to short-term scheduling of resource-constrained multistage flowshop batch facilities , 2001 .

[20]  Danielle Zyngier,et al.  Hierarchical decomposition heuristic for scheduling: Coordinated reasoning for decentralized and distributed decision-making problems , 2008, Comput. Chem. Eng..

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

[22]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[23]  Christos T. Maravelias,et al.  A decomposition framework for the scheduling of single- and multi-stage processes , 2006, Comput. Chem. Eng..

[24]  Ignacio E. Grossmann,et al.  An Alternate MILP Model for Short-Term Scheduling of Batch Plants with Preordering Constraints , 1996 .

[25]  Jeffrey Dean Kelly,et al.  Smooth-and-dive accelerator: a pre-MILP primal heuristic applied to scheduling , 2003, Comput. Chem. Eng..

[26]  Jaime Cerdá,et al.  State-of-the-art review of optimization methods for short-term scheduling of batch processes , 2006, Comput. Chem. Eng..

[27]  Michael C. Ferris,et al.  Grid-Enabled Optimization with GAMS , 2009, INFORMS J. Comput..

[28]  Christos T. Maravelias,et al.  Modeling of Storage in Batching and Scheduling of Multistage Processes , 2008 .