Advances in mixed-integer programming methods for chemical production scheduling

Annual Review of Chemical and Biomolecular Engineering

Volumn 5, Issue , 2014, Pages 97-121

  Velez, Sara ^a   Maravelias, Christos T ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Chemical supply chain; Process operations; Process systems engineering; Reformulations; Solution methods; Valid inequalities

Indexed keywords

CHEMICAL OPERATIONS; PRODUCTION CONTROL; PRODUCTION ENGINEERING; SCHEDULING; SUPPLY CHAINS;

CHEMICAL SUPPLY CHAINS; PROCESS OPERATION; PROCESS SYSTEMS ENGINEERING; REFORMULATIONS; SOLUTION METHODS; VALID INEQUALITY;

INTEGER PROGRAMMING;

ALGORITHM; BIOLOGY; CHEMICAL INDUSTRY; CHEMICAL SUPPLY CHAIN; COMPUTER PROGRAM; METHODOLOGY; PROCESS OPERATIONS; PROCESS SYSTEMS ENGINEERING; REFORMULATIONS; REPRODUCIBILITY; REVIEW; SOLUTION METHODS; THEORETICAL MODEL; TIME; VALID INEQUALITIES;

CHEMICAL SUPPLY CHAIN; PROCESS OPERATIONS; PROCESS SYSTEMS ENGINEERING; REFORMULATIONS; SOLUTION METHODS; VALID INEQUALITIES;

ALGORITHMS; CHEMICAL INDUSTRY; COMPUTATIONAL BIOLOGY; MODELS, THEORETICAL; REPRODUCIBILITY OF RESULTS; SOFTWARE; TIME FACTORS;

EID: 84902470295     PISSN: 19475438     EISSN: None     Source Type: Journal    
DOI: 10.1146/annurev-chembioeng-060713-035859     Document Type: Review

References (121)

1. Ḿendez CA, Cerda J, Grossmann IE, Harjunkoski I, Fahl M. 2006. State-of-The-Art review of optimization methods for short-term scheduling of batch processes. Comput. Chem. Eng. 30:913-46
2. Maravelias CT. 2012. General framework and modeling approach classification for chemical production scheduling. AIChE J. 58:1812-28
3. Velez S, Sundaramoorthy A, Maravelias CT. 2013. Valid inequalities based on demand propagation for chemical production scheduling MIP models. AIChE J. 59:872-87
4. Velez S, Maravelias CT. 2013. Reformulations and branching methods for mixed-integer programming chemical production scheduling models. Ind. Eng. Chem. Res. 52:3832-41
5. Stadtler H. 2005. Supply chain management and advanced planning-basics, overview and challenges. Eur. J. Oper. Res. 163:575-88
6. Shapiro JF. 2007. Modeling the Supply Chain. Belmont, CA: Thomson-Brooks/Cole. 608 pp.
7. Varma VA, Reklaitis GV, Blau GE, Pekny JF. 2007. Enterprise-wide modeling & optimization-An overview of emerging research challenges and opportunities. Comput. Chem. Eng. 31:692-711
8. Grossmann I. 2005. Enterprise-wide optimization: A new frontier in process systems engineering. AIChE J. 51:1846-57
9. Voudouris VT, Grossmann IE. 1996. MILP model for scheduling and design of a special class of multipurpose batch plants. Comput. Chem. Eng. 20:1335-60
10. Kallrath J. 2002. Planning and scheduling in the process industry. OR Spectr. 24:219-50
11. Maravelias CT, Sung C. 2009. Integration of production planning and scheduling: Overview, challenges and opportunities. Comput. Chem. Eng. 33:1919-30
12. Shobrys DE, White DC. 2002. Planning, scheduling and control systems: Why cannot theywork together. Comput. Chem. Eng. 26:149-60
13. Harjunkoski I, Nystrom R, Horch A. 2009. Integration of scheduling and control-Theory or practice. Comput. Chem. Eng. 33:1909-18
14. Engell S, Harjunkoski I. 2012. Optimal operation: scheduling, advanced control and their integration. Comput. Chem. Eng. 47:121-33
15. Pinedo M. 2002. Scheduling: Theory, Algorithms, and Systems. Upper Saddle River, NJ: Prentice Hall. 586 pp.
16. Carlier J, Pinson E. 1989. An algorithm for solving the job-shop problem. Manag. Sci. 35:164-76
17. Adams J, Balas E, Zawack D. 1988. The shifting bottleneck procedure for job shop scheduling. Manag. Sci. 34:391-401
18. Haupt R. 1989. A survey of priority rule-based scheduling. OR Spectr. 11:3-16
19. Piana S, Engell S. 2010. Hybrid evolutionary optimization of the operation of pipeless plants. J. Heuristics 16:311-36
20. Baptiste P, Le Pape C, Nuijten W. 2001. Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Boston: Kluwer Acad. 198 pp.
21. Van Hentenryck P, Michel L. 2005. Constraint-Based Local Search. Cambridge, MA: MIT Press. 422 pp.
22. Panek S, Engell S, Subbiah S, Stursberg O. 2008. Scheduling of multi-product batch plants based upon timed automata models. Comput. Chem. Eng. 32:275-91
23. Nemhauser GL, Wolsey LA. 1988. Integer and Combinatorial Optimization. New York:Wiley. 763 pp.
24. Wolsey LA. 1998. Integer Programming. New York:Wiley. 264 pp.
25. Hooker J. 2000. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. New York: John Wiley & Sons. 495 pp.
26. Hooker JN. 2002. Logic, optimization, and constraint programming. INFORMS J. Comput. 14:295-321
27. Sand G, Till J, Tometzki T, Urselmann M, Engell S, Emmerich M. 2008. Engineered versus standard evolutionary algorithms: a case study in batch scheduling with recourse. Comput. Chem. Eng. 32:2706-22
28. Bixby R, Rothberg E. 2007. Progress in computational mixed integer programming-A look back from the other side of the tipping point. Ann. Oper. Res. 149:37-41
29. Atamturk A, Savelsbergh MWP. 2005. Integer-programming software systems. Ann. Oper. Res. 140:67-124
30. Johnson EL, Nemhauser GL, Savelsbergh MWP. 2000. Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J. Comput. 12:2-23
31. Maravelias CT, Grossmann IE. 2006.Onthe relation of continuous-And discrete-time state-task network formulations. AIChE J. 52:843-49
32. Ku HM, Karimi IA. 1988. Scheduling in serial multiproduct batch processes with finite interstage storage-A mixed integer linear program formulation. Ind. Eng. Chem. Res. 27:1840-48
33. Pinto JM, Grossmann IE. 1995. A continuous-timemixed-integer linear-programming model for shortterm scheduling of multistage batch plants. Ind. Eng. Chem. Res. 34:3037-51
34. Cerda J, Henning GP, Grossmann IE. 1997. A mixed-integer linear programming model for short-term scheduling of single-stagemultiproduct batch plants with parallel lines. Ind. Eng. Chem. Res. 36:1695-707
35. Castro PM, Grossmann IE. 2005. New continuous-time MILP model for the short-term scheduling of multistage batch plants. Ind. Eng. Chem. Res. 44:9175-90
36. Liu Y, Karimi IA. 2007. Novel continuous-time formulations for scheduling multi-stage batch plants with identical parallel units. Comput. Chem. Eng. 31:1671-93
37. Liu Y, Karimi IA. 2007. Scheduling multistage, multiproduct batch plants with nonidentical parallel units and unlimited intermediate storage. Chem. Eng. Sci. 62:1549-66
38. Ferrer-Nadal S, Cap on-Garca E, Mendez CA, Puigjaner L. 2008. Material transfer operations in batch scheduling. A critical modeling issue. Ind. Eng. Chem. Res. 47:7721-32
39. Capon-Garca E, Ferrer-Nadal S, Graells M, Puigjaner L. 2009. An extended formulation for the flexible short-term scheduling of multiproduct semicontinuous plants. Ind. Eng. Chem. Res. 48:2009-19
40. KopanosGM, Lanez JM, Puigjaner L. 2009. An efficient mixed-integer linear programming scheduling framework for addressing sequence-dependent setup issues in batch plants. Ind. Eng. Chem. Res. 48:6346-57
41. Gupta S, Karimi IA. 2003. An improved MILP formulation for scheduling multiproduct, multistage batch plants. Ind. Eng. Chem. Res. 42:2365-80
42. Chen CL, Liu CL, Feng XD, Shao HH. 2002. Optimal short-term scheduling of multiproduct singlestage batch plants with parallel lines. Ind. Eng. Chem. Res. 41:1249-60
43. Castro PM, Grossmann IE, Novais AQ. 2006. Two new continuous-time models for the scheduling of multistage batch plants with sequence dependent changeovers. Ind. Eng. Chem. Res. 45:6210-26
44. Mendez CA, Cerda J. 2003. An MILP continuous-time framework for short-term scheduling of multipurpose batch processes under different operation strategies. Optim. Eng. 4:7-22
45. Mendez CA, Henning GP, Cerda J. 2001. An MILP continuous-time approach to short-term scheduling of resource-constrained multistage flowshop batch facilities. Comput. Chem. Eng. 25:701-11
46. Lim MF, Karimi IA. 2003. Resource-constrained scheduling of parallel production lines using asynchronous slots. Ind. Eng. Chem. Res. 42:6832-42
47. Mendez CA, Henning GP, Cerda J. 2000. Optimal scheduling of batch plants satisfying multiple product orders with different due-dates. Comput. Chem. Eng. 24:2223-45
48. Castro PM, Erdirik-Dogan M, Grossmann IE. 2008. Simultaneous batching and scheduling of single stage batch plants with parallel units. AIChE J. 54:183-93
49. Prasad P, Maravelias CT. 2008. Batch selection, assignment and sequencing inmulti-stage multi-product processes. Comput. Chem. Eng. 32:1106-19
50. Sundaramoorthy A, Maravelias CT. 2008. Simultaneous batching and scheduling in multistage multiproduct processes. Ind. Eng. Chem. Res. 47:1546-55
51. Sundaramoorthy A, Maravelias CT. 2008. Modeling of storage in batching and scheduling of multistage processes. Ind. Eng. Chem. Res. 47:6648-60
52. Sundaramoorthy A, Maravelias CT, Prasad P. 2009. Scheduling of multistage batch processes under utility constraints. Ind. Eng. Chem. Res. 48:6050-58
53. Kondili E, Pantelides CC, Sargent RWH. 1993. A general algorithm for short-term scheduling of batch-operations-1. MILP formulation. Comput. Chem. Eng. 17:211-27
54. Shah N, Pantelides CC, Sargent RWH. 1993. A general algorithm for short-term scheduling of batch-operations-2. Computational issues. Comput. Chem. Eng. 17:229-44
55. Pantelides CC. 1994. Unified frameworks for optimal process planning and scheduling. Presented at 2nd Conf. Found. Comput. Aided Process Oper., Snowmass, CO
56. Schilling G, Pantelides CC. 1996. A simple continuous-time process scheduling formulation and a novel solution algorithm. Comput. Chem. Eng. 20:S1221-26
57. Mockus L, Reklaitis GV. 1999. Continuous time representation approach to batch and continuous process scheduling. MINLP formulation. Ind. Eng. Chem. Res. 38:197-203
58. Mockus L, Reklaitis GV. 1999. Continuous time representation approach to batch and continuous process scheduling. Computational issues. Ind. Eng. Chem. Res. 38:204-10
59. Castro P, Barbosa-Povoa APFD, Matos H. 2001. An improved RTN continuous-time formulation for the short-term scheduling of multipurpose batch plants. Ind. Eng. Chem. Res. 40:2059-68
60. Maravelias CT, Grossmann IE. 2003. A general continuous state task network formulation for short term scheduling of multipurpose batch plants with due dates. Comput.-Aided Chem. Eng. 14:215
61. Sundaramoorthy A, Karimi IA. 2005. A simpler better slot-based continuous-time formulation for shortterm scheduling in multipurpose batch plants. Chem. Eng. Sci. 60:2679-702
62. Zhang X, Sargent RWH. 1996. The optimal operation of mixed production facilities-A general formulation and some approaches for the solution. Comput. Chem. Eng. 20:897-904
63. LeeKH, Park HI, Lee IB. 2001. A novel nonuniform discrete time formulation for short-term scheduling of batch and continuous processes. Ind. Eng. Chem. Res. 40:4902-11
64. Giannelos NF, Georgiadis MC. 2002. A novel event-driven formulation for short-term scheduling of multipurpose continuous processes. Ind. Eng. Chem. Res. 41:2431-39
65. Ierapetritou MG, Floudas CA. 1998. Effective continuous-time formulation for short-term scheduling. Multipurpose batch processes. Ind. Eng. Chem. Res. 37:4341-59
66. Ierapetritou MG, Floudas CA. 1998. Effective continuous-time formulation for short-term scheduling. Continuous and semicontinuous processes. Ind. Eng. Chem. Res. 37:4360-74
67. Janak SL, Floudas CA. 2008. Improving unit-specific event based continuous-time approaches for batch processes: integrality gap and task splitting. Comput. Chem. Eng. 32:913-55
68. Susarla N, Li J, Karimi IA. 2010. A novel approach to scheduling multipurpose batch plants using unit-slots. AIChE J. 56:1859-79
69. Shaik MA, Floudas CA. 2009. Novel unified modeling approach for short-term scheduling. Ind. Eng. Chem. Res. 48:2947-64
70. Janak SL, Lin XX, Floudas CA. 2004. Enhanced continuous-time unit-specific event-based formulation for short-term scheduling of multipurpose batch processes: resource constraints and mixed storage policies. Ind. Eng. Chem. Res. 43:2516-33
71. Saharidis GKD, Minoux M, Dallery Y. 2009. Scheduling of loading and unloading of crude oil in a refinery using event-based discrete time formulation. Comput. Chem. Eng. 33:1413-26
72. Maravelias CT. 2005. Mixed-time representation for state-task network models. Ind. Eng. Chem. Res. 44:9129-45
73. Velez S, Maravelias CT. 2013. Multiple and nonuniform time grids in discrete-time MIP models for chemical production scheduling. Comput. Chem. Eng. 53:70-85
74. Baumann P, Trautmann N. 2013. A continuous-time MILP model for short-term scheduling of makeand-pack production processes. Int. J. Prod. Res. 51:1707-27
75. Kelly JD, Zyngier D. 2009. Multi-product inventory logistics modeling in the process industries. In Optimization and Logistics Challenges in the Enterprise, ed.WChaovalitwongse, KC Furman, PMPardalos, pp. 61-95. New York: Springer
76. Gimenez DM, Henning GP, Maravelias CT. 2009. A novel network-based continuous-time representation for process scheduling: part I. Main concepts and mathematical formulation. Comput. Chem. Eng. 33:1511-28
77. Gimenez DM, Henning GP, Maravelias CT. 2009. A novel network-based continuous-time representation for process scheduling: part II. General framework. Comput. Chem. Eng. 33:1644-60
78. Sundaramoorthy A, Maravelias CT. 2011. A general framework for process scheduling. AIChE J. 57:695-710
79. Velez S, Maravelias CT. 2013. Mixed-integer programming model and tightening methods for scheduling in general chemical production environments. Ind. Eng. Chem. Res. 52:3407-23
80. Pochet Y, Wolsey LA. 2006. Production Planning by Mixed Integer Programming. New York/Berlin: Springer. 499 pp.
81. Benders JF. 1962. Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4:238-52
82. Fisher ML. 1981. The Lagrangian relaxationmethod for solving integer programming problems. Manag. Sci. 27:1-18
83. Hooker J. 2007. Integrated Methods for Optimization. New York: Springer. 486 pp.
84. Bussieck MR, Ferris MC, Meeraus A. 2009. Grid-enabled optimization with GAMS. INFORMS J. Comput. 21:349-62
85. Pinto JM, Grossmann IE. 1998. Assignment and sequencingmodels for the scheduling of process systems. Ann. Oper. Res. 81:433-66
86. Floudas CA, Lin XX. 2004. Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review. Comput. Chem. Eng. 28:2109-29
87. Mouret S, Grossmann IE, Pestiaux P. 2011. Time representations and mathematical models for process scheduling problems. Comput. Chem. Eng. 35:1038-63
88. Blomer F, GuntherHO. 2000. LP-based heuristics for scheduling chemical batch processes. Int. J. Prod. Res. 38:1029-51
89. Burkard RE, Hatzl J. 2005. Review, extensions and computational comparison of MILP formulations for scheduling of batch processes. Comput. Chem. Eng. 29:1752-69
90. Sahinidis NV, Grossmann IE. 1991. Reformulation of multiperiod MILP models for planning and scheduling of chemical processes. Comput. Chem. Eng. 15:255-72
91. Yee KL, ShahN. 1998. Improving the efficiency of discrete time scheduling formulation. Comput. Chem. Eng. 22(Suppl. 1):S403-S10
92. Papageorgiou LG, Pantelides CC. 1996. Optimal campaign planning scheduling of multipurpose batch semicontinuous plants. A mathematical decomposition approach. Ind. Eng. Chem. Res. 35:510-29
93. Bassett MH, Pekny JF, Reklaitis GV. 1996. Decomposition techniques for the solution of large-scale scheduling problems. AIChE J. 42:3373-87
94. Kelly JD, Zyngier D. 2008. Hierarchical decomposition heuristic for scheduling: coordinated reasoning for decentralized and distributed decision-making problems. Comput. Chem. Eng. 32:2684-705
95. Maravelias CT, Grossmann IE. 2003. Minimization of the makespan with a discrete-time state-task network formulation. Ind. Eng. Chem. Res. 42:6252-57
96. Wu D, Ierapetritou MG. 2003. Decomposition approaches for the efficient solution of short-term scheduling problems. Comput. Chem. Eng. 27:1261-76
97. Calfa BA, Agarwal A, Grossmann IE, Wassick JM. 2013. Hybrid bilevel-Lagrangean decomposition scheme for the integration of planning and scheduling of a network of batch plants. Ind. Eng. Chem. Res. 52:2152-67
98. Dimitriadis AD, ShahN, Pantelides CC. 1997. RTN-based rolling horizon algorithms for medium term scheduling of multipurpose plants. Comput. Chem. Eng. 21:S1061-S66
99. Lin XX, Floudas CA, Modi S, Juhasz NM. 2002. Continuous-time optimization approach for mediumrange production scheduling of a multiproduct batch plant. Ind. Eng. Chem. Res. 41:3884-906
100. Mendez CA, Cerda J. 2003. Dynamic scheduling in multiproduct batch plants. Comput. Chem. Eng. 27:1247-59
101. Roslof J, Harjunkoski I, Bjorkqvist J, Karlsson S, Westerlund T. 2001. An MILP-based reordering algorithm for complex industrial scheduling and rescheduling. Comput. Chem. Eng. 25:821-28
102. Kopanos GM, Mendez CA, Puigjaner L. 2010. MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry. Eur. J. Oper. Res. 207:644-55
103. Jain V, Grossmann IE. 2001. Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput. 13:258-76
104. Harjunkoski I, Grossmann IE. 2002. Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput. Chem. Eng. 26:1533-52
105. MaraveliasCT.2006.Adecomposition framework for the scheduling of single-Andmulti-stage processes. Comput. Chem. Eng. 30:407-20
106. Maravelias CT, Grossmann IE. 2004. A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants. Comput. Chem. Eng. 28:1921-49
107. Roe B, Papageorgiou LG, ShahN. 2005. A hybridMILP/CLP algorithm formultipurpose batch process scheduling. Comput. Chem. Eng. 29:1277-91
108. Subrahmanyam S, Kudva GK, Bassett HH, Pekny JF. 1996. Application of distributed computing to batch plant design and scheduling. AIChE J. 42:1648-61
109. Ferris MC, Maravelias CT, Sundaramoorthy A. 2009. Simultaneous batching and scheduling using dynamic decomposition on a grid. INFORMS J. Comput. 21:398-410
110. Velez S, Maravelias CT. 2013. A branch-And-bound algorithm for the solution of chemical production scheduling MIP models using parallel computing. Comput. Chem. Eng. 55:28-39
111. Pochet Y, Warichet F. 2008. A tighter continuous time formulation for the cyclic scheduling of a mixed plant. Comput. Chem. Eng. 32:2723-44
112. Maravelias CT, Papalamprou K. 2009. Polyhedral results for discrete-time production planning MIP formulations for continuous processes. Comput. Chem. Eng. 33:1890-904
113. Maravelias CT. 2012. On the combinatorial structure of discrete-time MIP formulations for chemical production scheduling. Comput. Chem. Eng. 38:204-12
114. Sundaramoorthy A, Maravelias CT. 2011. Computational study of network-based mixed-integer programming approaches for chemical production scheduling. Ind. Eng. Chem. Res. 50:5023-40
115. Merchan AF, Velez S, Maravelias CT. 2013. Tightening methods for continuous-time mixed-integer programming models for chemical production scheduling. AIChE J. 59(12):4461-67
116. Grossmann IE, Biegler LT. 2004. Part II. Future perspective on optimization. Comput. Chem. Eng. 28:1193-218
117. Subramanian K, Maravelias CT, Rawlings JB. 2012. A state-space model for chemical production scheduling. Comput. Chem. Eng. 47:97-110
118. Dantzig G, Fulkerson R, Johnson S. 1954. Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2:393-410
119. Gomory RE. 1958. Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64:275-78
120. Land AH, Doig AG. 1960. An automaticmethod of solving discrete programming problems. Econometrica 28:497-520
121. Dakin RJ. 1965. A tree-search algorithm for mixed integer programming problems. Comput. J. 8:250-53