Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Highly Constrained College Basketball Scheduling

T. van Voorhis
The Journal of the Operational Research Society
Vol. 53, No. 6 (Jun., 2002), pp. 603-609
Stable URL: http://www.jstor.org/stable/823003
Page Count: 7
  • Subscribe ($19.50)
  • Cite this Item
Highly Constrained College Basketball Scheduling
Preview not available

Abstract

In intercollegiate athletics, conference basketball schedules must satisfy several criteria to be acceptably fair to each team. Scheduling is often further complicated by building conflicts and agreements regarding televised games. Although these requirements make it tedious to develop feasible schedules by hand; they can readily be modelled as constraints in an integer programming formulation. Software has been developed that finds multiple feasible solutions to this integer program, where each solution corresponds to an acceptable schedule. By generating multiple schedules in a short period of time, the software allows conference personnel to quickly evaluate different scheduling scenarios (eg different TV games) and consider several alternatives. Thus, the software makes an important contribution to finding the most attractive schedule possible.

Page Thumbnails

  • Thumbnail: Page 
[603]
    [603]
  • Thumbnail: Page 
604
    604
  • Thumbnail: Page 
605
    605
  • Thumbnail: Page 
606
    606
  • Thumbnail: Page 
607
    607
  • Thumbnail: Page 
608
    608
  • Thumbnail: Page 
609
    609