IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v35y2007i5p465-471.html
   My bibliography  Save this article

Sports league scheduling: Graph- and resource-based models

Author

Listed:
  • Drexl, Andreas
  • Knust, Sigrid

Abstract

Generating a sports league schedule is a challenging task due to the variety of different requirements which have to be addressed. This has led to a multitude of alternative approaches. Most of them rely on graph-theoretical concepts and the solution of the overall problem is based on the decomposition of the problem into certain subproblems. In this paper, we give a comprehensive survey of these more traditional approaches. Furthermore, we present a new resource-based model which shall serve as a starting point for the development of new solution algorithms.

Suggested Citation

  • Drexl, Andreas & Knust, Sigrid, 2007. "Sports league scheduling: Graph- and resource-based models," Omega, Elsevier, vol. 35(5), pages 465-471, October.
    • Handle: RePEc:eee:jomega:v:35:y:2007:i:5:p:465-471
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(05)00110-6
    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. Martin Henz, 2001. "Scheduling a Major College Basketball Conference---Revisited," Operations Research, INFORMS, vol. 49(1), pages 163-168, February.
    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. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    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. 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.
    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. 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.
    4. Knust, Sigrid, 2010. "Scheduling non-professional table-tennis leagues," European Journal of Operational Research, Elsevier, vol. 200(2), pages 358-367, January.
    5. Briskorn, Dirk & Horbach, Andrei, 2009. "A Lagrangian approach for minimum cost tournaments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 647, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. 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.
    7. Nicolau, Juan L., 2012. "The effect of winning the 2010 FIFA World Cup on the tourism market value: The Spanish case," Omega, Elsevier, vol. 40(5), pages 503-510.
    8. Yi, Xiajie & Goossens, Dries & Nobibon, Fabrice Talla, 2020. "Proactive and reactive strategies for football league timetabling," European Journal of Operational Research, Elsevier, vol. 282(2), pages 772-785.
    9. 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.
    10. Katarína Cechlárová & Ágnes Cseh & Zsuzsanna Jankó & Marián Kireš & Lukáš Miňo, 2023. "A quest for a fair schedule: The International Young Physicists’ Tournament," Journal of Scheduling, Springer, vol. 26(1), pages 3-18, February.
    11. 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.
    12. Schauz, Uwe, 2016. "The tournament scheduling problem with absences," European Journal of Operational Research, Elsevier, vol. 254(3), pages 746-754.
    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. Briskorn, Dirk & Drexl, Andreas, 2006. "Integer programming models for round robin tournaments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 613, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Roel Lambers & Dries Goossens & Frits C. R. Spieksma, 2023. "The flexibility of home away pattern sets," Journal of Scheduling, Springer, vol. 26(5), pages 413-423, October.
    16. 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.
    17. Turabieh, Hamza & Abdullah, Salwani, 2011. "An integrated hybrid approach to the examination timetabling problem," Omega, Elsevier, vol. 39(6), pages 598-607, 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. 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.
    2. 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.
    3. Schonberger, J. & Mattfeld, D. C. & Kopfer, H., 2004. "Memetic Algorithm timetabling for non-commercial sport leagues," European Journal of Operational Research, Elsevier, vol. 153(1), pages 102-116, February.
    4. 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.
    5. Asbach, Lasse & Dorndorf, Ulrich & Pesch, Erwin, 2009. "Analysis, modeling and solution of the concrete delivery problem," European Journal of Operational Research, Elsevier, vol. 193(3), pages 820-835, March.
    6. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    7. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    8. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    9. Ilkyeong Moon & Sanghyup Lee & Moonsoo Shin & Kwangyeol Ryu, 2016. "Evolutionary resource assignment for workload-based production scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 375-388, April.
    10. Dorndorf, Ulrich & Drexl, Andreas & Nikulin, Yury & Pesch, Erwin, 2005. "Flight gate scheduling: State-of-the-art and recent developments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 584, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre (Ed.), 2000. "Jahresbericht 1999," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 522, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Drexl, Andreas & Nikulin, Yury, 2006. "Fuzzy multicriteria flight gate assignment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 605, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Dmitri Viattchenin, 2015. "Reducing the number of paths in a minimized project-network with given bounds on the durations of activities," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 25(4), pages 71-87.
    14. Ferreira, Cristiane & Figueira, Gonçalo & Amorim, Pedro, 2021. "Scheduling Human-Robot Teams in collaborative working cells," International Journal of Production Economics, Elsevier, vol. 235(C).
    15. Artigues, Christian & Michelon, Philippe & Reusser, Stephane, 2003. "Insertion techniques for static and dynamic resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 149(2), pages 249-267, September.
    16. C-C Chang & R-S Chen, 2007. "Project advancement and its applications to multi-air-route quality budget allocation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(8), pages 1008-1020, August.
    17. Lova, Antonio & Tormos, Pilar & Cervantes, Mariamar & Barber, Federico, 2009. "An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes," International Journal of Production Economics, Elsevier, vol. 117(2), pages 302-316, February.
    18. Ulrich Dorndorf & Erwin Pesch & Toàn Phan-Huy, 2000. "A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints," Management Science, INFORMS, vol. 46(10), pages 1365-1384, October.
    19. Kemmoé Tchomté, Sylverin & Gourgand, Michel, 2009. "Particle swarm optimization: A study of particle displacement for solving continuous and combinatorial optimization problems," International Journal of Production Economics, Elsevier, vol. 121(1), pages 57-67, September.
    20. Bowen Guo & Wei Zhan, 2023. "Research on Integrated Scheduling of Multi-Mode Emergency Rescue for Flooding in Chemical Parks," Sustainability, MDPI, vol. 15(4), pages 1-18, February.

    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:jomega:v:35:y:2007:i:5:p:465-471. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.