Skip to main content

Solving Sports Scheduling and Timetabling Problems with Constraint Programming

  • Chapter
Economics, Management and Optimization in Sports

Abstract

In the last fifteen years, many successful industrial applications have been implemented using constraint programming tools. Many of those applications include specific constraints, which are difficult to model using the existing modeling and optimization tools. Industrial applications that are particularly suitable for constraint programming include production planning, scheduling and resource allocation.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Aggoun, A. Beldiceanu, N. Extending CHIP in Order to Solve Complex Scheduling Problems, Journal of Mathematical and Computer Modelling, Vol. 17, No. 7, pages 57–73, Pergamon Press, 1993.

    Article  Google Scholar 

  2. Beldiceanu, N., Contejean, E., Introducing Global Constraints in CHIP, Journal of Mathematical and Computer Modelling, Vol. 20, No 12, pp 97–123, 1994.

    Article  Google Scholar 

  3. Beldiceanu, N. Global Constraints as graph properties on a structured network of elementary constraints of the same type, Constraint Programming 2000, Sin-gapore, pages 384–395, volume 1894 of Lecture Notes in Computer Science, Springer-Verlag, 2000.

    Google Scholar 

  4. Bockmayr, A. Pisaruk, N. Aggoun, A. Network flow problems in constraint programming, Constraint Programming 2001, Cyprus, 2001.

    Google Scholar 

  5. Bockmayr, A. Pisaruk, N. Detecting Infeasibility and Generating Cuts for MIP using CP, CP-AI-OR 2003, Montréal, Canada, Ma 8–10, 2003.

    Google Scholar 

  6. Cabon, B., de Givry, S. Verfaillie, G. Anytime Lower Bounds for Constraint Optimization Problems. CP’98, pp. 117–131, Pisa, Italy.

    Google Scholar 

  7. Chan, P. Heus, K. Weil, G. 1998. Nurse Scheduling with Global Constraints. In CHIP : GYMNASTE, PAPPACT 98, London.

    Google Scholar 

  8. Caseau, Y. Laburthe, F. 1994. Improved CLP Scheduling with Task Intervals, Proc 11th ICLP 1994, Italy, June 1994. MIT Press.

    Google Scholar 

  9. Hamiez, J.P. Hao, J.K. Solving the sports league scheduling problem with Tabu search. Lecture Notes in Artificial Intelligence 2148: 24–36, Springer 2001.

    Google Scholar 

  10. Heipcke, S. Applications of optimization with Xpress-MP. Published by Dash Optimization Ltd., http://www.dashoptimization.com, 2002.

    Google Scholar 

  11. Régin, J. C. Rueher, M. A. Global Constraint combining a sum constraint and difference constraint. In Principles and practice of Constraint Programming, CP’2000, Singapore, pages 384–395, Springer, LNCS 1894, 2000.

    Google Scholar 

  12. Rohan, Y. Configuration Tool In Telecom Industry. CHIP Users’ Club 99, COSYTEC SA, 1999.

    Google Scholar 

  13. Simonis, H. The CHIP System and its Applications. Compulog Americas First Summer School on (Constraint) Logic Programming, New Mexico State Uni-versity, Las Cruces, N.M. August 1–6, 1999.

    Google Scholar 

  14. Simonis, H. Aggoun, A. Beldiceanu, N. Bourreau, E. Global Constraint Visual-ization in P. Deransart. In J. Maluszynski, M. Hermenegildo, editors, Analysis and Visualisation Tools for Constraint Programming, volume 1870 of Lecture Notes in Computer Science, Springer-Verlag, 2000.

    Google Scholar 

  15. Smith, B., Brailsford, S. Hubbard, P. Williams, H. The progressive party prob-lem: Integer linear programming and constraint programming compared. Con-straints 1: 119–138, 1996.

    Google Scholar 

  16. Timpe, C. Solving Planning and Scheduling Problems with Combined Integer and Constraint Programming. OR Spectrum. 24. 2002 25.

    Article  Google Scholar 

  17. Van Hentenryck, P. Constraint Satisfaction in Logic Programming. The MIT Press, 1989.

    Google Scholar 

  18. Wolsey, L.A. MIP Modeling for Production Planning. CP-AI-OR 2001, Impe-rial College, London, April 8–12, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Aggoun, A., Vazacopoulos, A. (2004). Solving Sports Scheduling and Timetabling Problems with Constraint Programming. In: Butenko, S., Gil-Lafuente, J., Pardalos, P.M. (eds) Economics, Management and Optimization in Sports. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24734-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24734-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05849-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics