IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v25y2022i6d10.1007_s10951-022-00744-8.html
   My bibliography  Save this article

Integrated break and carryover effect minimization

Author

Listed:
  • Burak Çavdaroğlu

    (Kadir Has University)

  • Tankut Atan

    (Bahçeşehir University)

Abstract

A fair schedule helps in improving the competitiveness and attractiveness of sports tournaments and in turn contributes positively to the sports economy. Break minimization and carryover effects minimization are considered to be two important criteria of fairness in scheduling of compact round-robin tournaments, and most related research looks at these problems separately. Various studies have sought to minimize the carryover effects in tournaments so that the number of breaks per team does not exceed a specific level. This study, however, is the first effort to define an integrated problem that aims to minimize the carryover effects and the number of breaks simultaneously for round-robin tournaments. We first introduce the mathematical formulation for the problem, whose objective measures how well a schedule simultaneously performs with respect to the number of breaks and the carryover effects. We then develop a heuristic method for this computationally hard problem. Comparing our results with the previous literature and the current practices of some European leagues, we show that our method provides schedules with better objective function values.

Suggested Citation

  • Burak Çavdaroğlu & Tankut Atan, 2022. "Integrated break and carryover effect minimization," Journal of Scheduling, Springer, vol. 25(6), pages 705-719, December.
    • Handle: RePEc:spr:jsched:v:25:y:2022:i:6:d:10.1007_s10951-022-00744-8
    DOI: 10.1007/s10951-022-00744-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-022-00744-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-022-00744-8?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. Januario, Tiago & Urrutia, Sebastián & Ribeiro, Celso C. & de Werra, Dominique, 2016. "Edge coloring: A natural model for sports scheduling," European Journal of Operational Research, Elsevier, vol. 254(1), pages 1-8.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. Ferrarini, Luca & Gualandi, Stefano, 2022. "Total Coloring and Total Matching: Polyhedra and Facets," European Journal of Operational Research, Elsevier, vol. 303(1), pages 129-142.
    4. Túlio A. M. Toffolo & Jan Christiaens & Frits C. R. Spieksma & Greet Vanden Berghe, 2019. "The sport teams grouping problem," Annals of Operations Research, Springer, vol. 275(1), pages 223-243, April.

    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:spr:jsched:v:25:y:2022:i:6:d:10.1007_s10951-022-00744-8. 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.springer.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.