On the generalized mirrored scheme for double round robin tournaments in sports scheduling

Asia-Pacific Journal of Operational Research

Volumn 30, Issue 3, 2013, Pages

  Zeng, Lishun ^a   Mizuno, Shinji ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

breaks; Generalized mirrored scheme; round robin tournament; separation; sports scheduling

Indexed keywords

BREAKS; CONSTRUCTIVE METHODS; GENERALIZED MIRRORED SCHEME; ROUND ROBIN TOURNAMENTS; SPORTS SCHEDULING;

SCHEDULING; SPORTS;

SEPARATION;

EID: 84879609663     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595913400083     Document Type: Article

References (14)

1. Aggoun, A, D Chan, P Dufresne, E Falvey, H Grant, W Harvey, A Herold, G Macartney, M Meier, D Miller, S Mudambi, S Novello, B Perez, E van Rossum, J Schimpf, K Shen, PA Tsahageas and DH de Villeneuve (2011). ECLiPSe User Manual Release 6.0
2. Briskorn, D (2008). Feasibility of home-Away-pattern sets for round robin tournaments. Operations Research Letters, 36(3), 283-284
3. deWerra, D (1981). Scheduling in sports. In Studies on Graphs and Discrete Programming. P Hansen (Eds.), pp. 381-395. Amesterdam: Elsevier
4. de Werra, D (1988). Some models of graphs for scheduling sports competitions. Discrete Applied Mathematics, 21(1), 47-65
5. Easton, K, GL Nemhauser and M Trick (2001). The traveling tournament problem: Description and benchmarks. In Principles and Practice of Constraint Programming, T Walsh (Eds.), Lecture Notes in Computer Science, Vol. 2139, pp. 580-584. Berlin: Springer
6. Elf, M, M Jünger and G Rinaldi (2003). Minimizing breaks by maximizing cuts. Operations Research Letters, 31(5), 343-349
7. Kendall, G, S Knust, CC Ribeiro and S Urrutia (2010). Scheduling in sports: An annotated bibliography. Computers & Operations Research, 37(1), 1-19
8. Miyashiro, R, H Iwasaki and T Matsui (2003). Characterizing feasible pattern sets with a minimum number of breaks. In the Fourth International Conference on the Practice and Theory of Automated Timetabling, E Burke and P de Causmaecker (Eds.), Lecture Notes in Computer Science, Vol. 2740, pp. 78-99. Berlin: Springer
9. Miyashiro, R and T Matsui (2005). A polynomial-Time algorithm to find an equitable home-Away assignment. Operations Research Letters, 33(3), 235-241
10. Miyashiro, R and T Matsui (2006). Semidefinite programming based approaches to the break minimization problem. Computers & Operations Research, 33(7), 1975-1982
11. Nemhauser, GL and M Trick (1998). Scheduling a major college basketball conference. Operations Research, 46(1), 1-8
12. Rasmussen, RV and M Trick (2007). A benders approach for the constrained minimum break problem. European Journal of Operational Research, 177(1), 198-213
13. Rasmussen, RV andMTrick (2008). Round robin scheduling-A survey. European Journal of Operational Research, 188(3), 617-636
14. Zeng, L and S Mizuno (2012). On the separation in 2-period double round robin tournaments with minimum breaks. Computers & Operations Research, 39(7), 1692-1700