Skip to main content
SpringerLink
Log in
Book cover

International Conference on the Practice and Theory of Automated Timetabling

PATAT 2000: Practice and Theory of Automated Timetabling III pp 309–321Cite as

Modelling Timetabling Problems with STTL

  • Conference paper
  • First Online:

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

Abstract

STTL is a language for specifying and evaluating timetabling problems, instances and solutions. An interpreter for STTL is freely available on the Internet. After a brief overview of the language, this paper explores the issues involved in the application of STTL to real-world problems, in particular the modelling of timetabling resources, time and meetings, and the evaluation of solutions. High school timetabling is used as a case study.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Appleby, J. S., Blake, D. V., Newman, E. A.: Techniques for Producing School Timetables on a Computer and Their Application to Other Scheduling Problems. Compo J. 3 (1960) 237–245

    Article  MathSciNet  Google Scholar 

  2. Cooper, T. B., Kingston, J. H.: The Solution of Real Instances of the Timetabling Problem. Comp.J.36 (1993)645–653

    Article  Google Scholar 

  3. Burke, E. K., Kingston, J. H., Pepper, P. W.: A Standard Data Format for Timetabling Instances. In: Practice and Theory of Automated Timetabling II. Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1997)

    Google Scholar 

  4. Kingston, J. H.: The STTL Interpreter, Version 1.0 (1999). URL

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Basser Department of Computer Science, The University of Sydney 2006, Australia

    Jeffrey H. Kingston

Authors
  1. Jeffrey H. Kingston
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Information Technology Automated Scheduling, Optimisation and Planning Research Group, University of Nottingham, Jubilee Campus,Wollaton Road, NG8 1BB, Nottingham, UK

    Edmund Burke

  2. Department of Computer Science, FH Konstanz, University of Applied Science, Brauneggerstr. 55, 78462, Konstanz, Germany

    Wilhelm Erben

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Verlag Berlin Heidelberg

About this paper

Cite this paper

Kingston, J.H. (2001). Modelling Timetabling Problems with STTL. In: Burke, E., Erben, W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44629-X_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-44629-X_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42421-5

  • Online ISBN: 978-3-540-44629-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation