Abstract
We consider timetabling problems of secondary schools,in which the students can choose their own curricula. Besides finding a time slot and classroom assignment,every student must be assigned to a subject group for each subject in his curriculum. This problem is NP-hard for several independent reasons. In this paper we investigate the borderline between “easy” and “hard” subproblems. In particular, we show that the addition of blocks of size two,i.e. two lessons to be taught at consecutive time slots,or the addition of a constraint on the subject group size changes a subproblem from polynomially solvable to NP-hard.
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
Berghuis, J., van der Heiden, A.J., Bakker, R.: The Preparation of School Timetables by Electronic Computer. BIT 4 (1964) 106–114
Carter, M.W., Tovey, C.A.: When is the Classroom Assignment Problem Hard? Oper. Res. 40 (Suppl. 1) (1992) S28–S39
Cooper, T.B., Kingston, J.H.: The Complexity of Timetable Construction Problems. In: Burke E.K., Ross P. (eds.): Practice and Theory of Automated Timetabling,1st Int. Conf.,Selected Papers. Springer-Verlag, Berlin Heidelberg New York (1996) 283–295
de Gans, O.B.: A Computer Timetabling System for Secondary Schools in the Netherlands. Eur. J. Oper. Res. 7 (1981) 175–182
de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19 (1985) 151–162
de Werra, D.: The Combinatorics of Timetabling. Eur. J. Oper. Res. 96 (1997) 504–513
Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Computing 5 (1976) 691–703
Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)
Giaro, K., Kubale, M., Szyfelbein D.: Consecutive Graph Coloring for School Timetabling. In: Burke E.K., Erben W. (eds.): Proc. 3rd Int. Conf. on the Practice and Theory of Automated Timetabling (2000) 212–221
Hopcroft, J.E., Karp, R.M.: An n 5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. Computing 2 (1973) 225–231
Itai, A., Rodeh, M., T animoto, S.L.: Some Matching Problems for Bipartite Graphs. Technical Report TR93. IBM Israel Scientific Center, Haifa,Israel (1977)
Schaerf, A.: A Survey of Automated Timetabling. Technical Report CS-R9567. Centre for Mathematics and Computer Science, Amsterdam,The Netherlands (1995)
Schmidt, G., Ströhlein, T.: Timetable Construction: an Annotated Bibliography. Computer Journal 23 (1980) 307–316
Schreuder, J.A.M.,van der Velde, J.A.: Timetables in Dutch High Schools. In: Brans J.P. (ed.): Operational Research’ 84. Elsevier Science Publishers B.V. (North-Holland) (1984) 601–612
Simons, J.L.: ABC: Een Programma dat Automatisch Blokken Construeert bij de Vakdifferentiatie Binnen het Algemeen Voortgezet Onderwijs. Technical Report 74107U. NLR,Amsterdam, The Netherlands (1974)
van Kesteren, B.: The Clustering Problem in Dutch High Schools: Changing Metrics in Search Space. Internal Report. Leiden Institute for Advanced Computer Science,Leiden University, Leiden,The Netherlands (1999) 99–106
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
ten Eikelder, H.M.M., Willemen, R.J. (2001). Some Complexity Aspects of Secondary School Timetabling Problems. 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_2
Download citation
DOI: https://doi.org/10.1007/3-540-44629-X_2
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