Planning and Scheduling by Logic-Based Benders Decomposition

References

• Benders J. F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik (1962) 4:238–252Crossref, Google Scholar
• Cambazard H., Hladik P.-E., Déplanche A.-M., Jussien N., Trinquet Y., Wallace M. Decomposition and learning for a hard real time task allocation problem. Principles and Practice of Constraint Programming (CP 2004) (2004) 3258(Springer)153–167Crossref, Google Scholar
• Chu Y., Xia Q., Régin J. C., Rueher M. Generating Benders cuts for a class of integer programming problems. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004) (2004) 3011(Springer)127–141Crossref, Google Scholar
• Chu Y., Xia Q., Barták R., Milano M. A hybrid algorithm for a class of resource-constrained scheduling problems. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005) (2005) 3524(Springer)110–124Crossref, Google Scholar
• Corréa A. I., Langevin A., Rousseau L. M., Régin J. C., Rueher M. Dispatching and conflict-free routing of automated guided vehicles: A hybrid approach combining constraint programming and mixed integer programming. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004) (2004) 3011(Springer)370–378Crossref, Google Scholar
• Eremin A., Wallace M., Walsh T. Hybrid Benders decomposition algorithms in constraint logic programming. Principles and Practice of Constraint Programming (CP 2001) (2001) 2239(Springer)Crossref, Google Scholar
• Geoffrion A. M. Generalized Benders decomposition. J. Optim. Theory Appl. (1972) 10:237–260Crossref, Google Scholar
• Harjunkoski I., Grossmann I. E. A decomposition approach for the scheduling of a steel plant production. Comput. Chemical Engrg. (2001) 25:1647–1660Crossref, Google Scholar
• Harjunkoski I., Grossmann I. E. Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput. Chemical Engrg. (2002) 26:1533–1552Crossref, Google Scholar
• Hooker J. N.Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction (2000) (John Wiley and Sons, New York) Crossref, Google Scholar
• Hooker J. N., Wallace M. A hybrid method for planning and scheduling. Principles and Practice of Constraint Programming (CP 2004) (2004) 3258(Springer)305–316Crossref, Google Scholar
• Hooker J. N., van Beek P. Planning and scheduling to minimize tardiness. Principles and Practice of Constraint Programming (CP 2005). Lecture Notes in Computer Science (2005) 3709:314–327Crossref, Google Scholar
• Hooker J. N., Ottosson G. Logic-based Benders decomposition. Math. Programming (2003) 96:33–60Crossref, Google Scholar
• Hooker J. N., Yan Hong, Saraswat V., Van Hentenryck P. Logic circuit verification by Benders decomposition. Principles and Practice of Constraint Programming: The Newport Papers (1995) (MIT Press, Cambridge, MA) 267–288Google Scholar
• Jain V., Grossmann I. E. Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput. (2001) 13:258–276Link, Google Scholar
• Maravelias C. T., Grossmann I. E., Régin J. C., Rueher M. Using MILP and CP for the scheduling of batch chemical processes. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004) (2004) 3011(Springer)1–20Crossref, Google Scholar
• Thorsteinsson E. S., Walsh T. Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming. Principles and Practice of Constraint Programming (CP 2001). Lecture Notes in Computer Science (2001) 2239(Springer)16–30Crossref, Google Scholar
• Timpe C. Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum (2002) 24:431–448Crossref, Google Scholar
• Türkay M., Grossmann I. E. Logic-based MINLP algorithms for the optimal synthesis of process networks. Comput. Chemical Engrg. (1996) 20:959–978Crossref, Google Scholar
• Xia Q., Eremin A., Wallace M., Régin J. C., Rueher M. Problem decomposition for traffic diversions. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004). Lecture Notes in Computer Science (2004) 3011(Springer)348–363Crossref, Google Scholar