IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v60y2009i1d10.1057_palgrave.jors.2602515.html
   My bibliography  Save this article

A branch-and-price algorithm for scheduling sport leagues

Author

Listed:
  • D Briskorn

    (Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel)

  • A Drexl

    (Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel)

Abstract

A single round robin tournament can be described as a league of a set T of n teams (n even) to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period resulting in a set P of n−1 periods. Matches are carried out at one of the stadiums of both opponents. A team playing twice at home or twice away in two consecutive periods is said to have a break in the latter of both periods. There is a vast field of requests arising in real-world problems. For example, the number of breaks is to be minimized due to fairness reasons. It is well known that at least n−2 breaks must occur. We focus on schedules having the minimum number of breaks. Costs corresponding to each possible match are given and the objective is to minimize the sum of cost of arranged matches. Then, sports league scheduling can be seen as a hard combinatorial optimization problem. We develop a branch-and-price approach in order to find optimal solutions.

Suggested Citation

  • 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.
    • Handle: RePEc:pal:jorsoc:v:60:y:2009:i:1:d:10.1057_palgrave.jors.2602515
    DOI: 10.1057/palgrave.jors.2602515
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602515
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602515?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Dirk Briskorn & Andreas Drexl, 2007. "Branching Based on Home-Away-Pattern Sets," Operations Research Proceedings, in: Karl-Heinz Waldmann & Ulrike M. Stocker (ed.), Operations Research Proceedings 2006, pages 523-528, Springer.
    2. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    3. Anuj Mehrotra & Michael A. Trick, 1996. "A Column Generation Approach for Graph Coloring," INFORMS Journal on Computing, INFORMS, vol. 8(4), pages 344-354, November.
    4. 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.
    5. William Cook & André Rohe, 1999. "Computing Minimum-Weight Perfect Matchings," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 138-148, May.
    6. Briskorn, Dirk & Drexl, Andreas, 2006. "Scheduling sports leagues using branch- and price," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 609, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Drexl, Andreas & Knust, Sigrid, 2007. "Sports league scheduling: Graph- and resource-based models," Omega, Elsevier, vol. 35(5), pages 465-471, October.
    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. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    2. 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.
    3. Young Dae Ko & Seung Hwan Jung & Sung Hee Kim & Sung Wook Lee, 2018. "Sustainable Sport Scheduling Approach Considering Team Equity for the Korean Professional Baseball League," Sustainability, MDPI, vol. 10(2), pages 1-11, February.

    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. 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.
    2. Briskorn, Dirk & Drexl, Andreas, 2006. "Scheduling sports leagues using branch- and price," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 609, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Timo Gschwind & Stefan Irnich, 2014. "Dual Inequalities for Stabilized Column Generation Revisited," Working Papers 1407, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 23 Jul 2014.
    4. Syam Menon & Rakesh Gupta, 2008. "Optimal Broadcast Scheduling in Packet Radio Networks via Branch and Price," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 391-399, August.
    5. Briskorn, Dirk, 2009. "A branching scheme for minimum cost tournaments with regard to real world constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 643, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    7. Stefano Gualandi & Federico Malucelli, 2013. "Constraint Programming-based Column Generation," Annals of Operations Research, Springer, vol. 204(1), pages 11-32, April.
    8. 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.
    9. Ali Amiri, 2022. "The application grouping problem in Software-as-a-Service (SaaS) networks," Information Technology and Management, Springer, vol. 23(2), pages 125-137, June.
    10. Horbach, Andrei & Bartsch, Thomas & Briskorn, Dirk, 2009. "Optimally scheduling real world sports leagues by reduction to SAT," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 646, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Daniel Villeneuve & Jacques Desrosiers & Marco Lübbecke & François Soumis, 2005. "On Compact Formulations for Integer Programs Solved by Column Generation," Annals of Operations Research, Springer, vol. 139(1), pages 375-388, October.
    12. Daniel Kowalczyk & Roel Leus, 2017. "An exact algorithm for parallel machine scheduling with conflicts," Journal of Scheduling, Springer, vol. 20(4), pages 355-372, August.
    13. 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.
    14. Timo Gschwind & Stefan Irnich, 2016. "Dual Inequalities for Stabilized Column Generation Revisited," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 175-194, February.
    15. 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.
    16. Amanda O. C. Ayres & Betania S. C. Campello & Washington A. Oliveira & Carla T. L. S. Ghidini, 2021. "A Bi-Integrated Model for coupling lot-sizing and cutting-stock problems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 1047-1076, December.
    17. Alex Gliesch & Marcus Ritt, 2022. "A new heuristic for finding verifiable k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 28(1), pages 61-91, February.
    18. Erjavec, J. & Gradisar, M. & Trkman, P., 2012. "Assessment of stock size to minimize cutting stock production costs," International Journal of Production Economics, Elsevier, vol. 135(1), pages 170-176.
    19. Sankaran, Jayaram K., 1995. "Column generation applied to linear programs in course registration," European Journal of Operational Research, Elsevier, vol. 87(2), pages 328-342, December.
    20. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.

    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:pal:jorsoc:v:60:y:2009:i:1:d:10.1057_palgrave.jors.2602515. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.