IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v177y2007i1p198-213.html
   My bibliography  Save this article

A Benders approach for the constrained minimum break problem

Author

Listed:
  • Rasmussen, Rasmus V.
  • Trick, Michael A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Rasmussen, Rasmus V. & Trick, Michael A., 2007. "A Benders approach for the constrained minimum break problem," European Journal of Operational Research, Elsevier, vol. 177(1), pages 198-213, February.
  • Handle: RePEc:eee:ejores:v:177:y:2007:i:1:p:198-213
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00925-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    2. George L. Nemhauser & Michael A. Trick, 1998. "Scheduling A Major College Basketball Conference," Operations Research, INFORMS, vol. 46(1), pages 1-8, February.
    3. Henz, Martin & Muller, Tobias & Thiel, Sven, 2004. "Global constraints for round robin tournament scheduling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 92-101, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qin, Tianbao & Du, Yuquan & Sha, Mei, 2016. "Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 167-185.
    2. D Briskorn & A Drexl, 2009. "A branch-and-price algorithm for scheduling sport leagues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 84-93, January.
    3. Rasmus Rasmussen & Michael Trick, 2009. "The timetable constrained distance minimization problem," Annals of Operations Research, Springer, vol. 171(1), pages 45-59, October.
    4. Riise, Atle & Mannino, Carlo & Lamorgese, Leonardo, 2016. "Recursive logic-based Benders’ decomposition for multi-mode outpatient scheduling," European Journal of Operational Research, Elsevier, vol. 255(3), pages 719-728.
    5. Briskorn, Dirk & Drexl, Andreas, 2009. "A branching scheme for finding cost-minimal round robin tournaments," European Journal of Operational Research, Elsevier, vol. 197(1), pages 68-76, August.
    6. Alex Krumer & Reut Megidish & Aner Sela, 2020. "The optimal design of round-robin tournaments with three players," Journal of Scheduling, Springer, vol. 23(3), pages 379-396, June.
    7. D Briskorn, 2011. "A branching scheme for minimum cost tournaments with regard to real-world constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2133-2145, December.
    8. Elvin Coban & J. Hooker, 2013. "Single-facility scheduling by logic-based Benders decomposition," Annals of Operations Research, Springer, vol. 210(1), pages 245-272, November.
    9. Carlsson, Mats & Johansson, Mikael & Larson, Jeffrey, 2017. "Scheduling double round-robin tournaments with divisional play using constraint programming," European Journal of Operational Research, Elsevier, vol. 259(3), pages 1180-1190.
    10. Rasmussen, Rasmus V. & Trick, Michael A., 2008. "Round robin scheduling - a survey," European Journal of Operational Research, Elsevier, vol. 188(3), pages 617-636, August.
    11. David Van Bulck & Dries Goossens, 2022. "Optimizing rest times and differences in games played: an iterative two-phase approach," Journal of Scheduling, Springer, vol. 25(3), pages 261-271, June.
    12. Yun-Chia Liang & Yen-Yu Lin & Angela Hsiang-Ling Chen & Wei-Sheng Chen, 2021. "Variable Neighborhood Search for Major League Baseball Scheduling Problem," Sustainability, MDPI, vol. 13(7), pages 1-18, April.
    13. Briskorn, Dirk & Drexl, Andreas, 2007. "A branching scheme based on First-Break-Then-Schedule decomposition," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 623, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Hoshino, Richard & Kawarabayashi, Ken-ichi, 2011. "A multi-round generalization of the traveling tournament problem and its application to Japanese baseball," European Journal of Operational Research, Elsevier, vol. 215(2), pages 481-497, December.
    15. Rasmussen, Rasmus V., 2008. "Scheduling a triple round robin tournament for the best Danish soccer league," European Journal of Operational Research, Elsevier, vol. 185(2), pages 795-810, March.
    16. Ryuhei Miyashiro & Tomomi Matsui & Shinji Imahori, 2012. "An approximation algorithm for the traveling tournament problem," Annals of Operations Research, Springer, vol. 194(1), pages 317-324, April.
    17. M B Wright, 2009. "50 years of OR in sport," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 161-168, May.
    18. Van Bulck, David & Goossens, Dries, 2023. "A traditional Benders’ approach to sports timetabling," European Journal of Operational Research, Elsevier, vol. 307(2), pages 813-826.
    19. Michael A. Trick & Hakan Yildiz, 2011. "Benders' cuts guided large neighborhood search for the traveling umpire problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 771-781, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ribeiro, Celso C. & Urrutia, Sebastian, 2007. "Heuristics for the mirrored traveling tournament problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 775-787, June.
    2. Rasmussen, Rasmus V. & Trick, Michael A., 2008. "Round robin scheduling - a survey," European Journal of Operational Research, Elsevier, vol. 188(3), pages 617-636, August.
    3. Roberto Rossi & S. Armagan Tarim & Brahim Hnich & Steven Prestwich & Semra Karacaer, 2010. "Scheduling internal audit activities: a stochastic combinatorial optimization problem," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 325-346, April.
    4. Riise, Atle & Mannino, Carlo & Lamorgese, Leonardo, 2016. "Recursive logic-based Benders’ decomposition for multi-mode outpatient scheduling," European Journal of Operational Research, Elsevier, vol. 255(3), pages 719-728.
    5. Castro, Pedro M. & Oliveira, José F., 2011. "Scheduling inspired models for two-dimensional packing problems," European Journal of Operational Research, Elsevier, vol. 215(1), pages 45-56, November.
    6. van Doornmalen, Jasper & Hojny, Christopher & Lambers, Roel & Spieksma, Frits C.R., 2023. "Integer programming models for round robin tournaments," European Journal of Operational Research, Elsevier, vol. 310(1), pages 24-33.
    7. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    8. Li, Haitao & Womer, Keith, 2012. "Optimizing the supply chain configuration for make-to-order manufacturing," European Journal of Operational Research, Elsevier, vol. 221(1), pages 118-128.
    9. Henz, Martin & Muller, Tobias & Thiel, Sven, 2004. "Global constraints for round robin tournament scheduling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 92-101, February.
    10. Rasmussen, Rasmus V., 2008. "Scheduling a triple round robin tournament for the best Danish soccer league," European Journal of Operational Research, Elsevier, vol. 185(2), pages 795-810, March.
    11. Lim, A. & Rodrigues, B. & Zhang, X., 2006. "A simulated annealing and hill-climbing algorithm for the traveling tournament problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1459-1478, November.
    12. Fan Yang & Roel Leus, 2021. "Scheduling hybrid flow shops with time windows," Journal of Heuristics, Springer, vol. 27(1), pages 133-158, April.
    13. Dries R. Goossens & Frits C.R. Spieksma, 2012. "The Carryover Effect Does Not Influence Football Results," Journal of Sports Economics, , vol. 13(3), pages 288-305, June.
    14. G Kendall, 2008. "Scheduling English football fixtures over holiday periods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 743-755, June.
    15. Inkyung Sung & Taesik Lee, 2018. "Scenario-based approach for the ambulance location problem with stochastic call arrivals under a dispatching policy," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 153-170, June.
    16. Alex Krumer & Reut Megidish & Aner Sela, 2020. "The optimal design of round-robin tournaments with three players," Journal of Scheduling, Springer, vol. 23(3), pages 379-396, June.
    17. Maryam Daryalal & Hamed Pouya & Marc Antoine DeSantis, 2023. "Network Migration Problem: A Hybrid Logic-Based Benders Decomposition Approach," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 593-613, May.
    18. Giorgi Tadumadze & Simon Emde & Heiko Diefenbach, 2020. "Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 461-497, June.
    19. Rasmus Rasmussen & Michael Trick, 2009. "The timetable constrained distance minimization problem," Annals of Operations Research, Springer, vol. 171(1), pages 45-59, October.
    20. Lim, A. & Rodrigues, B. & Zhang, X., 2006. "Scheduling sports competitions at multiple venues--Revisited," European Journal of Operational Research, Elsevier, vol. 175(1), pages 171-186, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:177:y:2007:i:1:p:198-213. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.