On the solution of large-scale mixed integer programming scheduling models

Chemical Engineering Science

Volumn 136, Issue , 2015, Pages 139-157

  Velez, Sara ^a   Merchan, Andres F ^a   Maravelias, Christos T ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Optimization; Process operations; Reformulations; Solution methods; Supply chain optimization; Tightening constraints

Indexed keywords

OPTIMIZATION; SCHEDULING; SUPPLY CHAINS;

COMPUTATIONAL PERFORMANCE; CONVERSION COEFFICIENTS; MIXED INTEGER PROGRAMMING; MIXED-INTEGER PROGRAMS; PROCESS OPERATION; REFORMULATIONS; SOLUTION METHODS; SUPPLY CHAIN OPTIMIZATION;

INTEGER PROGRAMMING;

EID: 84930335068     PISSN: 00092509     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ces.2015.05.021     Document Type: Article

References (76)

1. Adams, J., Balas, E., Zawack, D., The shifting bottleneck procedure for job shop scheduling. Manage. Sci. 34:3 (1988), 391–401.
2. Baptiste, P., Le Pape, C., Nuijten, W., Constraint-based Scheduling: Applying Constraint Programming to Scheduling Problems. 2001, Kluwer Academic, Boston, xii 198 p.
3. Barber, C.B., Dobkin, D.P., Huhdanpaa, H., The Quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22:4 (1996), 469–483.
4. Bassett, M.H., Pekny, J.F., Reklaitis, G.V., Decomposition techniques for the solution of large-scale scheduling problems. AIChE J. 42:12 (1996), 3373–3387.
5. Blomer, F., Gunther, H.O., LP-based heuristics for scheduling chemical batch processes. Int. J. Prod. Res. 38:5 (2000), 1029–1051.
6. Burkard, R.E., Hatzl, J., Review, extensions and computational comparison of MILP formulations for scheduling of batch processes. Comput. Chem. Eng. 29:8 (2005), 1752–1769.
7. Calfa, B.A., Agarwal, A., Grossmann, I.E., Wassick, J.M., Hybrid bilevel-Lagrangean decomposition scheme for the integration of planning and scheduling of a network of batch plants. Ind. Eng. Chem. Res. 52:5 (2013), 2152–2167.
8. Carlier, J., Pinson, E., An algorithm for solving the job-shop problem. Manage. Sci. 35:2 (1989), 164–176.
9. Castro, P., Barbosa-Povoa, A.P.F.D., Matos, H., An improved RTN continuous-time formulation for the short-term scheduling of multipurpose batch plants. Ind. Eng. Chem. Res. 40:9 (2001), 2059–2068.
10. Castro, P.M., Grossmann, I.E., New continuous-time MILP model for the short-term scheduling of multistage batch plants. Ind. Eng. Chem. Res. 44:24 (2005), 9175–9190.
11. Castro, P.M., Harjunkoski, I., Grossmann, I.E., Optimal scheduling of continuous plants with energy constraints. Comput. Chem. Eng. 35:2 (2011), 372–387.
12. Cerda, J., Henning, G.P., Grossmann, I.E., A mixed-integer linear programming model for short-term scheduling of single-stage multiproduct batch plants with parallel lines. Ind. Eng. Chem. Res. 36:5 (1997), 1695–1707.
13. Dimitriadis, A.D., Shah, N., Pantelides, C.C., RTN-based rolling horizon algorithms for medium term scheduling of multipurpose plants. Comput. Chem. Eng. 21 (1997), S1061–S1066.
14. Ferris, M.C., Maravelias, C.T., Sundaramoorthy, A., Simultaneous batching and scheduling using dynamic decomposition on a grid. INFORMS J. Comput. 21:3 (2009), 398–410.
15. Gimenez, D.M., Henning, G.P., Maravelias, C.T., A novel network-based continuous-time representation for process scheduling: Part I. Main concepts and mathematical formulation. Comput. Chem. Eng. 33:9 (2009), 1511–1528.
16. Gimenez, D.M., Henning, G.P., Maravelias, C.T., A novel network-based continuous-time representation for process scheduling: Part II. General framework. Comput. Chem. Eng. 33:10 (2009), 1644–1660.
17. Harjunkoski, I., Grossmann, I.E., Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput. Chem. Eng. 26:11 (2002), 1533–1552.
18. Harjunkoski, I., Maravelias, C.T., Bongers, P., Castro, P.M., Engell, S., Grossmann, I.E., Hooker, J., Méndez, C., Sand, G., Wassick, J., Scope for industrial applications of production scheduling models and solution methods. Comput. Chem. Eng. 62:0 (2014), 161–193.
19. Hooker, J., Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction. 2000, John Wiley & Sons, New York, NY, xvi 495 p.
20. Hooker, J.N. Logic, optimization, and constraint programming. INFORMS J. Comput. 14:4 (2002), 295–321.
21. Ierapetritou, M.G., Floudas, C.A., Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes. Ind. Eng. Chem. Res. 37:11 (1998), 4341–4359.
22. Jain, V., Grossmann, I.E., Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput. 13:4 (2001), 258–276.
23. Janak, S.L., Floudas, C.A., Improving unit-specific event based continuous-time approaches for batch processes: integrality gap and task splitting. Comput. Chem. Eng. 32:4-5 (2008), 913–955.
24. Janak, S.L., Lin, X.X., Floudas, C.A., 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:10 (2004), 2516–2533.
25. Kallrath, J., Planning and scheduling in the process industry. OR Spectrum 24:3 (2002), 219–250.
26. Kelly, J.D., Zyngier, D., Hierarchical decomposition heuristic for scheduling: coordinated reasoning for decentralized and distributed decision-making problems. Comput. Chem. Eng. 32:11 (2008), 2684–2705.
27. Kelly, J.D., Zyngier, D., Multi-product inventory logistics modeling in the process industries. Chaovalitwongse, W., Furman, K.C., Pardalos, P.M., (eds.) Optimization and Logistics Challenges in the Enterprise, 2009, Springer, New York, NY, 61–95.
28. Kondili, E., Pantelides, C.C., Sargent, R.W.H., A general algorithm for short-term scheduling of batch-operations. 1. Milp formulation. Comput. Chem. Eng. 17:2 (1993), 211–227.
29. Kopanos, G.M., Mendez, C.A., Puigjaner, L., 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:2 (2010), 644–655.
30. Ku, H.M., Karimi, I.A., Scheduling in serial multiproduct batch processes with finite interstage storage—a mixed integer linear program formulation. Ind. Eng. Chem. Res. 27:10 (1988), 1840–1848.
31. Lin, X.X., Floudas, C.A., Modi, S., Juhasz, N.M., Continuous-time optimization approach for medium-range production scheduling of a multiproduct batch plant. Ind. Eng. Chem. Res. 41:16 (2002), 3884–3906.
32. Maravelias, C.T., A decomposition framework for the scheduling of single- and multi-stage processes. Comput. Chem. Eng. 30:3 (2006), 407–420.
33. Maravelias, C.T., General framework and modeling approach classification for chemical production scheduling. AIChE J. 58:6 (2012), 1812–1828.
34. Maravelias, C.T., Grossmann, I.E., Minimization of the makespan with a discrete-time state-task network formulation. Ind. Eng. Chem. Res. 42:24 (2003), 6252–6257.
35. Maravelias, C.T., Grossmann, I.E., New general continuous-time state-task network formulation for short-term scheduling of multipurpose batch plants. Ind. Eng. Chem. Res. 42:13 (2003), 3056–3074.
36. Maravelias, C.T., Grossmann, I.E., A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants. Comput. Chem. Eng. 28:10 (2004), 1921–1949.
37. Mendez, C.A., Cerda, J., Dynamic scheduling in multiproduct batch plants. Comput. Chem. Eng. 27:8-9 (2003), 1247–1259.
38. Mendez, C.A., Cerda, J., Grossmann, I.E., Harjunkoski, I., Fahl, M., State-of-the-art review of optimization methods for short-term scheduling of batch processes. Comput. Chem. Eng. 30:6-7 (2006), 913–946.
39. Merchan A.F., Maravelias C.T. Preprocessing and tightening methods for time-indexed MIP chemical production scheduling models. Submitted for publication.
40. Merchan, A.F., Maravelias, C.T., Reformulations of mixed-integer programming continuous-time models for chemical production scheduling. Ind. Eng. Chem. Res. 53:24 (2014), 10155–10165.
41. Merchan, A.F., Velez, S., Maravelias, C.T., Tightening methods for continuous-time mixed-integer programming models for chemical production scheduling. AIChE J. 59:12 (2013), 4461–4467.
42. Mockus, L., Reklaitis, G.V., Continuous time representation approach to batch and continuous process scheduling. 1. MINLP formulation. Ind. Eng. Chem. Res. 38:1 (1999), 197–203.
43. Nie, Y., Biegler, L.T., Wassick, J.M., Villa, C.M., Extended discrete-time resource task network formulation for the reactive scheduling of a mixed batch/continuous process. Ind. Eng. Chem. Res., 2014.
44. Panek, S., Engell, S., Subbiah, S., Stursberg, O., Scheduling of multi-product batch plants based upon timed automata models. Comput. Chem. Eng. 32:1-2 (2008), 275–291.
45. Pantelides, C.C., 1994. In unified frameworks for optimal process planning and scheduling. In: Second Conference on Foundations of Computer Aided Process Operations, Snowmass, CO, CACHE Publications, pp. 253–274.
46. Papageorgiou, L.G., Pantelides, C.C., Optimal campaign planning scheduling of multipurpose batch semicontinuous plants. 2. A mathematical decomposition approach. Ind. Eng. Chem. Res. 35:2 (1996), 510–529.
47. Papageorgiou, L.G., Pantelides, C.C., Optimal campaign planning scheduling of multipurpose batch semicontinuous plants. 1. Mathematical formulation. Ind. Eng. Chem. Res. 35:2 (1996), 488–509.
48. Pinto, J.M., Grossmann, I.E., A continuous-time mixed-integer linear-programming model for short-term scheduling of multistage batch plants. Ind. Eng. Chem. Res. 34:9 (1995), 3037–3051.
49. Prasad, P., Maravelias, C.T., Batch selection, assignment and sequencing in multi-stage multi-product processes. Comput. Chem. Eng. 32:6 (2008), 1106–1119.
50. Roe, B., Papageorgiou, L.G., Shah, N., A hybrid MILP/CLP algorithm for multipurpose batch process scheduling. Comput. Chem. Eng. 29:6 (2005), 1277–1291.
51. Roslof, J., Harjunkoski, I., Bjorkqvist, J., Karlsson, S., Westerlund, T., An MILP-based reordering algorithm for complex industrial scheduling and rescheduling. Comput. Chem. Eng. 25:4-6 (2001), 821–828.
52. Sahinidis, N.V., Grossmann, I.E., Reformulation of multiperiod MILP models for planning and scheduling of chemical processes. Comput. Chem. Eng. 15:4 (1991), 255–272.
53. Schilling, G., Pantelides, C.C., A simple continuous-time process scheduling formulation and a novel solution algorithm. Comput. Chem. Eng. 20 (1996), S1221–S1226.
54. Shah, N., Pantelides, C.C., Sargent, R.W.H., A general algorithm for short-term scheduling of batch-operations. 2. Computational issues. Comput. Chem. Eng. 17:2 (1993), 229–244.
55. Subbiah, S., Schoppmeyer, C., Engell, S., An intuitive and efficient approach to process scheduling with sequence-dependent changeovers using timed automata models. Ind. Eng. Chem. Res. 50:9 (2011), 5131–5152.
56. Subrahmanyam, S., Kudva, G.K., Bassett, H.H., Pekny, J.F., Application of distributed computing to batch plant design and scheduling. AIChE J. 42:6 (1996), 1648–1661.
57. Sundaramoorthy, A., Karimi, I.A., A simpler better slot-based continuous-time formulation for short-term scheduling in multipurpose batch plants. Chem. Eng. Sci. 60:10 (2005), 2679–2702.
58. Sundaramoorthy, A., Maravelias, C.T., Simultaneous batching and scheduling in multistage multiproduct processes. Ind. Eng. Chem. Res. 47:5 (2008), 1546–1555.
59. Sundaramoorthy, A., Maravelias, C.T., Modeling of storage in batching and scheduling of multistage processes. Ind. Eng. Chem. Res. 47:17 (2008), 6648–6660.
60. Sundaramoorthy, A., Maravelias, C.T., A general framework for process scheduling. AIChE J. 57:3 (2011), 695–710.
61. Sundaramoorthy, A., Maravelias, C.T., Computational study of network-based mixed-integer programming approaches for chemical production scheduling. Ind. Eng. Chem. Res. 50:9 (2011), 5023–5040.
62. Susarla, N., Li, J., Karimi, I.A., A novel approach to scheduling multipurpose batch plants using unit-slots. AIChE J. 56:7 (2010), 1859–1879.
63. Velez, S., Maravelias, C.T., Multiple and nonuniform time grids in discrete-time MIP models for chemical production scheduling. Comput. Chem. Eng. 53 (2013), 70–85.
64. Velez, S., Maravelias, C.T., Mixed-integer programming model and tightening methods for scheduling in general chemical production environments. Ind. Eng. Chem. Res. 52:9 (2013), 3407–3423.
65. Velez, S., Maravelias, C.T., Reformulations and branching methods for mixed-integer programming chemical production scheduling models. Ind. Eng. Chem. Res. 52:10 (2013), 3832–3841.
66. Velez, S., Maravelias, C.T., A branch-and-bound algorithm for the solution of chemical production scheduling MIP models using parallel computing. Comput. Chem. Eng. 55:0 (2013), 28–39.
67. Velez, S., Maravelias, C.T., Theoretical framework for formulating MIP scheduling models with multiple and non-uniform discrete-time grids. Comput. Chem. Eng.(0), 2014.
68. Velez, S., Maravelias, C.T., Advances in mixed-integer programming methods for chemical production scheduling. Annu. Rev. Chem. Biomol. Eng. 5:1 (2014), 97–121.
69. Velez, S., Maravelias, C.T., Theoretical framework for formulating MIP scheduling models with multiple and non-uniform discrete-time grids. Comput. Chem. Eng. 72:0 (2015), 233–254.
70. Velez, S., Sundaramoorthy, A., Maravelias, C.T., Valid inequalities based on demand propagation for chemical production scheduling MIP models. AIChE J. 59:3 (2013), 872–887.
71. Vooradi, R., Shaik, M.A., Improved three-index unit-specific event-based model for short-term scheduling of batch plants. Comput. Chem. Eng. 43 (2012), 148–172.
72. Vooradi, R., Shaik, M.A., Gupta, N.M., Three-index model for Westenberger–Kallrath benchmark scheduling problem. AIP Conf. Proc. 1298 (2010), 380–385.
73. Wang, S., Guignard, M., Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems. Comput. Oper. Res. 33:4 (2006), 971–993.
74. Wu, D., Ierapetritou, M.G., Decomposition approaches for the efficient solution of short-term scheduling problems. Comput. Chem. Eng. 27:8-9 (2003), 1261–1276.
75. Yee, K.L., Shah, N., Improving the efficiency of discrete time scheduling formulation. Comput. Chem. Eng. 22:0 (1998), S403–S410 Suppl. 1.
76. Zhang, X., Sargent, R.W.H., The optimal operation of mixed production facilities—a general formulation and some approaches for the solution. Comput. Chem. Eng. 20:6-7 (1996), 897–904.