A large scale timetabling problem
Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Survey of Automated Timetabling
Artificial Intelligence Review
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Decomposition, reformulation, and diving in university course timetabling
Computers and Operations Research
Modeling and solution of a complex university course timetabling problem
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Optimal university course timetables and the partial transversal polytope
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
udpSkeduler: A Web architecture based decision support system for course and classroom scheduling
Decision Support Systems
A Two-Stage Decomposition of High School Timetabling applied to cases in Denmark
Computers and Operations Research
| Hi-index | 0.00 |
In this paper we deal with the problem of building a time-table for the courses of a university faculty. We propose an integer linear programming approach based on column generation. Each column is associated with a weekly timetable of a single course. The constraints referring to classroom occupancy and the non-overlapping in time of courses are in the integer linear programming matrix. The constraints and preferences related to a single course timetable are embedded in the column generation procedure. Generating a column for a course amounts to selecting the currently best time slots in the week. The interaction between the column generation procedure and the branch-and-bound method is also discussed. Some computational results are shown.