When is the classroom assignment problem hard?
Operations Research - Supplement
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of Timetable Construction Problems
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A survey of automated timetabling
A survey of automated timetabling
A MAX-MIN Ant System for the University Course Timetabling Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Solving effectively the school timetabling problem using particle swarm optimization
Expert Systems with Applications: An International Journal
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A hybrid particle swarm optimization based algorithm for high school timetabling problems
Applied Soft Computing
| Hi-index | 0.00 |
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.