Skip to main content Accessibility help
×
×
Home

Logic-based Benders decomposition for planning and scheduling: a computational analysis

  • Andre A. Ciré (a1), Elvin Çoban (a2) and John N. Hooker (a3)

Abstract

Logic-based Benders decomposition (LBBD) has improved the state of the art for solving a variety of planning and scheduling problems, in part by combining the complementary strengths of constraint programming and mixed integer programming (MIP). We undertake a computational analysis of specific factors that contribute to the success of LBBD, to provide guidance for future implementations. We study a problem class that assign tasks to multiple resources and poses a cumulative scheduling problem on each resource. We find that LBBD is at least 1000 times faster than state-of-the-art MIP on larger instances, despite recent advances in the latter. Further, we conclude that LBBD is most effective when the planning and scheduling aspects of the problem are roughly balanced in difficulty. The most effective device for improving LBBD is the inclusion of a subproblem relaxation in the master problem. The strengthening of Benders cuts also plays an important role when the master and subproblem complexity are properly balanced. These findings suggest future research directions.

Copyright

References

Hide All
Baptiste, P., Le Pape, C. & Nuijten, W. 2001. Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer.
Benders, J. F. 1962. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4, 238252.
Benini, L., Bertozzi, D., Guerri, A. & Milano, M. 2005. Allocation and scheduling for MPSoCs via decomposition and no-good generation. In Principles and Practice of Constraint Programming (CP 2005), 107–121. Springer.
Cambazard, H., Hladik, P.-E., Déplanche, A.-M., Jussien, N. & Trinquet, Y. 2004. Decomposition and learning for a hard real time task allocation problem. In Principles and Practice of Constraint Programming (CP 2004), Wallace, M. (eds). Springer, 153167.
Chu, Y. & Xia, Q. 2004. Generating Benders cuts for a class of integer programming problems. In CPAIOR 2004 Proceedings, Regin, J. C. & Rueher, M. (eds). Springer, 127141.
Ciré, A., Coban, E. & Hooker, J. N. 2013. Mixed integer programming vs logic-based Benders decomposition for planning and scheduling. In CPAIOR 2013 Proceedings, Gomes, C. & Sellmann, M. (eds). Springer, 325331.
Ciré, A. & Hooker, J. N. 2012. A heuristic logic-based Benders method for the home health care problem. In Presented at Matheuristics 2012.
Çoban, E. & Hooker, J. N. 2013. Single-facility scheduling by logic-based Benders decomposition. Annals of Operations Research 210, 245272.
Corréa, A. I., Langevin, A. & Rousseau, L. M. 2004. Dispatching and conflict-free routing of automated guided vehicles: a hybrid approach combining constraint programming and mixed integer programming. In CPAIOR 2004 Proceedings, Regin, J. C. & Rueher, M. (eds). Springer, 370378.
Fazel-Zarandi, M. M. & Beck, J. C. 2009. Solving a location-allocation problem with logic-based Benders decomposition. In Principles and Practice of Constraint Programming (CP 2009), Gent, I. P. (ed.). Springer, 344351.
Geoffrion, A. M. 1972. Generalized Benders decomposition. Journal of Optimization Theory and Applications 10, 237260.
Harjunkoski, I. & Grossmann, I. E. 2001. A decomposition approach for the scheduling of a steel plant production. Computers and Chemical Engineering 25, 16471660.
Harjunkoski, I. & Grossmann, I. E. 2002. Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Computers and Chemical Engineering 26, 15331552.
Heching, A. & Hooker, J. N. 2016. Scheduling home hospice care with logic-based Benders decomposition. In CPAIOR 2016 Proceedings, Gendron, B. (ed.). Springer, 187197.
Hooker, J. N. 1995. Logic-based Benders decomposition. In INFORMS National Meeting (INFORMS 1995).
Hooker, J. N. 1996. Inference duality as a basis for sensitivity analysis. In Principles and Practice of Constraint Programming (CP 1996), Freuder, E. C. (ed.). Springer, 224236.
Hooker, J. N. 2000. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley.
Hooker, J. N. 2004. A hybrid method for planning and scheduling. In Principles and Practice of Constraint Programming (CP 2004), Wallace, M. (ed.). Springer, 305316.
Hooker, J. N. 2005a. Planning and scheduling to minimize tardiness. In Principles and Practice of Constraint Programming (CP 2005), 314–327. Springer.
Hooker, J. N. 2005b. A hybrid method for planning and scheduling. Constraints 10, 385401.
Hooker, J. N. 2006. An integrated method for planning and scheduling to minimize tardiness. Constraints 11, 139157.
Hooker, J. N. 2007. Planning and scheduling by logic-based Benders decomposition. Operations Research 55, 588602.
Hooker, J. N. 2012. Integrated Methods for Optimization, 2nd edition. Springer.
Hooker, J. N. & Ottosson, G. 2003. Logic-based Benders decomposition. Mathematical Programming 96, 3360.
Jain, V. & Grossmann, I. E. 2001. Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS Journal on Computing 13, 258276.
Maravelias, C. T. & Grossmann, I. E. 2004. Using MILP and CP for the scheduling of batch chemical processes. In CPAIOR 2004 Proceedings, Regin, J. C. & Rueher, M. (eds). Springer, 120.
Terekhov, D., Beck, J. C. & Brown, K. N. 2007. Solving a stochastic queueing design and control problem with constraint programming. In Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI2007), 1, 261–266. AAAI Press.
Thorsteinsson, E. 2001. Branch and check: a hybrid framework integrating mixed integer programming and constraint logic programming. In Principles and Practice of Constraint Programming (CP2001), Walsh, T. (ed.). Springer, 1630.
Timpe, C. 2002. Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum 24, 431448.
Yunes, T. H., Aron, I. & Hooker, J. N. 2010. An integrated solver for optimization problems. Operations Research 58, 342356.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Knowledge Engineering Review
  • ISSN: 0269-8889
  • EISSN: 1469-8005
  • URL: /core/journals/knowledge-engineering-review
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed