Evaluation on Sports Scheduling Model
DOI:
https://doi.org/10.54691/bcpbm.v44i.4886Keywords:
programming; sports schedules; tennis.Abstract
Sports competitions have gradually attracted people's attention. Various sports tournaments and round-robin are held throughout the world. During these competitions, programming tools play a vital role. Due to the popularity of sports areas, a large number of research about scheduling related to sports have done and many researchers have devoted themselves to this yield. However, there are still many problems to be solved, and many models still have room for improvement. This paper is based on one previous essay which study umpire scheduling, summarized and sorted out the content of this paper, and also proposed the advantages and disadvantages of this article, therefore exploring the direction of improvement of these scheduling models. The study found the mathematical model used is objective and logical, also simple to use but at the cost of neglecting the random and dynamic in reality. At the same time, the lack of analysis combined with first-hand data makes the model less convincing.
Downloads
References
Benoist, T., Laburthe, F., & Rottembourg, B. (2001, April). Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems. In Proceedings CPAIOR (Vol. 1, pp. 15 - 26).
Blest, D. C., & Fitzgerald, D. G. (1988). Scheduling sports competitions with a given distribution of times. Discrete Applied Mathematics, 22 (1), 9 - 19.
Farmer, A., Smith, J. S., & Miller, L. T. (2007). Scheduling umpire crews for professional tennis tournaments. Interfaces, 37 (2), 187 - 196.
Payne, J. W., Payne, J. W., Bettman, J. R., & Johnson, E. J. (1993). The adaptive decision maker. Cambridge university press.
Elf, M., Jünger, M., & Rinaldi, G. (2003). Minimizing breaks by maximizing cuts. Operations Research Letters, 31 (5), 343 - 349.
Briskorn, D. (2008). Feasibility of home–away-pattern sets for round robin tournaments. Operations Research Letters, 36 (3), 283 - 284.
Miyashiro, R., Iwasaki, H., & Matsui, T. (2003). Characterizing feasible pattern sets with a minimum number of breaks. In Practice and Theory of Automated Timetabling IV: 4th International Conference, PATAT 2002, Gent, Belgium, August 21-23, 2002. Selected Revised Papers 4 (pp. 78-99). Springer Berlin Heidelberg.
Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics, 4 (2), 100 - 107.
Goossens, D. R., & Spieksma, F. C. (2012). Soccer schedules in Europe: an overview. Journal of scheduling, 15, 641 - 651.
Miyashiro, R., & Matsui, T. (2005). A polynomial-time algorithm to find an equitable home–away assignment. Operations Research Letters, 33 (3), 235 - 241.
Kendall, G., Knust, S., Ribeiro, C. C., & Urrutia, S. (2010). Scheduling in sports: An annotated bibliography. Computers & Operations Research, 37 (1), 1 - 19.
Miyashiro, R., & Matsui, T. (2006). Minimizing the carry-over effects value in a round-robin tournament. In Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling (pp. 460-463). PATAT.
Downloads
Published
Issue
Section
How to Cite
