Skip to main content

Referee Assignment in Sports Leagues

  • Conference paper
Practice and Theory of Automated Timetabling VI (PATAT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3867))

Abstract

Optimization in sports is a field of increasing interest. Combinatorial optimization techniques have been applied, for example, to game scheduling and playoff elimination. A common problem usually found in sports management is the assignment of referees to games already scheduled. There are a number of rules and objectives that should be taken into account when referees are assigned to games. We address a simplified version of a referee assignment problem common to many amateur leagues of sports such as soccer, baseball, and basketball. The problem is formulated by integer programming and its decision version is proved to be NP-complete. To tackle real-life large instances of the referee assignment problem, we propose a three-phase heuristic approach based on a constructive procedure, a repair heuristic to make solutions feasible, and a local search heuristic to improve feasible solutions. Numerical results on realistic instances are presented and discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anagnostopoulos, A., Michel, L., Van Hentenryck, P., Vergados, Y.: A simulated annealing approach to the traveling tournament problem. Journal of Scheduling 9, 177–193 (2006)

    Article  MATH  Google Scholar 

  2. Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems – Part I. Theoretical Computer Science 148, 93–109 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  3. Corneil, D.G., Olariu, S., Stewart, L.: The ultimate interval graph recognition algorithm? In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 175–180. SIAM, Philadelphia (1998)

    Google Scholar 

  4. Dinitz, J.H., Stinson, D.R.: On assigning referees to tournament schedules. Bulletin of the Institute of Combinatorics and its Applications 44, 22–28 (2005)

    MATH  MathSciNet  Google Scholar 

  5. Duarte, A.R.: Challenge referee assignment problem instances (last visited on March 23, 2007), Online document at http://www.esportemax.org/rapopt

  6. Easton, K., Nemhauser, G.L., Trick, M.: The traveling tournament problem: Description and benchmarks. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 580–584. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Easton, K., Nemhauser, G.L., Trick, M.: Sports scheduling. In: Leung, J.T. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, pp. 52.1–52.19. CRC Press, Boca Raton, FL (2004)

    Google Scholar 

  8. Evans, J.R.: A microcomputer-based decision support system for scheduling umpires in the American baseball league. Interfaces 18, 42–51 (1988)

    Google Scholar 

  9. Evans, J.R., Hebert, J.E., Deckro, R.F.: Play ball – The scheduling of sports officials. Perspectives in Computing 4, 18–29 (1984)

    Google Scholar 

  10. Fisher, M.L., Jaikumar, R., Van Wassenhove, L.N.: A multiplier adjustment method for the generalized assignment problem. Management Science 32, 1095–1103 (1986)

    MATH  Google Scholar 

  11. Lourenço, H.P., Martin, O., Stützle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321–353. Kluwer, Dordrecht (2003)

    Google Scholar 

  12. Martin, O., Otto, S.W.: Combining simulated annealing with local search heuristics. Annals of Operations Research 63, 57–75 (1996)

    Article  MATH  Google Scholar 

  13. Martin, O., Otto, S.W., Felten, E.W.: Large-step Markov chains for the traveling salesman problem. Complex Systems 5, 299–326 (1991)

    MATH  MathSciNet  Google Scholar 

  14. Nemhauser, G.L., Trick, M.A.: Scheduling a major college basketball conference. Operations Research 46, 1–8 (1997)

    Article  Google Scholar 

  15. Rasmussen, R.V., Trick, M.A.: Round robin scheduling – A survey. Technical Report, Department of Operations Research, University of Aarhus (2006)

    Google Scholar 

  16. Ribeiro, C.C., Urrutia, S.: OR on the ball: Applications in sports scheduling and management. OR/MS Today 31, 50–54 (2004)

    Google Scholar 

  17. Ribeiro, C.C., Urrutia, S.: An application of integer programming to playoff elimination in football championships. International Transactions in Operational Research 12, 375–386 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  18. Ribeiro, C.C., Urrutia, S.: Heuristics for the mirrored traveling tournament problem. European Journal of Operational Research 179, 775–787 (2007)

    Article  MATH  Google Scholar 

  19. Wright, M.B.: Scheduling English cricket umpires. Journal of the Operational Research Society 42, 447–452 (1991)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Edmund K. Burke Hana Rudová

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duarte, A.R., Ribeiro, C.C., Urrutia, S., Haeusler, E.H. (2007). Referee Assignment in Sports Leagues. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77345-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77344-3

  • Online ISBN: 978-3-540-77345-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics