Computational models for timetabling problem

DOI10.3934/naco.2014.4.269zbMath1303.90042OpenAlexW2068038092MaRDI QIDQ478951

Louis Caccetta, Nur Aidya Hanum Aizam

Publication date: 5 December 2014

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2014.4.269

zbMATH Keywords

integer programminguniversity course timetabling problemtimetabling problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Uses Software

• AIMMS

Cites Work

• Unnamed Item
• A computational study of a cutting plane algorithm for university course timetabling
• Application of a real-world university-course timetabling model solved by integer programming
• A tabu search algorithm for computing an operational timetable
• An integer programming formulation for a case study in university timetabling.
• Constraint programming approach for school timetabling.
• Recent research directions in automated timetabling
• Design and implementation of a course scheduling system using Tabu Search
• Efficient solutions for a university timetabling problem through integer programming
• Penalising Patterns in Timetables: Novel Integer Programming Formulations

This page was built for publication: Computational models for timetabling problem