A generalized class-teacher model for some timetabling problems

DOI10.1016/S0377-2217(01)00342-3MaRDI QIDQ1848400zbMATH OpenFDO

Authors 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

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

Recommendations

• Complexity of some special types of timetabling problems
• On a conjecture for the university timetabling problem
• scientific article; zbMATH DE number 1728530
• The combinatorics of timetabling
• Timetabling problem for university as assignment of activities to resources

Cites work

• scientific article; zbMATH DE number 4150219 (Why is no real title available?)
• scientific article; zbMATH DE number 56036 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1194938 (Why is no real title available?)
• scientific article; zbMATH DE number 3230852 (Why is no real title available?)
• scientific article; zbMATH DE number 3333906 (Why is no real title available?)
• scientific article; zbMATH DE number 3353065 (Why is no real title available?)
• A tabu search algorithm for computing an operational timetable
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• An introduction to timetabling
• Chromatic optimisation: Limitations, objectives, uses, references
• Construction of university faculty timetables using logic programming techniques
• Extensions of coloring models for scheduling purposes
• Finding a feasible course schedule using Tabu search
• Graph coloring conditions for the existence of solutions to the timetable problem
• Graph theory
• Investigation on interval edge-colorings of graphs
• On the Complexity of Timetable and Multicommodity Flow Problems
• Zurückführung des Stundenplanproblems auf ein dreidimensionales Transportproblem

Cited in

(32)

• 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
• On a conjecture for the university timetabling problem
• Comparison of metaheuristic algorithms for examination timetabling problem
• A computational study of local search algorithms for Italian high-school timetabling
• Condensing timetables with target date divisible by each instructor's number of class hours
• scientific article; zbMATH DE number 6966255 (Why is no real title available?)
• Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
• Optimal student sectioning on mandatory courses with various sections numbers
• Mathematical programming models and algorithms for a class--faculty assignment problem
• A decomposed metaheuristic approach for a real-world university timetabling problem
• School timetabling for quality student and teacher schedules
• Hybrid heuristics for examination timetabling problem
• Scheduling classes on a college campus
• Multiprofessor scheduling
• Disjoint congruence classes and a timetabling application
• Timetabling problem for university as assignment of activities to resources
• A heuristic approach to simultaneous course/student timetabling
• Application of a real-world university-course timetabling model solved by integer programming
• Time-Tabling Problems: Should They Be Canonical?
• Polynomial reduction of time-space scheduling to time scheduling
• Decomposition of university course timetabling. A systematic study of subproblems and their complexities
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
• An adaptive large neighbourhood search metaheuristic for hourly learning activity planning in personalised learning
• A complexity analysis and an algorithmic approach to student sectioning in existing timetables
• A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
• A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
• scientific article; zbMATH DE number 1728530 (Why is no real title available?)
• Algorithm and theorem on student activity problems
• A continuous timetable with m, m – 2, or 2 instructor’s class hours
• Multi-objective faculty course assignment problem based on the double parametric form of fuzzy preferences
• Strong bounds with cut and column generation for class-teacher timetabling

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

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