Skip to main content
SpringerLink
Log in

A constraint-based approach for examination timetabling using local repair techniques

  • Conference paper
  • First Online:
Practice and Theory of Automated Timetabling II (PATAT 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1408))

Abstract

We present in this paper an algorithm based upon the Constraint Satisfaction Problem model, used at the “école des Mines de Nantes” to generate examination timetables. A strong constraint is that the computing time must be less than 1 minute. This led us to develop an incomplete algorithm, using local repair techniques, instead of an exhaustive search method. The program has been validated on fifty “hand-made” problems, and has succesfully solved the thirteen “real” problems.

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. Michael W. Carter. A survey of practical applications of examination timetabling algorithms. Operations Research, 34(2):193–202, 1986.

    Article  MathSciNet  Google Scholar 

  2. Michael W. Carter and Gilbert Laporte. Recent Developments in Practical Examination Timetabling. In Edmund Burke and Peter Ross, editors, Practice and Theory of Automated Timetabling, volume 1153 of Lectures Notes in Computer Science, pages 3–21. Springer-Verlag, 1996.

    Google Scholar 

  3. Alan K. Mackworth and Eugene C. Freuder. The complexity of constraint satisfaction revisited. Artificial Intelligence, 59:57–62, 1993.

    Article  Google Scholar 

  4. Steven Minton, Mark D. Johnston, Andrew B. Philips, and Philip Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1–3):161–205, December 1992.

    Article  MATH  MathSciNet  Google Scholar 

  5. Bart Selman, Hector Levesque, and David Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-92), pages 440–446, San Jose, CA, 1992.

    Google Scholar 

  6. Edward Tsang. Foundations of constraint satisfaction. Academic Press, 1993.

    Google Scholar 

  7. M. Yoshikawa and K. Kaneko and T. Yamanouchi and M. Watanabe. A Constraint-Based High School Scheduling System. IEEE Expert, 11(1):63–72, February 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. école des Mines de Nantes, 4 rue Alfred Kastler, La Chantrerie, BP 20722, 44307, Nantes Cedex 3, France

    Philippe David

Authors
  1. Philippe David
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edmund Burke Michael Carter

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

David, P. (1998). A constraint-based approach for examination timetabling using local repair techniques. In: Burke, E., Carter, M. (eds) Practice and Theory of Automated Timetabling II. PATAT 1997. Lecture Notes in Computer Science, vol 1408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055888

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64979-3

  • Online ISBN: 978-3-540-49803-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation