Timetable construction: the algorithms and complexity perspective

DOI10.1007/S10479-012-1160-ZzbMATH Open1301.90039OpenAlexW2082941228MaRDI QIDQ475200FDOQ475200

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

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

zbMATH Keywords

algorithmsNP-completenesstimetabling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Optimization by simulated annealing
• Title not available (Why is that?)
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Title not available (Why is that?)
• A branch-and-cut procedure for the Udine course timetabling problem
• Resource assignment in high school timetabling
• Title not available (Why is that?)
• A survey of very large-scale neighborhood search techniques
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tests on a computer method for constructing school timetables

Cited In (11)

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

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)