Abstract
When timetabling experts are faced with a new timetabling problem, they usually develop a very specialised and optimised solution for this new underlying problem.
One disadvantage of this strategy is that even slight changes of the problem description often cause a complete redesign of data structures and algorithms. Furthermore, other timetabling problems cannot be fit to the data structures provided.
To avoid this, we have developed a standardised framework which can describe arbitrary timetabling problems such as university timetabling, examination timetabling, school timetabling, sports timetabling or employee timetabling. Thus, a general timetabling language has been developed which enables the definition of resources, events and constraints.
Furthermore, we provide a way to apply standard problem solving methods such as branch-and-bound or genetic algorithms to timetabling problems defined by means of the general timetabling language. These algorithms can be improved by problem-specific user-defined hybrid operators.
In this paper we present a generalised view on timetabling problems from which we derive our timetabling framework. The framework implementation and its application possibilities are shown with some concrete examples. The paper concludes with some preliminary results and an outlook.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bufe, M., Fischer, T., Gubbels, H., Häcker, C., Haspirch, O., Scheibel, C., Weicker, K., Wenig, M.: Automated Solution of a Highly Constrained School Timetabling Problem – Preliminary Results. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H., et al. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 431–440. Springer, Heidelberg (2001)
Burke, E., Elliman, D., Weare, R.: Specialised Recombinative Operators for Timetabling Problems. In: Proc. AISB (AI and Simulated Behaviour) Workshop Evolut. Comput., pp. 75–85. Springer, Heidelberg (1995)
Burke, E.K., Kingston, J.H.: A Standard Data Format for Timetabling instances. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 213–222. Springer, Heidelberg (1998)
Caldeira, J.P., Rosa, A.C.: School Timetabling Using Genetic Search. In: Burke, E., Carter, M. (eds.) Practice and Theory of Automated Timetabling II (PATAT 1997, Toronto, Canada, August, selected papers). LNCS, vol. 1408, pp. 115–122. Springer, Heidelberg (1998)
Colorni, A., Dorigo, M., Maniezzo, V.: Genetic Algorithms and Highly Constrained Problems: The Time-Table Case. In: Proc. 1st Int. Workshop on Parallel Problem Solving from Nature, pp. 55–59. Springer, Heidelberg (1990)
Corne, D., Ross, P., Fang, H.-L.: Evolutionary Timetabling: Practice, Prospects and Work in Progress. In: Prosser, P. (ed.) Proc. UK Planning and Scheduling SIG Workshop. University of Strathclyde (1994)
Fernandes, C., Caldeira, J.P., Melicio, F., Rosa, A.: High School Weekly Timetabling by Evolutionary Algorithms. In: Proc. 14th Annual ACM Symp. on Applied Computing, San Antonio, TX (1999)
Gröbner, M., Wilke, P.: Optimizing Employee Schedules by a Hybrid Genetic Algorithm. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H., et al. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 463–472. Springer, Heidelberg (2001)
Gröbner, M.: GTL, A General Timetabling Language, Beta Version, and a Bibliography of Timetabling Publications (2002), Available at http://www2.cs.fau.de/Research/Activities/Soft-Computing/Timetabling
Gueret, C., Jussien, N., Boizumault, P., Prins, C.: Building University Timetables Using Constraint Logic Programming. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 393–408. Springer, Heidelberg (1996)
Kingston, J.H.: A User’s Guide to the STTL Timetabling Language, Version 1.0. Basser Department of Computer Science, The University of Sydney (1999)
Kingston, J.H.: Modelling Timetabling Problems with STTL. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 433–445. Springer, Heidelberg (2001)
Lever, J., Wallace, M., Richards, B.: Constraint Logic Programming for Scheduling and Planning. British Telecom Technol. J. 13(1) (January 1995)
Meisels, A., Lusternik, N.: Experiments on Networks of Employee Timetabling Problems. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 215–228. Springer, Heidelberg (1998)
Oster, N.: Stundenplanerstellung für Schulen mit Evolutionären Verfahren. Thesis, Universität Erlangen-Nürnberg (2001)
Ross, P., Corne, D., Terashima, H.: The Phase Transition Niche for Evolutionary Algorithms in Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 269–282. Springer, Heidelberg (1996)
Weare, R., Burke, E., Elliman, D.: A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems. In: Eshelman, L.J. (ed.) Proc. 6th Int. Conf. Genetic Algorithms, Pittsburg, PA, pp. 605–610. Morgan Kaufmann, San Francisco (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gröbner, M., Wilke, P., Büttcher, S. (2003). A Standard Framework for Timetabling Problems. 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-45157-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40699-0
Online ISBN: 978-3-540-45157-0
eBook Packages: Springer Book Archive