An introduction to timetabling
From MaRDI portal
Publication:759645
DOI10.1016/0377-2217(85)90167-5zbMATH Open0553.90059OpenAlexW2032876227MaRDI QIDQ759645FDOQ759645
Authors: Dominique De Werra 
Publication date: 1985
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(85)90167-5
Recommendations
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- Title not available (Why is that?)
- On the Complexity of Timetable and Multicommodity Flow Problems
- Title not available (Why is that?)
- A graph coloring algorithm for large scheduling problems
- New methods to color the vertices of a graph
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- A Lagrangean Relaxation Approach to Course Timetabling
- A Note on Faculty Timetabling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Four classes of perfectly orderable graphs
- Chromatic Scheduling and the Chromatic Number Problem
- A classroom/time assignment model
- Chromatic optimisation: Limitations, objectives, uses, references
- A new graph colouring algorithm
- Continuous Timetabling Problems
- School Timetables
- Title not available (Why is that?)
- 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)
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- An exact method for graph coloring
- Scheduling sports competitions on multiple venues.
- Assignment problems: a golden anniversary survey
- Term-end exam scheduling at United States Military Academy/West Point
- Using mixed graph coloring to minimize total completion time in job shop scheduling
- Towards objective measures of algorithm performance across instance space
- Elective course planning
- Cyclic transfers in school timetabling
- An exact approach for the vertex coloring problem
- Timetable construction: the algorithms and complexity perspective
- Some experiments with simulated annealing for coloring graphs
- Heuristic methods and applications: A categorized survey
- Tabu search for large scale timetabling problems
- A two-stage decomposition of high school timetabling applied to cases in Denmark
- A survey of search methodologies and automated system development for examination timetabling
- School timetabling for quality student and teacher schedules
- A computational study of a cutting plane algorithm for university course timetabling
- An effective hybrid algorithm for university course timetabling
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
- On a multiconstrained model for chromatic scheduling
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- A search space ``cartography for guiding graph coloring heuristics
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
- Solving vertex coloring problems as maximum weight stable set problems
- Finding a feasible course schedule using Tabu search
- The combinatorics of timetabling
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables
- Real-life examination timetabling
- Operational research in education
- Constraint programming approach for school timetabling.
- Recent research directions in automated timetabling
- \(b\)-coloring of tight graphs
- An XML format for benchmarks in high school timetabling
- Improved local search approaches to solve the post enrolment course timetabling problem
- A survey of local search methods for graph coloring
- A graph colouring model for assigning a heterogeneous workforce to a given schedule
- New secure partial encryption method for medical images using graph coloring problem
- An exact algorithm with learning for the graph coloring problem
- Exploring the role of graph spectra in graph coloring algorithm performance
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms
- Preference-based assignment of university students to multiple teaching groups
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Measuring instance difficulty for combinatorial optimization problems
- Algorithms for the generalized weighted frequency assignment problem
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
- Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application
- Constructing a course schedule by solving a series of assignment type problems
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Application of a real-world university-course timetabling model solved by integer programming
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
- A tabu search algorithm for computing an operational timetable
- Timetabling problems at the TU Eindhoven
- An integer programming formulation for a case study in university timetabling.
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- A multi-objective evolutionary algorithm for examination timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- A computational study of local search algorithms for Italian high-school timetabling
- An integer programming approach to curriculum-based examination timetabling
- On the chromatic number of graphs
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
- A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
- Weighted graphs and university course timetabling
- Efficient solutions for a university timetabling problem through integer programming
- Distribution requirements and compactness constraints in school timetabling
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A survey on vertex coloring problems
- 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
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- Penalising patterns in timetables: novel integer programming formulations
- A decomposed metaheuristic approach for a real-world university timetabling problem
- Mathematical programming models and algorithms for a class--faculty assignment problem
- On the complexity of nurse rostering problems
- Practices in timetabling in higher education institutions: a systematic review
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study
- A matheuristic for customized multi-level multi-criteria university timetabling
- Graph theory applied in school schedule network
- An integer program and a hybrid genetic algorithm for the university timetabling problem
- Comparison of neural and heuristic methods for a timetabling problem
- An interactive system for constructing timetables on a PC
- Classroom note. Contributions of graphs to staff rostering
- Facet-generating procedures for the maximum-impact coloring polytope
- Facet-generating procedures for the maximum-impact coloring polytope
- Linear integer model for the course timetabling problem of a faculty in Rio de Janeiro
- A multi-stage IP-based heuristic for class timetabling and trainer rostering
- Preassignment requirements in chromatic scheduling
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- A generalized class-teacher model for some timetabling problems
- A logic approach to the resolution of constraints in timetabling
- Flow in network modeling time tabling and scheduling problem
- Timetable planning using the constraint-based reasoning
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)
