This work introduces a complex variant of the timetabling problem, which is motivated by the case of Italian schools. The new requirements enforce to (i) provide teachers with the same idle times, (ii) avoid consecutive days with heavy workload, (iii) limit multiple daily lessons for each class, (iv) introduce shorter time units to differentiate entry and exit times. We present an integer programming model for this problem, which is denoted by Italian High School Timetabling Problem (IHSTP). However, requirements (i), (ii), (iii) and (iv) cannot be expressed according to the current XHSTT standard. Since the IHSTP model is very hard to solve by an off-the-shelf solver, we present a two-step optimization method: the first step optimally assigns teachers to lesson times and the second step assigns classes to teachers. An extensive experimentation is performed on the model by realistic and real instances from Italian schools, as well as benchmark instances from the literature. Finally, the experiments show that the method is effective in solving both this new problem and the simplified problem without the new requirements.
展开▼
