Timetable construction: the algorithms and complexity perspective

DOI10.1007/s10479-012-1160-zzbMath1301.90039OpenAlexW2082941228MaRDI QIDQ475200

Jeffrey H. Kingston

Publication date: 26 November 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1160-z

zbMATH Keywords

algorithmsNP-completenesstimetabling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Repairing high school timetables with polymorphic ejection chains ⋮ A complexity analysis and an algorithmic approach to student sectioning in existing timetables ⋮ Decomposition of university course timetabling. A systematic study of subproblems and their complexities

Uses Software

• Tabu search

Cites Work

• Optimization by Simulated Annealing
• A survey of very large-scale neighborhood search techniques
• A branch-and-cut procedure for the Udine course timetabling problem
• Resource assignment in high school timetabling
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Tests on a computer method for constructing school timetables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Timetable construction: the algorithms and complexity perspective