Tightening methods for continuous-time mixed-integer programming models for chemical production scheduling

AIChE Journal

Volumn 59, Issue 12, 2013, Pages 4461-4467

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

^a University of Wisconsin Madison   (United States)

Author keywords

Demand propagation; Mixed integer programming; Valid inequalities

Indexed keywords

CHEMICAL PRODUCTION SCHEDULING; COMPUTATIONAL TIME; CONTINUOUS TIME MODELS; DEMAND PROPAGATION; EFFECTIVE SOLUTION; MIXED-INTEGER PROGRAMMING; THREE ORDERS OF MAGNITUDE; VALID INEQUALITY;

INTEGER PROGRAMMING; PRODUCTION CONTROL;

PRODUCTION ENGINEERING;

EID: 84887622375     PISSN: 00011541     EISSN: 15475905     Source Type: Journal    
DOI: 10.1002/aic.14249     Document Type: Article

References (38)

1. Mendez CA, Cerda J, Grossmann IE, Harjunkoski I, Fahl M. State-of-the-art review of optimization methods for short-term scheduling of batch processes. Comput Chem Eng. 2006;30(6-7):913-946.
2. Maravelias CT. General framework and modeling approach classification for chemical production scheduling. AIChE J. 2012;58(6):1812-1828.
3. Kondili E, Pantelides CC, Sargent RWH. A general algorithm for short-term scheduling of batch-operations.1. Milp Formulation. Comput Chem Eng. 1993;17(2):211-227.
4. Shah N, Pantelides CC, Sargent RWH. A general algorithm for short-term scheduling of batch-operations.2. Computational issues. Comput Chem Eng. 1993;17(2):229-244.
5. Pantelides CC. Unified Frameworks for Optimal Process Planning and Scheduling. Paper presented at: 2nd Conference on Foundations of Computer Aided Process Operations; 1994, 1994; Snowmass, CO.
6. Schilling G, Pantelides CC. A simple continuous-time process scheduling formulation and a novel solution algorithm. Comput Chem Eng. 1996;20:S1221-S1226.
7. Ierapetritou MG, Floudas CA. Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes. Ind Eng Chem Res. 1998;37(11):4341-4359.
8. Mockus L, Reklaitis GV. Continuous time representation approach to batch and continuous process scheduling. 2. Computational issues. Ind Eng Chem Res. 1999;38(1):204-210.
9. Castro P, Barbosa-Povoa APFD, Matos H. An improved RTN continuous-time formulation for the short-term scheduling of multipurpose batch plants. Ind Eng Chem Res. 2001;40(9):2059-2068.
10. Giannelos NF, Georgiadis MC. A novel event-driven formulation for short-term scheduling of multipurpose continuous processes. Ind Eng Chem Res. 2002;41(10):2431-2439.
11. Maravelias CT, Grossmann IE. Minimization of the makespan with a discrete-time state-task network formulation. Ind Eng Chem Res. 2003;42(24):6252-6257.
12. Maravelias CT, Grossmann IE. New general continuous-time state-task network formulation for short-term scheduling of multipurpose batch plants. Ind Eng Chem Res. 2003;42(13):3056-3074.
13. Maravelias CT. Mixed-time representation for state-task network models. Ind Eng Chem Res. 2005;44(24):9129-9145.
14. Sundaramoorthy A, Karimi IA. A simpler better slot-based continuous-time formulation for short-term scheduling in multipurpose batch plants. Chem Eng Sci. 2005;60(10):2679-2702.
15. BarbosaPovoa APFD, Pantelides CC. Design of multipurpose plants using the resource-task network unified framework. Comput Chem Eng. 1997;21:S703-S708.
16. Gimenez DM, Henning GP, Maravelias CT. A novel network-based continuous-time representation for process scheduling: Part I. Main concepts and mathematical formulation. Comput Chem Eng. 2009;33(9):1511-1528.
17. Gimenez DM, Henning GP, Maravelias CT. A novel network-based continuous-time representation for process scheduling: Part II. General framework. Comput Chem Eng. 2009;33(10):1644-1660.
18. Kelly JD, Zyngier D. Multi-product inventory logistics modeling in the process industries In: Chaovalitwongse W, Furman KC, Pardalos PM, eds. Optimization and Logistics Challenges in the Enterprise. New York: Springer; 2009:61-95.
19. Sundaramoorthy A, Maravelias CT. A general framework for process scheduling. AIChE J. 2011;57(3):695-710.
20. Maravelias CT, Papalamprou K. Polyhedral results for discrete-time production planning MIP formulations for continuous processes. Comput Chem Eng. 2009;33(11):1890-1904.
21. Maravelias CT. On the combinatorial structure of discrete-time MIP formulations for chemical production scheduling. Comput Chem Eng. 2012;38:204-212.
22. Bassett MH, Pekny JF, Reklaitis GV. Decomposition techniques for the solution of large-scale scheduling problems. AIChE J. 1996;42(12):3373-3387.
23. Papageorgiou LG, Pantelides CC. Optimal campaign planning scheduling of multipurpose batch semicontinuous plants.2. A mathematical decomposition approach. Ind Eng Chem Res. 1996;35(2):510-529.
24. Harjunkoski I, Grossmann IE. Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput Chem Eng. 2002;26(11):1533-1552.
25. Wu D, Ierapetritou MG. Decomposition approaches for the efficient solution of short-term scheduling problems. Comput Chem Eng. 2003;27(8-9):1261-1276.
26. Maravelias CT. A decomposition framework for the scheduling of single- and multi-stage processes. Comput Chem Eng. 2006;30(3):407-420.
27. Castro PM, Harjunkoski I, Grossmann IE. Greedy algorithm for scheduling batch plants with sequence-dependent changeovers. AIChE J. 2011;57(2):373-387.
28. Ferris MC, Maravelias CT, Sundaramoorthy A. Simultaneous batching and scheduling using dynamic decomposition on a grid. INFORMS J Comput Sum 2009;21(3):398-410.
29. Velez S, Maravelias CT. A branch-and-bound algorithm for the solution of chemical production scheduling MIP models using parallel computing. Comput Chem Eng. 2013;55(0):28-39.
30. Sahinidis NV, Grossmann IE. Reformulation of multiperiod MILP models for planning and scheduling of chemical processes. Comput Chem Eng. 1991;15(4):255-272.
31. Janak SL, Floudas CA. Improving unit-specific event based continuous-time approaches for batch processes: Integrality gap and task splitting. Comput Chem Eng. 2008;32(4-5):913-955.
32. Velez S, Maravelias CT. Reformulations and branching methods for mixed-integer programming chemical production scheduling models. Ind Eng Chem Res. 2013;52(10):3832-3841.
33. Burkard RE, Hatzl J. Review, extensions and computational comparison of MILP formulations for scheduling of batch processes. Comput Chem Eng. 2005;29(8):1752-1769.
34. Pochet Y, Warichet F. A tighter continuous time formulation for the cyclic scheduling of a mixed plant. Comput Chem Eng. 2008;32(11):2723-2744.
35. Velez S, Maravelias CT. Mixed-integer programming model and tightening methods for scheduling in general chemical production environments. Ind Eng Chem Res. 2013;52(9):3407-3423.
36. Velez S, Sundaramoorthy A, Maravelias CT. Valid inequalities based on demand propagation for chemical production scheduling MIP models. AIChE J. 2013;59(3):872-887.
37. Sundaramoorthy A, Maravelias CT. Computational study of network-based mixed-integer programming approaches for chemical production scheduling. Ind Eng Chem Res. 2011;50(9):5023-5040.
38. Papageorgiou LG, Pantelides CC. Optimal campaign planning scheduling of multipurpose batch semicontinuous plants.1. Mathematical formulation. Ind Eng Chem Res. 1996;35(2):488-509.