Valid Inequalities Based on Demand Propagation for Chemical Production Scheduling MIP Models

AIChE Journal

Volumn 59, Issue 3, 2013, Pages 872-887

  Velez, Sara ^a   Sundaramoorthy, Arul ^a   Maravelias, Christos T ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Chemical production scheduling; Mathematical programming

Indexed keywords

CHEMICAL MANUFACTURING; CHEMICAL PRODUCTION SCHEDULING; COMPUTATIONAL PERFORMANCE; COMPUTATIONAL REQUIREMENTS; CONSTRAINT PROPAGATION ALGORITHMS; LIMITED ATTENTIONS; LOWER BOUNDS; MIP MODELS; MIXED-INTEGER PROGRAMMING; NUMBER AND SIZE; ON DEMANDS; SCHEDULING MODELS; SOLUTION METHODS; THREE ORDERS OF MAGNITUDE; VALID INEQUALITY;

INTEGER PROGRAMMING; MATHEMATICAL PROGRAMMING; PRODUCTION ENGINEERING; SCHEDULING;

PRODUCTION CONTROL;

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

References (50)

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. Egli UM, Rippin DWT. Short-term scheduling for multiproduct batch chemical plants. Comput Chem Eng. 1986;10(4):303-325.
4. Reklaitis GV. Review of Scheduling of Process Operation. AIChE Symp. Ser 1982;78(214):119-133.
5. Pinto JM, Grossmann IE. Assignment and sequencing models for the scheduling of process systems. Anna Oper Res. 1998;81:433-466.
6. Mendez CA, Cerda J. An MILP Continuous-time framework for short-term scheduling of multipurpose batch processes under different operation strategies. Optim Eng. 2003;4(1-2):7-22.
7. Mendez CA, Henning GP, Cerda J. An MILP continuous-time approach to short-term scheduling of resource-constrained multistage flowshop batch facilities. Comput Chem Eng. 2001;25(4-6):701-711.
8. Prasad P, Maravelias CT. Batch selection, assignment and sequencing in multi-stage multi-product processes. Comput Chem Eng. 2008;32(6):1106-1119.
9. Sundaramoorthy A, Maravelias CT. Simultaneous batching and scheduling in multistage multiproduct processes. Ind Eng Chem Res. 2008;47(5):1546-1555.
10. Sundaramoorthy A, Maravelias CT. Modeling of storage in batching and scheduling of multistage processes. Ind Eng Chem Res. 2008;47(17):6648-6660.
11. Sundaramoorthy A, Maravelias CT, Prasad P. Scheduling of multistage batch processes under utility constraints. Ind Eng Chem Res. 2009;48(13):6050-6058.
12. 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.
13. Shah N, Pantelides CC, Sargent RWH. A general algorithm for short-term scheduling of batch-operations .2. Computational issues. Comput Chem Eng. Feb 1993;17(2):229-244.
14. Pantelides CC. Unified frameworks for optimal process planning and scheduling. In: Second Conference on Foundations of Computer Aided Process Operations, 1994, Snowmass, CO, CACHE Publications.
15. Zhang X, Sargent RWH. The optimal operation of mixed production facilities-A general formulation and some approaches for the solution. Comput Chem Eng. 1996;20(6-7):897-904.
16. Schilling G, Pantelides CC. A simple continuous-time process scheduling formulation and a novel solution algorithm. Comput Chem Eng. 1996;20:S1221-S1226.
17. 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.
18. Mockus L, Reklaitis GV. Continuous time representation approach to batch and continuous process scheduling. 1. MINLP formulation. Ind Eng Chem Res. 1999;38(1):197-203.
19. 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.
20. 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.
21. 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.
22. Maravelias CT. Mixed-time representation for state-task network models. Ind Eng Chem Res. Nov 2005;44(24):9129-9145.
23. Giannelos NF, Georgiadis MC. A simple new continuous-time formulation for short-term scheduling of multipurpose batch processes. Ind Eng Chem Res. 2002;41(9):2178-2184.
24. 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.
25. 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.
26. Maravelias CT, Papalamprou K. Polyhedral results for discrete-time production planning MIP formulations for continuous processes. Comput Chem Eng. 2009;33(11):1890-1904.
27. Maravelias CT. On the combinatorial structure of discrete-time MIP formulations for chemical production scheduling. Comput Chem Eng. 2012;38:204-212.
28. 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.
29. 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.
30. 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.
31. Kelly JD, Zyngier D. Hierarchical decomposition heuristic for scheduling: coordinated reasoning for decentralized and distributed decision-making problems. Comput Chem Eng. 2008;32(11):2684-2705.
32. Ferris M, Maravelias CT, Sundaramoorthy A. Simultaneous batching and scheduling using dynamic decomposition on a grid. INFORMS J Comput. 2009;21(3):398-410.
33. 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.
34. Sundaramoorthy A, Maravelias CT. A general framework for process scheduling. AICHE J. 2011;57(3):695-710.
35. Kelly JD, Mann JL. Crude oil blend scheduling optimization: an application with multimillion dollar benefits-Part 2-The ability to schedule the crude oil blendshop more effectively provides substantial downstream benefits. Hydrocarbon Process. 2003;82(7):72-79.
36. Kelly JD, Zyngier D. Multi-product inventory logistics modeling in the process industries In: Chaovalitwongse W, Furman KC, Pardalos PM, editors. Optimization and Logistics Challenges in the Enterprise, New York: Springer, 2009;61-95.
37. Wassick JM. Enterprise-wide optimization in an integrated chemical complex. Comput Chem Eng. 2009;33(12):1950-1963.
38. Pochet Y, Wolsey LA. Production Planning by Mixed Integer Programming. New York, Berlin: Springer, 2006.
39. Wolsey LA. Valid inequalities for 0-1 Knapsacks and Mips with generalized upper bound constraints. Discrete Appl Math. 1990;29(2-3):251-261.
40. van den Akker JM, van Hoesel CPM, Savelsbergh MWP. A polyhedral approach to single-machine scheduling problems. Math Program. 1999;85(3):541-572.
41. van den Akker JM, Hurkens CAJ, Savelsbergh MWP. Time-indexed formulations for machine scheduling problems: Column generation. INFORMS J Comput. 2000;12(2):111-124.
42. Hooker J. Logic-Based Methods for Optimization : Combining Optimization and Constraint Satisfaction. New York: John Wiley & Sons, 2000.
43. Baptiste P, Le Pape C, Nuijten W. Constraint-Based Scheduling : Applying Constraint Programming to Scheduling Problems. Boston: Kluwer Academic, 2001.
44. Van Hentenryck P, Michel L. Constraint-Based Local Search. Cambridge, Mass: MIT Press, 2005.
45. Hooker JN. Planning and scheduling by logic-based benders decomposition. Oper Res. 2007;55(3):588-602.
46. Pochet Y, Wolsey LA. Lot-sizing with constant batches-formulation and valid inequalities. Math Oper Res. 1993;18(4):767-785.
47. Wolsey LA. MIP modelling of changeovers in production planning and scheduling problems. Eur Jf Oper Res. 1997;99(1):154-165.
48. Miller AJ, Wolsey LA. Tight formulations for some simple mixed integer programs and convex objective integer programs. Math Program. 2003;98(1-3):73-88.
49. Nemhauser GL, Wolsey LA. Integer and Combinatorial Optimization. New York: Wiley, 1988.
50. Wolsey LA. Integer Programming. New York: Wiley, 1998.