Computational study of network-based mixed-integer programming approaches for chemical production scheduling

Industrial and Engineering Chemistry Research

Volumn 50, Issue 9, 2011, Pages 5023-5040

  Sundaramoorthy, Arul ^a   Maravelias, Christos T ^a  

^a Wisconsin Electric Machines and Power Electronics Consortium   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BATCH PROCESS; CHEMICAL PRODUCTION; COMPUTATIONAL COMPARISONS; COMPUTATIONAL PERFORMANCE; COMPUTATIONAL REQUIREMENTS; COMPUTATIONAL STUDIES; CONTINUOUS TIME MODELS; CONTINUOUS-TIME REPRESENTATION; DIFFERENT PROCESS; DISCRETE-TIME; DISCRETE-TIME MODEL; FURTHER DEVELOPMENT; MAIN CHARACTERISTICS; MIXED-INTEGER PROGRAMMING; MODELING APPROACH; MODELING ASPECTS; MODELING CAPABILITIES; NETWORK-BASED; OBJECTIVE FUNCTIONS; PROBLEM INSTANCES; SOLUTION METHODS; VARIABLE PROCESSING TIME;

BATCH DATA PROCESSING; CONTINUOUS TIME SYSTEMS; INTEGER PROGRAMMING; PRODUCTION ENGINEERING; SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 79955536361     PISSN: 08885885     EISSN: 15205045     Source Type: Journal    
DOI: 10.1021/ie101419z     Document Type: Article

References (34)

1. Reklaitis, G. V. Overview of scheduling and planning of batch operations. In Batch Processing Systems Engineering, Proceedings of the NATO Advanced Study Institute on Batch Process Systems Engineering, Antalya, Turkey, May 29-June 7, 1992; Springer-Verlag: Berlin, Germany, 1996.
2. Bassett, M. H.; Pekny, J. F.; Reklaitis, G. V. Decomposition techniques for the solution of large-scale scheduling problems AIChE J. 1996, 42, 3373-3387 (Pubitemid 126452043)
3. Kallrath, J. Planning and scheduling in the process industry OR Spectrum 2002, 24, 219-250
4. Méndez, 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. 2006, 30, 913-946 (Pubitemid 44304455)
5. Maravelias, C. T.; Sung, C. Integration of production planning and scheduling: Overview, challenges, and opportunities Comput. Chem. Eng. 2009, 33, 1919-1930
6. Sundaramoorthy, A.; Maravelias, C. T. A general framework for process scheduling. AIChE J. 2011, 57, in press (DOI:10.1002/aic.12300).
7. Ahuja, R. K.; Magnanti, T. L.; Orlin, J. B. Network Flows: Theory, Algorithms, and Applications; Prentice Hall: Upper Saddle River, NJ, 1993.
8. Kelly, J. D.; Mann, J. L. 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, 72-79
9. Kondili, E.; Pantelides, C. C.; Sargent, R. W. H. A General Algorithm for Short-Term Scheduling of Batch Operations - I. MILP Formulation Comput. Chem. Eng. 1993, 17, 211-227 (Pubitemid 23633373)
10. Shah, N.; Pantelides, C. C.; Sargent, R. W. H. A General Algorithm for Short-Term Scheduling of Batch Operations - II. Computaional Issues Comput. Chem. Eng. 1993, 17, 229-244 (Pubitemid 23633372)
11. Bassett, M. H.; Pekny, J. F.; Reklaitis, G. V. Using detailed scheduling to obtain realistic operating policies for a batch processing facility Ind. Eng. Chem. Res. 1997, 36, 1717-1726 (Pubitemid 127495822)
12. Maravelias, C. T.; Grossmann, I. E. A hybrid MILP/CP decomposition approach for the short term scheduling of multipurpose batch plants Comput. Chem. Eng. 2004, 28, 1921-1949 (Pubitemid 39090397)
13. 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. 1996, 20, 897-904 (Pubitemid 126666076)
14. Mockus, L.; Reklaitis, G. V. Continuous-time representation approach to batch and continuous process scheduling. 1. MINLP formulation Ind. Eng. Chem. Res. 1999, 38, 197-203 (Pubitemid 29133092)
15. Castro, P.; Barbosa-Povoa, A. P. F. D.; Matos, H. An improved RTN continuous-time formulation for the short-term scheduling of multipurpose batch processes Ind. Eng. Chem. Res. 2001, 40, 2059-2068 (Pubitemid 33015333)
16. Schilling, G.; Pantelides, C. C. A simple continuous-time process scheduling formulation and a novel solution algorithm Comput. Chem. Eng. 1996, 20, S1221-1226
17. Maravelias, C. T.; Grossmann, I. E. New Continuous-Time State Task Network Formulation for the Scheduling of Multipurpose Batch Plants Ind. Eng. Chem. Res. 2003, 42, 3056-3074 (Pubitemid 36736684)
18. Sundaramoorthy, A.; Karimi, I. A. A simpler better slot-based continuous-time formulation for short-term scheduling in multipurpose batch plants Chem. Eng. Sci. 2005, 60, 2679-2702 (Pubitemid 40393743)
19. Ierapetritou, M. G.; Floudas, C. A. Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes Ind. Eng. Chem. Res. 1998, 37, 4341-4359 (Pubitemid 29144956)
20. Giannelos, N. F.; Georgiadis, M. C. A simple new continuous-time formulation for short-term scheduling of multipurpose batch processes Ind. Eng. Chem. Res. 2002, 41, 2178-2184 (Pubitemid 34438788)
21. Janak, S. L.; Lin, 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. 2004, 43, 2516-2533 (Pubitemid 38619750)
22. Susarla, N.; Li, J.; Karimi, I. A. A novel approach to scheduling multipurpose batch plants using unit-slots AIChE J. 2010, 56, 1859-1879
23. Maravelias, C. T. Mixed-time representation for state-task network models Ind. Eng. Chem. Res. 2005, 44, 9129-9145 (Pubitemid 41801557)
24. Floudas, C. A.; Lin, X. Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review Comput. Chem. Eng. 2004, 28, 2109-2129 (Pubitemid 39094063)
25. Kelly, J. D.; Zyngier, D. An improved MILP modeling of sequence-dependent switchovers for discrete-time scheduling problems Ind. Eng. Chem. Res. 2007, 46, 4964-4973 (Pubitemid 47116489)
26. Kelly, J. D.; Zyngier, D. Hierarchical decomposition heuristic for scheduling: Coordinated reasoning for decentralized and distributed decision-making problems Comput. Chem. Eng. 2008, 32, 2684-2705
27. Wassick, J. M. Enterprise-wide optimization in an integrated chemical complex Comput. Chem. Eng. 2009, 33, 1950-1963
28. Ferrio, J.; Wassick, J. M. Extensions to the resource-task network. AIChE Annual Meeting, Salt Lake City, UT, November 7-12, 2010; paper no. 298a.
29. Sundaramoorthy, A.; Maravelias, C. T.; Prasad, P. Scheduling of multistage batch processes under utility constraints Ind. Eng. Chem. Res. 2009, 48, 6050-6058
30. Maravelias, C. T.; Papalamprou, K. Polyhedral results for discrete-time production planning mip formulations for continuous processes Comput. Chem. Eng. 2009, 33, 1890-1904
31. Castro, P. M.; Grossmann, I. E.; Novais, A. Q. Two new continuous-time models for the scheduling of multi-stage batch plants with sequence dependent changeovers Ind. Eng. Chem. Res. 2006, 45, 6210-6226 (Pubitemid 44412608)
32. Papageorgiou, L. G.; Pantelides, C. C. Optimal campaign planning/scheduling of multipurpose batch/semicontinuous plants. 2. A mathematical decomposition approach Ind. Eng. Chem. Res. 1996, 35, 510-529 (Pubitemid 126468684)
33. Maravelias, C. T.; Grossmann, I. E. On the Relation of Continuous and Discrete Time Models for the State-Task Network Formulation AIChE J. 2006, 52 (2) 843-849
34. Miller, D. L.; Schertz, D.; Stevens, C.; Pekny, J. F. Mathematical programming for the design and analysis of a biologics facility BioPharm Int. 2010, 23, 40-52