University timetabling by constraint-based reasoning: A case study

DOI10.1057/palgrave.jors.2600469zbMath0895.90115OpenAlexW2021445554MaRDI QIDQ4383670

P. A. B. D. Samat, S. B. Deris, Hiroshi Ohta, Shigeru Omatu

Publication date: 27 September 1998

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600469

zbMATH Keywords

case-studyconstraint satisfaction modeltimetable planning

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Efficient solutions for a university timetabling problem through integer programming ⋮ School timetabling for quality student and teacher schedules ⋮ Operational research in education ⋮ A graph-based hyper-heuristic for educational timetabling problems ⋮ An integer programming formulation for a case study in university timetabling. ⋮ A survey of metaheuristic-based techniques for university timetabling problems ⋮ A university-timetabling problem and its solution using Benders' partitioning---a case study ⋮ Implementation of a university course and examination timetabling system ⋮ Application of a real-world university-course timetabling model solved by integer programming ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences

This page was built for publication: University timetabling by constraint-based reasoning: A case study