Finding a feasible course schedule using Tabu search
- 6 March 1992
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 35 (3) , 255-270
- https://doi.org/10.1016/0166-218x(92)90248-9
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengthsEuropean Journal of Operational Research, 1991
- A large scale timetabling problemComputers & Operations Research, 1989
- Tabu search techniquesOR Spectrum, 1989
- Combinatorial Optimization Problems with Soft and Hard RequirementsJournal of the Operational Research Society, 1987
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986
- Timetabling problem for university as assignment of activities to resourcesComputers & Operations Research, 1985
- An introduction to timetablingEuropean Journal of Operational Research, 1985
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- Scheduling activities among conflicting facilities to minimize conflict costMathematical Programming, 1974
- Scheduling to Minimize Interaction CostOperations Research, 1966