Scheduling Major League Baseball Umpires and the Traveling Umpire Problem
- 1 June 2012
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Interfaces
- Vol. 42 (3) , 232-244
Abstract
The scheduling needs of umpires and referees differ from the needs of sports teams. In some sports leagues, such as Major League Baseball in the United States, umpires travel throughout the league's territory; they do not have a “home base.” For such leagues, balancing the need to minimize umpire travel and the objective that an umpire should not handle the games of a particular team too frequently is important. We have used our approach, which is based on network optimization and simulated annealing, to successfully schedule Major League Baseball umpires. To develop this approach, we created the traveling umpire problem, which includes the major umpire scheduling issues and also provides a test bed for alternative techniques.Keywords
This publication has 10 references indexed in Scilit:
- Round robin scheduling – a surveyEuropean Journal of Operational Research, 2008
- Referee Assignment in Sports Leagues2007
- Scheduling Umpire Crews for Professional Tennis TournamentsInterfaces, 2007
- Integer and Constraint Programming Approaches for Round-Robin Tournament Scheduling2003
- The Traveling Tournament Problem Description and Benchmarks2001
- Applied Simulated Annealing1993
- Scheduling English Cricket UmpiresJournal of the Operational Research Society, 1991
- A Microcomputer-Based Decision Support System for Scheduling Umpires in the American Baseball LeagueInterfaces, 1988
- Optimization by Simulated AnnealingScience, 1983
- Complexity of vehicle routing and scheduling problemsNetworks, 1981