An integer programming formulation for a case study in university timetabling.
From MaRDI portal
Publication:1417497
DOI10.1016/S0377-2217(03)00103-6zbMath1053.90078MaRDI QIDQ1417497
Publication date: 5 January 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- An introduction to timetabling
- Timetabling problem for university as assignment of activities to resources
- A large scale timetabling problem
- Finding a feasible course schedule using Tabu search
- Computerised decision aid for timetabling --- a case analysis
- A logic approach to the resolution of constraints in timetabling
- The combinatorics of timetabling
- The teacher assignment problem: A special case of the fixed charge transportation problem
- Distribution requirements and compactness constraints in school timetabling
- A tabu search algorithm for computing an operational timetable
- A multi-objective course scheduling model: Combining faculty preferences for courses and times.
- Combinatorial Optimization Problems with Soft and Hard Requirements
- A linear algorithm for computing the optimum university timetable
- School Timetabling—A Case in Large Binary Integer Linear Programming
- University timetabling by constraint-based reasoning: A case study
- Timetabling for Greek high schools
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Implementation of a university course and examination timetabling system
