Some complexity aspects of secondary school timetabling problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2079 LNCS, Issue , 2001, Pages 18-27

  Ten Eikelder, H M M ^a   Willemen, R J ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CURRICULA; STUDENTS; TEACHING;

GROUP SIZE; NP-HARD; POLYNOMIALLY SOLVABLE; SECONDARY SCHOOLS; SUB-PROBLEMS; TIME SLOTS; TIMETABLING PROBLEM;

SCHEDULING;

EID: 84889597487     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44629-x_2     Document Type: Conference Paper

References (16)

1. Berghuis,J.,van der Heiden,A.J.,Bakker,R.: The Preparation of School Timetables by Electronic Computer. BIT 4 (1964) 106-114
2. Carter,M.W.,Tovey,C.A.: When is the Classroom Assignment Problem Hard? Oper. Res. 40 (Suppl. 1) (1992) S28-S39
3. 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
4. de Gans, O.B.: A Computer Timetabling System for Secondary Schools in the Netherlands. Eur. J. Oper. Res. 7 (1981) 175-182
5. de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19 (1985) 151-162
6. de Werra, D.: The Combinatorics of Timetabling. Eur. J. Oper. Res. 96 (1997) 504-513
7. Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Computing 5 (1976) 691-703
8. Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)
9. 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
10. Hopcroft, J.E., Karp, R.M.: Anns Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. Computing 2 (1973) 225-231
11. Itai, A., Rodeh, M., Tanimoto, S.L.: Some Matching Problems for Bipartite Graphs. Technical Report TR93. IBM Israel Scientific Center, Haifa, Israel (1977)
12. Schaerf, A.: A Survey of Automated Timetabling. Technical Report CS-R9567. Centre for Mathematics and Computer Science, Amsterdam, The Netherlands (1995)
13. Schmidt, G., Ströhlein, T.: Timetable Construction: an Annotated Bibliography. Computer Journal 23 (1980) 307-316
14. 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
15. 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)
16. 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