Polynomial reduction of time-space scheduling to time scheduling

DOI10.1016/J.DAM.2008.10.014zbMath1163.90513OpenAlexW2117909886MaRDI QIDQ1028105

J. Studenovský

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.10.014

zbMATH Keywords

computational complexityschedulingtimetablingpolynomial reductionuniversity course timetabling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• An effective hybrid algorithm for university course timetabling
• An automated university course timetabling system developed in a distributed environment: a case study.
• A generalized class-teacher model for some timetabling problems
• Efficient solutions for a university timetabling problem through integer programming
• A graph-based hyper-heuristic for educational timetabling problems
• On the Complexity of Timetable and Multicommodity Flow Problems
• Multiple-retrieval case-based reasoning for course timetabling problems
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: Polynomial reduction of time-space scheduling to time scheduling