Zenodo (CERN European Organization for Nuclear Research) · 2007 · 29 citations · 10 references
BusinessInstructionTeachingOptimizationSchedulingAssignment ProblemsScheduling TheoryTeacher Assignment ConstraintsTeacher Assignment Decision-makingTeacher Assignment ModelsTeacher Assignment OptimizationTeacher Assignment Scheduling
This paper presents a hybrid algorithm for solving a timetabling problem, which is commonly encountered in many universities. The problem combines both teacher assignment and course scheduling problems simultaneously, and is presented as a mathematical programming model. However, this problem becomes intractable and it is unlikely that a proven optimal solution can be obtained by an integer programming approach, especially for large problem instances. A hybrid algorithm that combines an integer programming approach, a greedy heuristic and a modified simulated annealing algorithm collaboratively is proposed to solve the problem. Several randomly generated data sets of sizes comparable to that of an institution in Indonesia are solved using the proposed algorithm. Computational results indicate that the algorithm can overcome difficulties of large problem sizes encountered in previous related works.
10
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
On the Complexity of Timetable and Multicommodity Flow Problems
Shimon Even, Alon Itai, Adi Shamir · SIAM Journal on Computing · 1976 · 1.1K citations
An effective hybrid algorithm for university course timetabling
Marco Chiarandini, Mauro Birattari, Krzysztof Socha et al. · Journal of Scheduling · 2006 · 141 citations
Recent developments in practical course timetabling
M. W. Carter, Gilbert Laporte · Lecture notes in computer science · 1998 · 128 citations
Management, Teaching, Scheduling +3