Softball Scheduling as Easy as 1-2-3 (Strikes You're Out)

Mark Grabau ()
Additional contact information
Mark Grabau: IBM Corporation, Westerville, Ohio 43082

Interfaces, 2012, vol. 42, issue 3, 310-319

Abstract: Scheduling games for any professional sport is an extremely complex process. Scheduling recreational softball games for over 1,000 players is also a difficult process. A scheduler must adhere to nearly two dozen intertwined scheduling rules, while simultaneously ensuring that the players play their allotment of games. This paper reviews the scheduling of college basketball and professional baseball, football, and soccer. It then presents an integer programming approach to solve this problem. Finally, it identifies the obstacles encountered and the qualitative and quantitative benefits of the approach.

Keywords: sports; scheduling; optimization; integer programming (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/inte.1110.0559 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orinte:v:42:y:2012:i:3:p:310-319

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().