Timetable construction: the algorithms and complexity perspective

DOI10.1007/S10479-012-1160-ZMaRDI QIDQ475200zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A tabu search algorithm for computing an operational timetable
• The combinatorics of timetabling
• Time-Tabling Problems: Should They Be Canonical?
• An introduction to timetabling
• Tests on a computer method for constructing school timetables

Cites work

• scientific article; zbMATH DE number 1728532 (Why is no real title available?)
• scientific article; zbMATH DE number 1349588 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 912593 (Why is no real title available?)
• scientific article; zbMATH DE number 3230852 (Why is no real title available?)
• scientific article; zbMATH DE number 3363329 (Why is no real title available?)
• A branch-and-cut procedure for the Udine course timetabling problem
• A survey of very large-scale neighborhood search techniques
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Optimization by simulated annealing
• Resource assignment in high school timetabling
• Tests on a computer method for constructing school timetables

Cited in

(11)

• About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness
• scientific article; zbMATH DE number 1728546 (Why is no real title available?)
• Repairing high school timetables with polymorphic ejection chains
• Time-Tabling Problems: Should They Be Canonical?
• Decomposition of university course timetabling. A systematic study of subproblems and their complexities
• Model of time-table construction process
• A complexity analysis and an algorithmic approach to student sectioning in existing timetables
• Iterative restart technique for solving timetabling problems.
• Accelerating time-dependent multi-criteria timetable information is harder than expected
• Exchanges procedures for timetabling problems
• Complexity of some special types of timetabling problems

Describes a project that uses

Uses Software

• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475200)