Abstract
This paper describes a case study for constructing the yearly schedule of a secondary school in the Netherlands. This construction is divided in three steps. In the first step we create cluster schemes containing the optional subjects. A cluster scheme consists of cluster lines, and a cluster line contains classes which will be taught simultaneously. Part of the problem is that the students are not yet assigned to the classes. Once the cluster schemes are fixed, it remains to schedule the lessons to time slots and rooms. We first schedule the lessons to day-parts, and once this is completed we schedule the lessons to time slots within the day-parts. Thanks to consistency checks in the day-part phase, going from day-parts to time slots is possible. Finally, in the third step, we improve the previously found schedule by a tabu search using ejection chains. Compared to hand-made schedules, the results are very promising.
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
Abramson, D.: Constructing school timetables using simulated annealing: sequential and parallel algorithms. Management Science 37, 98–113 (1991)
Ahuja, R.K., Ergu, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete and Applied Mathematics 123, 75–102 (2002)
Alvarez-Valdes, R., Martin, G., Tamarit, J.M.: Constructing good solutions for the Spanish school timetabling problem. Journal of Operational Research Society 47, 1203–1215 (1996)
Bufé, M., Fischer, T., Gubbels, H., Häcker, C., Hasprich, O., Scheibel, C., Karsten Weicker, K., Weicker, N., Wenig, M., Wolfangel, C.: 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. (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.K., Petrovic, S.: Recent research directions in automated timetabling. European Journal of Operational Research 140, 266–280 (2002)
Birbis, T., Daskalali, S., Housos, E.: Timetabling for Greek high schools. Journal of the Operational Research Society 48, 1191–1200 (1997)
Carter, M.W., Laporte, G.: Recent developments in practical course timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 3–19. Springer, Heidelberg (1998)
Colorni, A., Dorigo, M., Maniezzo, V.: Metaheuristics for high school timetabling. Computational Optimization and Applications 9, 275–298 (1998)
Cooper, T.B., Kingston, J.: The solution of real instances of the timetabling problem. The Computer Journal 36, 645–653 (1993)
Costa, D.: A tabu search algorithm for computing an operational timetable. European Journal of Operational Research 76, 98–110 (1994)
Drexl, A., Salewski, F.: Distribution requirements and compactness constraints in school timetabling. European Journal of Operational Research 102, 193–214 (1997)
de Gans, O.B.: A computer timetabling system for secondary schools in the Netherlands. European Journal of Operational Research 7, 175–182 (1981)
Glover, F.W., Laguna, M.: Tabu Search. Kluwer, Norwell, MA (1997)
Kingston, J.H.: A tiling algorithm for high school timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 208–225. Springer, Heidelberg (2005)
Post, G.F.H., Ruizenaar, W.A.: Clusterschemes in Dutch secondary schools. Memorandum 1707, University of Twente (2004), http://www.math.utwente.nl/publications/2004/1707abs.html
Ribeiro Filho, G., Lorena, L.A.N.: A constructive approach to school timetabling. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 130–139. Springer, Heidelberg (2001)
Santos, H.G., Ochi, L.S., Souza, M.J.F.: An efficient tabu search heuristic for the school timetabling problem. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 468–481. Springer, Heidelberg (2004)
Schaerf, A.: A survey of automated timetabling. CWI Report CS-R9567, CWI, The Netherlands (1995)
Schaerf, A.: Local search techniques for large high school timetabling problems. IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans 29, 368–377 (1999)
Simons, J.L.: ABC: Een programma dat automatisch blokken construeert bij de vakdifferentiatie binnen het algemeen voortgezet onderwijs. Technical Report NLR TR 74107 U, NLR, The Netherlands (1974)
Smith, K.A., Abramson, D., Duke, D.: Hopfield neural networks for timetabling: formulations, methods and comparative results. Computers and Industrial Engineering 44, 283–305 (2003)
Valouxis, C., Housos, E.: Constraint programming approach for school timetabling. Computers and Operations Research 30, 1555–1572 (2003)
de Werra, D.: An introduction to timetabling. European Journal of Operational Research 19, 151–162 (1985)
de Werra, D.: On a multiconstrained model for chromatic scheduling. Discrete Applied Mathematics 94, 171–180 (1999)
Wilke, P., Gröbner, M., Oster, N.: A hybrid algorithm for school timetabling. In: McKay, B., Slaney, J.K. (eds.) AI 2002: Advances in Artificial Intelligence. LNCS (LNAI), vol. 2557, pp. 455–464. Springer, Heidelberg (2002)
Willemen, R.J.: School timetable construction; algorithms and complexity, Ph.D. Thesis, Technical University Eindhoven, The Netherlands (2002)
Wood, J., Whitaker, D.: Student centred school timetabling. Journal of Operational Research Society 49, 1146–1152 (1998)
Wright, M.: School timetabling using heuristic search. Journal of Operational Research Society 47, 347–357 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Haan, P., Landman, R., Post, G., Ruizenaar, H. (2007). A Case Study for Timetabling in a Dutch Secondary School. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-77345-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77344-3
Online ISBN: 978-3-540-77345-0
eBook Packages: Computer ScienceComputer Science (R0)