Skip to main content
SpringerLink
Log in

Search Strategy for Constraint-Based Class–Teacher Timetabling

  • Conference paper
Book cover Practice and Theory of Automated Timetabling IV (PATAT 2002)

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

Abstract

The paper deals with a scheduling problem: the computation of class–teacher timetables. Two cases are taken into consideration: high school problems and university department problems. The timetable was constructed using constraint programming techniques. The timetabling needs to take into account a variety of complex constraints and use special-purpose search strategies. The concurrent constraint language Mozart/Oz was used, which provides high-level abstraction, and allows the expression of complex constraints and the creation of a complicated, custom-tailored distribution strategy. This strategy, consisting of six stages, was crucial for finding a feasible solution. The space-based search allows the incorporation of local search into constraint programming; this is very useful for timetable optimization. Technical details and results of the implementation are presented.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Boufflet, J.P., Negre, S.: Three Methods Used to Solve an Examination Timetable Problem. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 327–344. Springer, Heidelberg (1996)

    Google Scholar 

  2. Elmohamed, S., Coddington, P., Fox, G.: A Comparison of Annealing Techniques for Academic Course Scheduling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 92–112. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Guéret, C., Jussien, N., Boizumault, P., Prins, C.: Building University Modular Timetabling Using Constraint Logic Programming. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 130–145. Springer, Heidelberg (1996)

    Google Scholar 

  4. Henz, M., Würtz, J.: Using Oz for College Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 162–177. Springer, Heidelberg (1996)

    Google Scholar 

  5. Jussien, N., Lhomme, O.: Local Search with Constraint Propagation and Conflict- Based Heuristic. Artif. Intell. 139, 21–45 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kaneko, K., Yoshikawa, M., Nakakuki, Y.: Improving a Heuristic Repair Method for Large-Scale School Timetabling Problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 275–288. Springer, Heidelberg (1999)

    Google Scholar 

  7. Lajos, G.: Complete University Modular Timetabling Using Constraint Logic, Practice and Theory of Automated Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 146–161. Springer, Heidelberg (1996)

    Google Scholar 

  8. Mozart Consortium. The Mozart Programming System. Documentation and system, available at http://www.mozart-oz.org

  9. Rich, D.C.: A Smart Genetic Algorithm for University Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 181–197. Springer, Heidelberg (1996)

    Google Scholar 

  10. Régin, J.C.: Generalized Arc Consistency for Global Cardinality Constraints. In: Proc. AAAI 1996, Portland, OR, pp. 209–215 (1996)

    Google Scholar 

  11. Rudová H.: Constraint Satisfaction with Preferences, Ph.D. Thesis, Brno (2001)

    Google Scholar 

  12. Schulte C.: Comparing Trailing and Copying for Constraint Programming. In: Proc. 16th Int. Conf. Logic Program (1999)

    Google Scholar 

  13. Schulte, C.: Programming Constraint Inference Engines. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330. Springer, Heidelberg (1997)

    Google Scholar 

  14. Schulte C.: Programming Constraint Services. PhD Thesis, Saarbrócken (2000)

    Google Scholar 

  15. White, G.M., Zhang, J.: Generating Complete University Timetables by Combining Tabu Search and Constraint Logic. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 187–198. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  16. Würtz J.: Oz Scheduler: A Workbench for Scheduling Problems. In: Proc. 8th Int. Conf. on Tools with Artificial Intelligence, pp. 149–156 (1996)

    Google Scholar 

  17. Zervoudakis, K., Stamatopoulos, P.: A Generic Object-Oriented Constraint-Based Model for University Course Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 28–47. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Automatic Control, Silesian Technical University, Akademicka 16, 44-100, Gliwice, Poland

    Wojciech Legierski

Authors
  1. Wojciech Legierski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund Burke

  2. Information Technology, KaHo St-Lieven, Gebr. Desmetstraat 1, 9000, Gent, Belgium

    Patrick De Causmaecker

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Legierski, W. (2003). Search Strategy for Constraint-Based Class–Teacher Timetabling. In: Burke, E., De Causmaecker, P. (eds) Practice and Theory of Automated Timetabling IV. PATAT 2002. Lecture Notes in Computer Science, vol 2740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45157-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45157-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40699-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation