Skip to main content
SpringerLink
Log in

Constructing timetables for sport competitions

  • Chapter
  • First Online:
Combinatorial Optimization II

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 13))

Abstract

The purpose of this paper is to present an algorithm for constructing feasible solutions of sport competitions e.g. soccer. After the definition of what is meant by a competition, necessary and sufficient conditions for the existence of a competition is proved with the aid of edge-colouring of complete graphs. Feasible timetables can be found by constructing an oriented edge-colouring.

For a fair competition it is necessary to find for each club a Home-and-Away Pattern, such that each club plays as few as possible two or more Home-(or Away)-matches after each other. Based on graph-theoretical results found by de Werra, an algorithm is presented. This algorithm constructs timetables, where no club plays more than once two Home-(or Away)-matches after each other in a half-competition.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.J. Aust, “An improvement algorithm for school timetabling”, Computer Journal 19 (1979) 339–343.

    Article  Google Scholar 

  2. J.N.G. Brittain and F.J.N. Farley, “College timetable construction by computer”, Computer Journal 14 (1971) 361–365.

    Article  Google Scholar 

  3. M. Behzad, G. Chartrand and L. Lesniak-Foster, Graphs and digraphs (Prindle, Weber & Smidt International Series, Boston, IL) p. 168.

    Google Scholar 

  4. W.O. Cain Jr., “The computer-assisted heuristic approach used to schedule the major league baseball clubs”, in: S.P. Ladany and R.E. Machol, eds., Optimal strategies in sports (North-Holland, Amsterdam, 1977) pp. 32–41.

    Google Scholar 

  5. R.T. Campbell and D.S. Chen, “A minimum distance basketball scheduling problem”, in: R.E. Machol, S.P. Ladany and D.G. Morrison, eds., Management science in sports (North-Holland, New York, 1976) pp. 15–25.

    Google Scholar 

  6. S. Fiorini and R.J. Wilson, “Edge-Colourings of graphs”, Research Notes in Mathematics 16 (Pitman Publishing, London, 1977).

    MATH  Google Scholar 

  7. F. Harry, Graph theory (Addison-Wesley, Reading, MA, 1977).

    Google Scholar 

  8. D. De Werra, “Constructing of school timetables by flow methods”, Infor Journal 9 (1971) 12–22.

    Google Scholar 

  9. D. De Werra, “Scheduling in sports”, O.R. Working Paper 45, Départment de Mathématiques, Ecole Polytechnique Federale de Lausanne, Switzerland (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Twente University of Technology, Enschede, The Netherlands

    J. A. M. Schreuder

Authors
  1. J. A. M. Schreuder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. J. Rayward-Smith

Rights and permissions

Reprints and permissions

Copyright information

© 1980 The Mathematical Programming Society

About this chapter

Cite this chapter

Schreuder, J.A.M. (1980). Constructing timetables for sport competitions. In: Rayward-Smith, V.J. (eds) Combinatorial Optimization II. Mathematical Programming Studies, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120907

Download citation

  • DOI: https://doi.org/10.1007/BFb0120907

  • Received:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00803-0

  • Online ISBN: 978-3-642-00804-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation