Skip to main content

A standard data format for timetabling instances

  • Conference paper
  • First Online:

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

Abstract

Many formats have been developed for representing timetable data instances. The variety of data formats currently in use makes the comparison of research results and exchange of data extremely difficult. As many researchers have observed, the need for a standard data format for timetabling instances is now becoming urgent, so as to allow the sharing of data and testing of algorithms on standard benchmarks. At present this is not possible in research on timetable construction. In this paper we state the general requirements of a standard data format and present a standard data format and language for use in the evaluation of timetable instances.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jeffrey H. Kingston, A Bibliography of Timetabling Papers, URL “flp://ftp.cs.su.oz.au/jeff/timetabling/”.

    Google Scholar 

  2. E.K. Burke and P. Ross (eds.), The Practice and Theory of Automated Timetabling: Selected papers from the First International Conference on The Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153, Springer 1996.

    Google Scholar 

  3. E.K. Burke and M.W. Carter (eds.), The Practice and Theory of Automated Timetabling II: Selected papers from the 2 nd International Conference on The Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1408, Springer 1998.

    Google Scholar 

  4. E.K. Burke, J.P. Newall, R.F. Weare, A Memetic Algorithm for University Exam Timetabling, in [2], pp. 241–250.

    Google Scholar 

  5. Bob Bixby and Gerd Reinelt, TSLIB — A Library of Travelling Salesman and Related Problem Instances, September 1992. URL “http://nhse.cs.rice.edu/softlib/catalog/tslib.html”.

    Google Scholar 

  6. Ben Potter, et. al., An Introduction to Formal Specification and Z, Prentice Hall, 1991

    Google Scholar 

  7. E.K. Burke, et. al., Examination Timetabling in British Universities — A Survey, in [2], pp. 76–90.

    Google Scholar 

  8. M.W. Carter and G. Laporte, Recent Developments in Practical Examination Timetabling, in [2], pp. 3–21.

    Google Scholar 

  9. V.A. Bardadym, Computer-Aided Lessons Timetables Construction. A Survey. USIM (Management Systems and Computers, 8, pp. 119–126, 1991.

    Google Scholar 

  10. M.W. Carter, A Survey of Practical Applications of Examination Timetabling Algorithms, in Operations Research, 34, pp. 193–202, 1986.

    Article  MathSciNet  Google Scholar 

  11. W. Junginger, Timetabling in Germany — a Survey, Interfaces, 16, pp. 66–74, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

Burke, E.K., Kingston, J.H., Pepper, P.A. (1998). A standard data format for timetabling instances. 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/BFb0055891

Download citation

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

  • 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