Advertisement

Characterizing Feasible Pattern Sets with a Minimum Number of Breaks

  • Ryuhei Miyashiro
  • Hideya Iwasaki
  • Tomomi Matsui
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2740)

Abstract

In sports timetabling, creating an appropriate timetable for a round-robin tournament with home–away assignment is a significant problem. To solve this problem, we need to construct home–away assignment that can be completed into a timetable; such assignment is called a feasible pattern set. Although finding feasible pattern sets is at the heart of many timetabling algorithms, good characterization of feasible pattern sets is not known yet. In this paper, we consider the feasibility of pattern sets, and propose a new necessary condition for feasible pattern sets. In the case of a pattern set with a minimum number of breaks, we prove a theorem leading a polynomial-time algorithm to check whether a given pattern set satisfies the necessary condition. Computational experiment shows that, when the number of teams is less than or equal to 26, the proposed condition characterizes feasible pattern sets with a minimum number of breaks.

Keywords

Computational Experiment Integer Programming Problem Black Vertex Partial Assignment Complement Pair 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Armstrong, J.R., Willis, R.J.: Scheduling the Cricket World Cup – a Case Study. J. Oper. Res. Soc. 44, 1067–1072 (1993)zbMATHGoogle Scholar
  2. 2.
    Blest, D.C., Fitzgerald, D.G.: Scheduling Sports Competitions with a Given Distribution of Times. Discr. Appl. Math. 22, 9–19 (1989)CrossRefMathSciNetGoogle Scholar
  3. 3.
    de Werra, D.: Geography, Games and Graphs. Discr. Appl. Math. 2, 327–337 (1980)zbMATHCrossRefGoogle Scholar
  4. 4.
    de Werra, D.: Minimizing Irregularities in Sports Schedules Using Graph Theory. Discr. Appl. Math. 4, 217–226 (1982)zbMATHCrossRefGoogle Scholar
  5. 5.
    de Werra, D.: On the Multiplication of Divisions: the Use of Graphs for Sports Scheduling. Networks 15, 125–136 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    de Werra, D.: Some Models of Graphs for Scheduling Sports Competitions. Discr. Appl. Math. 21, 47–65 (1988)zbMATHCrossRefGoogle Scholar
  7. 7.
    Ferland, J.A., Fleurent, C.: Computer Aided Scheduling for a Sport League. INFOR 29, 14–25 (1991)Google Scholar
  8. 8.
    Henz, M.: Scheduling a Major College Basketball Conference—Revisited. Oper. Res. 49, 163–168 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    ILOG: ILOG CPLEX 7.0 User’s Manual. ILOG, Gentilly (2000)Google Scholar
  10. 10.
    Miyashiro, R., Matsui, T.: Note on Equitable Round-Robin Tournaments. In: Proc. 6th KOREA–JAPAN Joint Workshop on Algorithms and Computation, pp. 135–140 (2001)Google Scholar
  11. 11.
    Miyashiro, R., Matsui, T.: Notes on Equitable Round-Robin Tournaments. IEICE Trans. Fund. Electron. Commun. Comput. Sci. E85-A, 1006–1010 (2002)Google Scholar
  12. 12.
    Nemhauser, G.L., Trick, M.A.: Scheduling a Major College Basketball Conference. Oper. Res. 46, 1–8 (1998)CrossRefGoogle Scholar
  13. 13.
    Russell, K.G.: Balancing Carry-Over Effects in Round Robin Tournaments. Biometrika 67, 127–131 (1980)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Russell, R.A., Leung, J.M.Y.: Devising a Cost Effective Schedule for a Baseball League. Oper. Res. 42, 614–625 (1994)zbMATHCrossRefGoogle Scholar
  15. 15.
    Schreuder, J.A.M.: Combinatorial Aspects of Construction of Competition Dutch Professional Football Leagues. Discr. Appl. Math. 35, 301–312 (1992)zbMATHCrossRefGoogle Scholar
  16. 16.
    Trick, M.A.: A Scheduling-Then-Break Approach to Sports Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 242–253. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  17. 17.
    van Weert, A., Schreuder, J.A.M.: Construction of Basic Match Schedules for Sports Competitions by Using Graph Theory. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 201–210. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  18. 18.
    Willis, R.J., Terrill, B.J.: Scheduling the Australian State Cricket Season Using Simulated Annealing. J. Oper. Res. Soc. 45, 276–280 (1994)zbMATHGoogle Scholar
  19. 19.
    Wright, M.: Timetabling County Cricket Fixtures Using a Form of Tabu Search. J. Oper. Res. Soc. 45, 758–770 (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Ryuhei Miyashiro
    • 1
  • Hideya Iwasaki
    • 2
  • Tomomi Matsui
    • 1
  1. 1.Department of Mathematical Informatics, Graduate School of Information Science and TechnologyThe University of TokyoTokyoJapan
  2. 2.Department of Computer ScienceThe University of Electro-CommunicationsTokyoJapan

Personalised recommendations