This paper introduces the multiphase course timetabling problem and presents mathematical formulations effective solution algorithms to solve it in a real case study. Consider pool of lessons number students who are required take subset these graduate. Each lesson consists predetermined consecutive sequence phases with possibly different resource requirements duration. Students must be present ...

University timetabling problem is a very common and seemingly simple, but yet very difficult problem to solve in practice. While solution definitely exists (evidenced by the fact that we do hold classes), an automated optimal schedule is very difficult to derive at present. There were successful attempts to address this problem using heuristics search methods. However, until now, university tim...

The modeling and solution approaches being used to automate construction of course timetables at a large university are discussed. A course structure model is presented that allows this complex real-world problem to be described using a classical formulation. The problem is then tackled utilizing a course timetabling solver model that transforms it into a constraint satisfaction and optimizatio...

In this paper we describe a successful case-study where a Branch-and-Cut algorithm yields the “optimal” solution of a real-world timetabling problem for university courses (University Course Timetabling problem). The polyhedral structure of the problem is studied in conection with a polytope of the Set Packing problem. Several families of cutting planes are introduced, these being crutial to fi...

The university course timetabling is known to be a highly constrained optimization problem, more complex than examination timetabling. Many different approaches, including evolutionary algorithms, tabu search, simulated annealing, and their hybrids, are developed for solving the problem. The negative selection algorithm, an algorithm inspired by the immune system, has successfully been applied ...

The university course timetabling problem is a typical combinatorial optimization problem. This paper tackles the multi-objective university course timetabling problem (MOUCTP) and proposes a guided search non-dominated sorting genetic algorithm to solve the MOUCTP. The proposed algorithm integrates a guided search technique, which uses a memory to store useful information extracted from previo...