A huge variety of timetabling models have been described in the OR literature; they range from the weekly timetable of a school to the scheduling of courses or exams in a university. Graphs and networks have proven to be useful in the formulation and solution of such problems. Various models will be described with an emphasis on graph theoretical models.
Recommendations
Cites work
- A classroom/time assignment model
- A graph coloring algorithm for large scheduling problems
- A Lagrangean Relaxation Approach to Course Timetabling
- A new graph colouring algorithm
- A Note on Faculty Timetabling
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Chromatic optimisation: Limitations, objectives, uses, references
- Chromatic Scheduling and the Chromatic Number Problem
- Continuous Timetabling Problems
- Four classes of perfectly orderable graphs
- scientific article; zbMATH DE number 3491001 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3230852 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- New methods to color the vertices of a graph
- On the Complexity of Timetable and Multicommodity Flow Problems
- School Timetables
- Some Comments On A Note About Timetabling*
- Zurückführung des Stundenplanproblems auf ein dreidimensionales Transportproblem
Cited in
(only showing first 100 items - show all)- Application of a real-world university-course timetabling model solved by integer programming
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Combinatorial optimization in system configuration design
- A search space ``cartography for guiding graph coloring heuristics
- An interactive system for constructing timetables on a PC
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
- COSINE: A new graph coloring algorithm
- Weighted graphs and university course timetabling
- Modelling and solving an acyclic multi-period timetabling problem
- Finding a feasible course schedule using Tabu search
- A logic approach to the resolution of constraints in timetabling
- A graph colouring model for assigning a heterogeneous workforce to a given schedule
- An adaptive, multiple restarts neural network algorithm for graph coloring
- Comparison of neural and heuristic methods for a timetabling problem
- The combinatorics of timetabling
- Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application
- Distribution requirements and compactness constraints in school timetabling
- On a multiconstrained model for chromatic scheduling
- Pre-processing techniques for resource allocation in the heterogeneous case
- Constructing a course schedule by solving a series of assignment type problems
- Modeling and solving a real-life assignment problem at universities
- Chromatic scheduling and frequency assignment
- A tabu search algorithm for computing an operational timetable
- Preassignment requirements in chromatic scheduling
- Profit margin oriented course scheduling at Lufthansa Technical Training Ltd.
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
- An integer programming formulation for a case study in university timetabling.
- Constraint programming approach for school timetabling.
- Timetable planning using the constraint-based reasoning
- Recent research directions in automated timetabling
- Complexity of some special types of timetabling problems
- A cellular memetic algorithm for the examination timetabling problem
- Parallel local search algorithms for high school timetabling problems
- On the \(b\)-continuity of the lexicographic product of graphs
- Multiprofessor scheduling
- An integer programming approach to curriculum-based examination timetabling
- Graphs with small fall-spectrum
- Practices in timetabling in higher education institutions: a systematic review
- Linear integer model for the course timetabling problem of a faculty in Rio de Janeiro
- Improved local search approaches to solve the post enrolment course timetabling problem
- \(b\)-coloring of tight graphs
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- An XML format for benchmarks in high school timetabling
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Measuring instance difficulty for combinatorial optimization problems
- A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university
- Scheduling sports competitions on multiple venues.
- Heuristic methods and applications: A categorized survey
- A generalized class-teacher model for some timetabling problems
- Efficient solutions for a university timetabling problem through integer programming
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
- A new ant colony optimization algorithm for the lower bound of sum coloring problem
- On a conjecture for the university timetabling problem
- Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy
- The minimum chromatic violation problem: a polyhedral approach
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- A decomposed metaheuristic approach for a real-world university timetabling problem
- Simple decentralized graph coloring
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- A multi-stage IP-based heuristic for class timetabling and trainer rostering
- CHECKCOL: improved local search for graph coloring
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Mutual exclusion scheduling with interval graphs or related classes. II
- A survey of metaheuristic-based techniques for university timetabling problems
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- An exact method for graph coloring
- A survey of local search methods for graph coloring
- Mathematical programming models and algorithms for a class--faculty assignment problem
- An effective hybrid local search approach for the post enrolment course timetabling problem
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- A new approach to the vertex coloring problem
- Graph theory applied in school schedule network
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- An adaptive flex-deluge approach to university exam timetabling
- The maximum-impact coloring polytope
- A survey on vertex coloring problems
- Real-life examination timetabling
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables
- Operational research in education
- New secure partial encryption method for medical images using graph coloring problem
- A two-stage decomposition of high school timetabling applied to cases in Denmark
- Towards objective measures of algorithm performance across instance space
- An exact algorithm with learning for the graph coloring problem
- Algorithms for the generalized weighted frequency assignment problem
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
- Exploring the role of graph spectra in graph coloring algorithm performance
- Elective course planning
- Cyclic transfers in school timetabling
- An exact approach for the vertex coloring problem
- Object-oriented constraint logic programming for timetable planning
- Iterative coloring extension of a maximum clique
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms
- Timetable construction: the algorithms and complexity perspective
- Preference-based assignment of university students to multiple teaching groups
- An approximation scheme for bin packing with conflicts
This page was built for publication: An introduction to timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759645)
