Comments on: ``An overview of curriculum-based course timetabling

DOI10.1007/S11750-015-0362-3zbMath1319.90028OpenAlexW2078887861MaRDI QIDQ2355017

John H. Drake, Barry McCollum, Ender Özcan, Edmund Kieran Burke

Publication date: 27 July 2015

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-015-0362-3

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (1)

Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions

Uses Software

• Hyperheuristics

Cites Work

• Unnamed Item
• A review of hyper-heuristics for educational timetabling
• Solving the examination timetabling problem in GPUs
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• Fairness in Scheduling
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology

This page was built for publication: Comments on: ``An overview of curriculum-based course timetabling