Recommendations
Cites work
- 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?)
- A Lagrangean Relaxation Approach to Course Timetabling
- A Note on Faculty Timetabling
- A classroom/time assignment model
- A graph coloring algorithm for large scheduling problems
- A new graph colouring algorithm
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Chromatic Scheduling and the Chromatic Number Problem
- Chromatic optimisation: Limitations, objectives, uses, references
- Continuous Timetabling Problems
- Four classes of perfectly orderable graphs
- 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)- Solving vertex coloring problems as maximum weight stable set problems
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Tabu search for large scale timetabling problems
- Efficient solutions for a university timetabling problem through integer programming
- A computational study of local search algorithms for Italian high-school timetabling
- An integer programming formulation for a case study in university timetabling.
- 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 investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
- Using mixed graph coloring to minimize total completion time in job shop scheduling
- On a multiconstrained model for chromatic scheduling
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete
- An exact method for graph coloring
- A two-stage decomposition of high school timetabling applied to cases in Denmark
- A survey on vertex coloring problems
- Scheduling sports competitions on multiple venues.
- A survey of search methodologies and automated system development for examination timetabling
- Mathematical programming models and algorithms for a class--faculty assignment problem
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
- Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application
- A decomposed metaheuristic approach for a real-world university timetabling problem
- Distribution requirements and compactness constraints in school timetabling
- School timetabling for quality student and teacher schedules
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- Elective course planning
- Cyclic transfers in school timetabling
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Improved local search approaches to solve the post enrolment course timetabling problem
- Constructing a course schedule by solving a series of assignment type problems
- Exploring the role of graph spectra in graph coloring algorithm performance
- An exact approach for the vertex coloring problem
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Some experiments with simulated annealing for coloring graphs
- A search space ``cartography for guiding graph coloring heuristics
- Finding a feasible course schedule using Tabu search
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
- A multi-objective evolutionary algorithm for examination timetabling
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
- A cellular memetic algorithm for the examination timetabling problem
- Application of a real-world university-course timetabling model solved by integer programming
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- Penalising patterns in timetables: novel integer programming formulations
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Measuring instance difficulty for combinatorial optimization problems
- A tabu search algorithm for computing an operational timetable
- A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university
- A computational study of a cutting plane algorithm for university course timetabling
- An effective hybrid algorithm for university course timetabling
- A survey of local search methods for graph coloring
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
- An integer programming approach to curriculum-based examination timetabling
- A graph colouring model for assigning a heterogeneous workforce to a given schedule
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables
- Real-life examination timetabling
- Towards objective measures of algorithm performance across instance space
- Parallel local search algorithms for high school timetabling problems
- Recent research directions in automated timetabling
- Operational research in education
- Timetable construction: the algorithms and complexity perspective
- Weighted graphs and university course timetabling
- Term-end exam scheduling at United States Military Academy/West Point
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms
- Timetabling problems at the TU Eindhoven
- New secure partial encryption method for medical images using graph coloring problem
- Algorithms for the generalized weighted frequency assignment problem
- An exact algorithm with learning for the graph coloring problem
- Assignment problems: a golden anniversary survey
- Heuristic methods and applications: A categorized survey
- A survey of metaheuristic-based techniques for university timetabling problems
- On the chromatic number of graphs
- Constraint programming approach for school timetabling.
- Preference-based assignment of university students to multiple teaching groups
- Complexity of some special types of timetabling problems
- The combinatorics of timetabling
- \(b\)-coloring of tight graphs
- An XML format for benchmarks in high school timetabling
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- A logic approach to the resolution of constraints in timetabling
- The minimum chromatic violation problem: a polyhedral approach
- A new ant colony optimization algorithm for the lower bound of sum coloring problem
- On a conjecture for the university timetabling problem
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- Practices in timetabling in higher education institutions: a systematic review
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- Comparison of neural and heuristic methods for a timetabling problem
- The maximum-impact coloring polytope
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- A note on SS/TDMA satellite communication
- On the complexity of nurse rostering problems
- Connected greedy coloring of \(H\)-free graphs
- Mutual exclusion scheduling with interval graphs or related classes. II
- An adaptive, multiple restarts neural network algorithm for graph coloring
- Facet-generating procedures for the maximum-impact coloring polytope
- Facet-generating procedures for the maximum-impact coloring polytope
- Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy
- A new approach to the vertex coloring problem
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)
