A generalized class-teacher model for some timetabling problems

DOI10.1016/S0377-2217(01)00342-3zbMath1082.05521MaRDI QIDQ1848400

Dominique de Werra, Armen S. Asratian

Publication date: 20 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Edge coloringChromatic indexTimetablingUniversity timetable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (17)

Comparison of metaheuristic algorithms for examination timetabling problem ⋮ Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications ⋮ School timetabling for quality student and teacher schedules ⋮ A decomposed metaheuristic approach for a real-world university timetabling problem ⋮ A heuristic approach to simultaneous course/student timetabling ⋮ A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations ⋮ An adaptive large neighbourhood search metaheuristic for hourly learning activity planning in personalised learning ⋮ A computational study of local search algorithms for Italian high-school timetabling ⋮ Decomposition of university course timetabling. A systematic study of subproblems and their complexities ⋮ A projective algorithm for preemptive open shop scheduling with two multiprocessor groups ⋮ Hybrid heuristics for examination timetabling problem ⋮ Mathematical programming models and algorithms for a class--faculty assignment problem ⋮ On a conjecture for the university timetabling problem ⋮ Application of a real-world university-course timetabling model solved by integer programming ⋮ Polynomial reduction of time-space scheduling to time scheduling ⋮ A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to timetabling
• Chromatic optimisation: Limitations, objectives, uses, references
• Construction of university faculty timetables using logic programming techniques
• Finding a feasible course schedule using Tabu search
• Extensions of coloring models for scheduling purposes
• A tabu search algorithm for computing an operational timetable
• Investigation on interval edge-colorings of graphs
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• On the Complexity of Timetable and Multicommodity Flow Problems
• Graph coloring conditions for the existence of solutions to the timetable problem
• Zurückführung des Stundenplanproblems auf ein dreidimensionales Transportproblem

This page was built for publication: A generalized class-teacher model for some timetabling problems