An introduction to timetabling

From MaRDI portal

Publication:759645

Jump to:navigation, search

DOI10.1016/0377-2217(85)90167-5zbMath0553.90059OpenAlexW2032876227MaRDI QIDQ759645

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

zbMATH Keywords

heuristics graphs timetabling education networks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Chromatic scheduling and frequency assignment, A tabu search algorithm for computing an operational timetable, Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications, A survey of search methodologies and automated system development for examination timetabling, Efficient solutions for a university timetabling problem through integer programming, A multi-objective evolutionary algorithm for examination timetabling, School timetabling for quality student and teacher schedules, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, A complexity analysis and an algorithmic approach to student sectioning in existing timetables, A decomposed metaheuristic approach for a real-world university timetabling problem, Operational research in education, Assignment problems: a golden anniversary survey, 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, Using mixed graph coloring to minimize total completion time in job shop scheduling, A cellular memetic algorithm for the examination timetabling problem, Algorithms for the generalized weighted frequency assignment problem, Preassignment requirements in chromatic scheduling, Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling, 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, An interactive system for constructing timetables on a PC, A binary-rounding heuristic for multi-period variable-task-duration assignment problems, A computational study of a cutting plane algorithm for university course timetabling, An effective hybrid algorithm for university course timetabling, Profit margin oriented course scheduling at Lufthansa Technical Training Ltd., Parallel local search algorithms for high school timetabling problems, The minimum chromatic violation problem: a polyhedral approach, On the \(b\)-continuity of the lexicographic product of graphs, Multiprofessor scheduling, An integer programming approach to curriculum-based 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, A new ant colony optimization algorithm for the lower bound of sum coloring problem, 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., A note on SS/TDMA satellite communication, Constraint programming approach for school timetabling., A survey of repair methods used as constraint handling techniques in evolutionary algorithms, Graphs with small fall-spectrum, A computational study of local search algorithms for Italian high-school timetabling, Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study, Practices in timetabling in higher education institutions: a systematic review, Preference-based assignment of university students to multiple teaching groups, Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths, COSINE: A new graph coloring algorithm, 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, Weighted graphs and university course timetabling, Modelling and solving an acyclic multi-period timetabling problem, Finding a feasible course schedule using Tabu search, Coloring graphs by iterated local search traversing feasible and infeasible solutions, A logic approach to the resolution of constraints in timetabling, Linear integer model for the course timetabling problem of a faculty in Rio de Janeiro, Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem, Solving vertex coloring problems as maximum weight stable set problems, Improved local search approaches to solve the post enrolment course timetabling problem, An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables, \(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, Term-end exam scheduling at United States Military Academy/West Point, A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university, Some experiments with simulated annealing for coloring graphs, On a conjecture for the university timetabling problem, The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution, Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete, Scheduling sports competitions on multiple venues., Application of a real-world university-course timetabling model solved by integer programming, 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, Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems, Combinatorial optimization in system configuration design, The combinatorics of timetabling, Heuristic methods and applications: A categorized survey, Timetable planning using the constraint-based reasoning, Connected greedy coloring of \(H\)-free graphs, A search space ``cartography for guiding graph coloring heuristics, 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, Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy, Pre-processing techniques for resource allocation in the heterogeneous case, Constructing a course schedule by solving a series of assignment type problems, A generalized class-teacher model for some timetabling problems, Modeling and solving a real-life assignment problem at universities, Recent research directions in automated timetabling, Complexity of some special types of timetabling problems, Tabu search for large scale timetabling problems, Iterative coloring extension of a maximum clique, An effective hybrid local search approach for the post enrolment course timetabling problem, A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques, A systematic study on meta-heuristic approaches for solving the graph coloring problem, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, An Adaptive Flex-Deluge Approach to University Exam Timetabling, A matheuristic for customized multi-level multi-criteria university timetabling, The maximum-impact coloring polytope, Unnamed Item, Object-oriented constraint logic programming for timetable planning, A survey on vertex coloring problems, Mutual exclusion scheduling with interval graphs or related classes. II, Timetabling problems at the TU Eindhoven, 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, On the chromatic number of graphs, Mathematical programming models and algorithms for a class--faculty assignment problem, A NEW APPROACH TO THE VERTEX COLORING PROBLEM, Facet-generating procedures for the maximum-impact coloring polytope, Facet-generating procedures for the maximum-impact coloring polytope, An approximation scheme for bin packing with conflicts, An integer program and a hybrid genetic algorithm for the university timetabling problem

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:759645&oldid=12685509"