Simultaneous Batching and Scheduling Using Dynamic Decomposition on a Grid

References

• Bussieck M., Ferris M. C., Meeraus A. Grid-enabled optimization with GAMS. INFORMS J. Comput. (2009) 21(3):349–362Link, Google Scholar
• Castro P. M., Grossmann I. E. New continuous-time MILP model for the short-term scheduling of multistage batch plants. Indust. Engrg. Chem. Res. (2005) 44:9175–9190Crossref, Google Scholar
• Castro P. M., Grossmann I. E., Novais A. Q. Two new continuous-time models for the scheduling of multistage batch plants with sequence dependent changeovers. Indust. Engrg. Chem. Res. (2006) 45(18):6210–6226Crossref, Google Scholar
• Danna E., Rothberg E., Le Pape C. Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Programming (2005) 102(1):71–90Crossref, Google Scholar
• Epema D. H. J., Linvy M., van Dantzig R., Evers X., Pruyne J. A worldwide flock of Condors: Load sharing among workstation clusters. Future Generation Comput. Systems (1996) 12(1):53–65Crossref, Google Scholar
• Fischetti M., Lodi A. Local branching. Math. Programming (2003) 98(1–3):23–47Crossref, Google Scholar
• Gupta S., Karimi I. A. An improved MILP formulation for scheduling multiproduct, multistage batch plants. Indust. Engrg. Chem. Res. (2003) 42(11):2365–2380Crossref, Google Scholar
• Harjunkoski I., Grossmann I. E. Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput. Chem. Engrg. (2002) 26(11):1533–1552Crossref, Google Scholar
• Hui C. H., Gupta A. A novel MILP formulation for short-term scheduling of multistage multi-product batch plants. Comput. Chem. Engrg. (2000) 24(2–7):1611–1617Crossref, Google Scholar
• Kelly J. D. Chronological decomposition heuristic for scheduling: Divide and conquer method. AIChE J. (2002) 48(2):2995–2999Crossref, Google Scholar
• Kelly J. D. Smooth-and-dive accelerator: A pre-MILP primal heuristic applied to scheduling. Comput. Chem. Engrg. (2003) 27(6):827–832Crossref, Google Scholar
• Kelly J. D., Zyngier D. Hierarchical decomposition heuristic for scheduling: Coordinated reasoning for decentralized and distributed decision-making problems. Comput. Chem. Engrg. (2008) 32(11):2684–2705Crossref, Google Scholar
• Lamba N., Karimi I. A. Scheduling parallel production lines with resource constraints. 1. Model formulation. Indust. Engrg. Chem. Res. (2002) 41(4):779–789Crossref, Google Scholar
• Litzkow M. J., Livny M., Mutka M. W. Condor: A hunter of idle workstations. Proc. 8th Internat. Conf. Distributed Comput. Systems, (ICDS) (1988) San Jose, CA(IEEE Press, Los Alamitos, CA) 104–111Crossref, Google Scholar
• Maravelias C. T., Grossmann I. E. A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants. Comput. Chem. Engrg. (2004) 28(10):1921–1949Crossref, Google Scholar
• Maravelias C. T. A decomposition framework for the scheduling of single- and multi-stage processes. Comput. Chem. Engrg. (2006) 30(3):407–420Crossref, Google Scholar
• Méndez C. A., Henning G. P., Cerdá J. An MILP continuous-time approach to short-term scheduling of resource-constrained multistage flowshop batch facilities. Comput. Chem. Engrg. (2001) 25(4–6):701–711Crossref, Google Scholar
• Méndez C. A., Cerdá 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. Engrg. (2006) 30(6–7):913–946Crossref, Google Scholar
• Neumann K., Schwindt C., Trautmann N. Advanced production scheduling for batch plants in process industries. OR Spectrum (2002) 24(3):251–279Crossref, Google Scholar
• Pekny J. F., Reklaitis G. V., Pekny J. F., Blau G. E. Towards the convergence of theory and practice: A technology guide for scheduling/planning methodology. Proc. Third Internat. Conf. Foundations of Computer-Aided Process Oper. AIChE Sympos. Ser., No. 320 (1998) 94(American Institute of Chemical Engineers, New York) 91–111Google Scholar
• Pinedo M.Scheduling: Theory, Algorithms, and Systems (2002) (Prentice Hall, New York) Google Scholar
• Pinto J. M., Grossmann I. E. A continuous time mixed integer linear programming model for short term scheduling of multi-stage batch plants. Indust. Engrg. Chem. Res. (1995) 34(9):3037–3051Crossref, Google Scholar
• Pinto J. M., Grossmann I. E. Assignment and sequencing models for the scheduling of process systems. Ann. Oper. Res. (1998) 81:433–466Crossref, Google Scholar
• Prasad P., Maravelias C. T. Batch selection, assignment and sequencing in multi-stage multi-product processes. Comput. Chem. Engrg. (2008) 32(6):1106–1119Crossref, Google Scholar
• Roe B., Papageorgiou L. G., Shah N. A hybrid MILP/CLP algorithm for multipurpose batch process scheduling. Comput. Chem. Engrg. (2005) 29(6):1277–1291Crossref, Google Scholar
• Shah N., Pekny J. F., Blau G. E. Single- and multi-site planning and scheduling: Current status and future challenges. Proc. Third Internat. Conf. Foundations of Computer-Aided Process Oper. AIChE Sympos. Ser., No. 320 (1998) 94(American Institute of Chemical Engineers, New York) 75–90Google Scholar
• Sundaramoorthy A., Maravelias C. T. Modeling of storage in batching and scheduling of multistage processes. Indust. Engrg. Chem. Res. (2008a) 47(17):6648–6660Crossref, Google Scholar
• Sundaramoorthy A., Maravelias C. T. Simultaneous batching and scheduling in multistage multiproduct processes. Indust. Engrg. Chem. Res. (2008b) 47(5):1546–1555Crossref, Google Scholar