(736d) Integrated Planning, Scheduling, and Dynamic Optimization of Continuous Manufacturing Processes

Planning, scheduling, and dynamic optimization of chemical processes are highly interconnected [1-5]. The aim of planning is to determine the production assignment of the manufacture processes from the enterprise level over a long time horizon. In each planning periods, scheduling is used to determine the production sequence and time, task assignment, resource allocation, etc. Dynamic optimization is to determine the optimal transition processes when different products are manufactured in a processing unit sequentially. Though the three problems are able to be solved sequentially, the integration of these problems will result in a better performance compared to sequential approaches and has gathered increasing attention recently [6-16].

However, most of the previous studies concentrate on only parts of the integrated problem. Some works focus on the integrated problem of planning and scheduling, where the transition times and the transition costs are assumed to be known parameters [12]. Some other works concentrate on the integration of scheduling and dynamic optimization considering variable transition times and transition costs, which are determined by time-dependent trajectories [7, 17-20]. The integrated problem is formulated into a mixed-integer dynamic optimization (MIDO) model, which is then reformulated into a mixed-integer nonlinear programming (MINLP) full space model by discretizing the differential equations [7, 21, 22]. The full space model characterizes all the detailed information of planning, scheduling, and dynamic optimization, however, a large amount of computational time is needed to solve the full space model due to its large-scale [23].

In this work, we propose a novel method for solving the integrated planning, scheduling, and dynamic optimization problem for a multi-product continuous process. We first reformulate the integrated MIDO problem into a large-scale MINLP full space problem. To reduce the computational complexity, we propose an efficient flexible recipe method which can approximate the full space model into an online planning and scheduling model and offline dynamic optimization models. The key is that the planning and scheduling model is linked to the dynamic models via transition times and transition costs. The relationship between a transition time and the corresponding transition cost can be approximated by a set of discrete points, which are obtained by solving the dynamic optimization problems offline. The candidate transition times and transition costs are then appended to the planning and scheduling level problem, replacing the nonlinear equations concerning the dynamic models. The flexible recipe method ends up to be a mixed-integer linear program (MILP), which is easier to solve than the original MINLP full space problem. A bi-level decomposition method is then introduced to further improve the computational efficiency of the flexible recipe method, which formulates the upper level planning problem and lower level detailed problem. The Bi-level method then solves the upper and lower level problems iteratively until a pre-determined stopping condition is met.

To demonstrate the applicability of the proposed full space modeling framework, flexible recipe method and bi-level decomposition algorithm, we investigate a methyl methacrylate (MMA) polymerization process with azobisiso-butyronitrile initiator and a toluene solvent. The dynamic model of the MMA process is described by a set of differential equations. Different products with different molecular weights are produced during the steady state production time period. Through the proper arrangement of the production manufacturing, the process industry will be able to increase their profits. An integrated model is formulated to contain decision making across production assignment, production sequence and time and transition process strategy according to specific order demand. In a small scale problem, there are 3 products and 3 24-hour-long planning periods. The result reveals that: both the flexible recipe method and the bi-level decomposition algorithm can solve the problem within 2 seconds with the MILP solver CPLEX 12, while the full space method takes 3,000 seconds computational time to solve the problem with the MINLP solver SBB. In a large scale problem, there are 5 products and 4 168-hour-long planning periods. The bi-level decomposition algorithm can solve the problem within 2 minutes and the flexible recipe method can solve the problem with about 40 min (both methods use the MILP solver CPLEX 12), while the full space method fails to obtain a feasible solution within 30 hours with the MINLP solver SBB. From the result of the case study, the computational efficiency of the proposed solution methods is demonstrated.

  References

[1]        J. Kallrath, "Planning and scheduling in the process industry," Or Spectrum, vol. 24, pp. 219-250, Aug 2002.

[2]        I. Harjunkoski, R. Nyström, and A. Horch, "Integration of scheduling and control—Theory or practice?," Computers & Chemical Engineering, vol. 33, pp. 1909-1918, 2009.

[3]        E. Capon-Garcia, M. Moreno-Benito, and A. Espuna, "Improved Short-Term Batch Scheduling Flexibility Using Variable Recipes," Industrial & Engineering Chemistry Research, vol. 50, pp. 4983-4992, May 4 2011.

[4]        P. M. Verderame, J. A. Elia, J. Li, and C. A. Floudas, "Planning and Scheduling under Uncertainty: A Review Across Multiple Sectors," Industrial & Engineering Chemistry Research, vol. 49, pp. 3993-4017, May 5 2010.

[5]        C. T. Maravelias and C. Sung, "Integration of production planning and scheduling: Overview, challenges and opportunities," Computers & Chemical Engineering, vol. 33, pp. 1919-1930, Dec 10 2009.

[6]        I. Grossmann, "Enterprise-wide optimization: A new frontier in process systems engineering," AIChE Journal, vol. 51, pp. 1846-1857, Jul 2005.

[7]        Y. F. Chu and F. Q. You, "Integration of scheduling and control with online closed-loop implementation: Fast computational strategy and large-scale global optimization algorithm," Computers & Chemical Engineering, vol. 47, pp. 248-268, Dec 20 2012.

[8]        Y. F. Chu and F. Q. You, "Integrated Scheduling and Dynamic Optimization of Complex Batch Processes with General Network Structure Using a Generalized Benders Decomposition Approach," Industrial & Engineering Chemistry Research, vol. 52, pp. 7867-7885, Jun 12 2013.

[9]        J. J. Zhuge and M. G. Ierapetritou, "Integration of Scheduling and Control with Closed Loop Implementation," Industrial & Engineering Chemistry Research, vol. 51, pp. 8550-8565, Jun 27 2012.

[10]      S. Terrazas-Moreno, A. Flores-Tlacuahuac, and I. E. Grossmann, "Lagrangean heuristic for the scheduling and control of polymerization reactors," AIChE Journal, vol. 54, pp. 163-182, Jan 2008.

[11]      Z. K. Li and M. G. Ierapetritou, "Integrated production planning and scheduling using a decomposition framework," Chemical Engineering Science, vol. 64, pp. 3585-3597, Aug 15 2009.

[12]      M. Erdirik-Dogan and I. E. Grossmann, "A decomposition method for the simultaneous planning and scheduling of single-stage continuous multiproduct plants," Industrial & Engineering Chemistry Research, vol. 45, pp. 299-315, Jan 4 2006.

[13]      Y. Chu, F. You, J. M. Wassick, and A. Agarwal, "Integrated planning and scheduling under production uncertainties: Bi-level model formulation and hybrid solution method," Computers & Chemical Engineering, 2014.

[14]      D. B. Birewar and I. E. Grossmann, "Simultaneous Production Planning and Scheduling in Multiproduct Batch Plants," Industrial & Engineering Chemistry Research, vol. 29, pp. 570-580, Apr 1990.

[15]      D. J. Yue and F. Q. You, "Planning and Scheduling of Flexible Process Networks Under Uncertainty with Stochastic Inventory: MINLP Models and Algorithm," AIChE Journal, vol. 59, pp. 1511-1532, May 2013.

[16]      A. Flores-Tlacuahuac and I. E. Grossmann, "Simultaneous cyclic scheduling and control of a multiproduct CSTR," Industrial & Engineering Chemistry Research, vol. 45, pp. 6698-6712, Sep 27 2006.

[17]      Y. F. Chu and F. Q. You, "Integrated Scheduling and Dynamic Optimization of Sequential Batch Processes with Online Implementation," AIChE Journal, vol. 59, pp. 2379-2406, Jul 2013.

[18]      Y. F. Chu and F. Q. You, "Integration of production scheduling and dynamic optimization for multi-product CSTRs: Generalized Benders decomposition coupled with global mixed-integer fractional programming," Computers & Chemical Engineering, vol. 58, pp. 315-333, Nov 11 2013.

[19]      Y. F. Chu and F. Q. You, "Integration of Scheduling and Dynamic Optimization of Batch Processes under Uncertainty: Two-Stage Stochastic Programming Approach and Enhanced Generalized Benders Decomposition Algorithm," Industrial & Engineering Chemistry Research, vol. 52, pp. 16851-16869, Nov 27 2013.

[20]      A. Flores-Tlacuahuac and I. E. Grossmann, "Simultaneous Scheduling and Control of Multiproduct Continuous Parallel Lines," Industrial & Engineering Chemistry Research, vol. 49, pp. 7909-7921, Sep 1 2010.

[21]      V. Bansal, V. Sakizlis, R. Ross, J. D. Perkins, and E. N. Pistikopoulos, "New algorithms for mixed-integer dynamic optimization," Computers & Chemical Engineering, vol. 27, pp. 647-668, May 15 2003.

[22]      R. J. Allgor and P. I. Barton, "Mixed-integer dynamic optimization I: problem formulation," Computers & Chemical Engineering, vol. 23, pp. 567-584, May 1 1999.

[23]      L. T. Biegler, Nonlinear programming: concepts, algorithms, and applications to chemical processes vol. 10: SIAM, 2010.