Skip to main content

2016 | OriginalPaper | Buchkapitel

Robust Scheduling with Logic-Based Benders Decomposition

verfasst von : Elvin Coban, Aliza Heching, J. N. Hooker, Alan Scheller-Wolf

Erschienen in: Operations Research Proceedings 2014

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We study project scheduling at a large IT services delivery center in which there are unpredictable delays. We apply robust optimization to minimize tardiness while informing the customer of a reasonable worst-case completion time, based on empirically determined uncertainty sets. We introduce a new solution method based on logic-based Benders decomposition. We show that when the uncertainty set is polyhedral, the decomposition simplifies substantially, leading to a model of tractable size. Preliminary computational experience indicates that this approach is superior to a mixed integer programming model solved by state-of-the-art software.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press (2009) Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press (2009)
2.
Zurück zum Zitat Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464–501 (2011) Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464–501 (2011)
3.
Zurück zum Zitat Bertsimas, D., Pachamanova, D., Sim, M.: Robust linear optimization under general norms. Oper. Res. Lett. 32, 510–516 (2004)CrossRef Bertsimas, D., Pachamanova, D., Sim, M.: Robust linear optimization under general norms. Oper. Res. Lett. 32, 510–516 (2004)CrossRef
4.
Zurück zum Zitat Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004)CrossRef Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004)CrossRef
5.
Zurück zum Zitat Bertsimas, D., Thiele, A.: Robust and data-driven optimization: modern decision-making under uncertainty. Tutorials Oper. Res. 4, 122–195 (2006) Bertsimas, D., Thiele, A.: Robust and data-driven optimization: modern decision-making under uncertainty. Tutorials Oper. Res. 4, 122–195 (2006)
6.
Zurück zum Zitat Ciré, A.A., Çoban, E., Hooker, J.N.: Mixed integer programming versus logic-based Benders decomposition for planning and scheduling. In: Gomes, C., Sellmann, M., (eds.) CPAIOR 2013, Lecture Notes in Computer Science, vol. 7874, pp. 325–331, Springer (2013) Ciré, A.A., Çoban, E., Hooker, J.N.: Mixed integer programming versus logic-based Benders decomposition for planning and scheduling. In: Gomes, C., Sellmann, M., (eds.) CPAIOR 2013, Lecture Notes in Computer Science, vol. 7874, pp. 325–331, Springer (2013)
7.
Zurück zum Zitat Harjunkoski, I., Grossmann, I.E.: A decomposition approach for the scheduling of a steel plant production. Comput. Chem. Eng. 25, 1647–1660 (2001)CrossRef Harjunkoski, I., Grossmann, I.E.: A decomposition approach for the scheduling of a steel plant production. Comput. Chem. Eng. 25, 1647–1660 (2001)CrossRef
8.
Zurück zum Zitat Hooker, J.N.: Integrated Methods for Optimization, 2nd edn. Springer (2012) Hooker, J.N.: Integrated Methods for Optimization, 2nd edn. Springer (2012)
9.
Zurück zum Zitat Hooker, J.N.: Logic-based Benders decomposition. In INFORMS National Meeting (fall), New Orleans (1995) Hooker, J.N.: Logic-based Benders decomposition. In INFORMS National Meeting (fall), New Orleans (1995)
10.
Zurück zum Zitat Hooker, J.N.: An integrated method for planning and scheduling to minimize tardiness. Constraints 11, 139–157 (2006)CrossRef Hooker, J.N.: An integrated method for planning and scheduling to minimize tardiness. Constraints 11, 139–157 (2006)CrossRef
11.
Zurück zum Zitat Hooker, J.N.: Planning and scheduling by logic-based Benders decomposition. Oper. Res. 55, 588–602 (2007)CrossRef Hooker, J.N.: Planning and scheduling by logic-based Benders decomposition. Oper. Res. 55, 588–602 (2007)CrossRef
12.
Zurück zum Zitat Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Program. 96, 33–60 (2003) Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Program. 96, 33–60 (2003)
13.
Zurück zum Zitat Hooker, J.N., Yan, H.: Logic circuit verification by Benders decomposition. In: Saraswat, V., Van Hentenryck, P. (eds.) Principles and Practice of Constraint Programming: The Newport Papers, pp. 267–288. MIT Press, Cambridge, MA (1995) Hooker, J.N., Yan, H.: Logic circuit verification by Benders decomposition. In: Saraswat, V., Van Hentenryck, P. (eds.) Principles and Practice of Constraint Programming: The Newport Papers, pp. 267–288. MIT Press, Cambridge, MA (1995)
14.
Zurück zum Zitat Jain, V., Grossmann, I.E.: Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput. 13, 258–276 (2001)CrossRef Jain, V., Grossmann, I.E.: Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput. 13, 258–276 (2001)CrossRef
15.
Zurück zum Zitat Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5), 1154–1157 (1973)CrossRef Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5), 1154–1157 (1973)CrossRef
Metadaten
Titel
Robust Scheduling with Logic-Based Benders Decomposition
verfasst von
Elvin Coban
Aliza Heching
J. N. Hooker
Alan Scheller-Wolf
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-28697-6_15

Premium Partner