A tabu search algorithm for computing an operational timetable
From MaRDI portal
Publication:1331550
DOI10.1016/0377-2217(94)90009-4zbMath0809.90075OpenAlexW2076259622MaRDI QIDQ1331550
Publication date: 17 October 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90009-4
Related Items
The analytic hierarchy process and multiobjective 0--1 faculty course assignment, On the use of some known methods for \(T\)-colorings of graphs, A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems, Efficient solutions for a university timetabling problem through integer programming, School timetabling for quality student and teacher schedules, A decomposed metaheuristic approach for a real-world university timetabling problem, Operational research in education, HORES: A timetabling system for Spanish secondary schools, Metaheuristics: A bibliography, Case-based heuristic selection for timetabling problems, Elective course planning, A graph-based hyper-heuristic for educational timetabling problems, A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem., Using tabu search with longer-term memory and relaxation to create examination timetables., An integer programming formulation for a case study in university timetabling., Constraint programming approach for school timetabling., Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study, Computational models for timetabling problem, Programação da grade de horário em escolas de ensino fundamental e médio, Towards constraint-based school timetabling, A survey of metaheuristic-based techniques for university timetabling problems, Implementation of a university course and examination timetabling system, Strong bounds with cut and column generation for class-teacher timetabling, Mathematical programming models and algorithms for a class--faculty assignment problem, Scheduling sports competitions on multiple venues., The combinatorics of timetabling, Automorphism groups of \(q\)-trigonal planar Klein surfaces and maximal surfaces, Distribution requirements and compactness constraints in school timetabling, Constructing a course schedule by solving a series of assignment type problems, A generalized class-teacher model for some timetabling problems, The course scheduling problem at Lufthansa technical training, Modeling and solving a real-life assignment problem at universities, An integer program and a hybrid genetic algorithm for the university timetabling problem, A tabu search approach to the constraint satisfaction problem as a general problem solver, A column generation mathematical programming approach for a class-faculty assignment problem with preferences
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for the maximum satisfiability problem
- An introduction to timetabling
- Tabu search for large scale timetabling problems
- A large scale timetabling problem
- An interactive system for constructing timetables on a PC
- Tabu search techniques. A tutorial and an application to neural networks
- Finding a feasible course schedule using Tabu search
- A parallel tabu search algorithm for large traveling salesman problems
- The tabu search metaheuristic: How we used it
- EPCOT: An efficient procedure for coloring optimally with Tabu Search
- On the use of some known methods for \(T\)-colorings of graphs
- School Timetabling—A Case in Large Binary Integer Linear Programming
- Tabu Search—Part I
- Tabu Search—Part II
- On the Complexity of Timetable and Multicommodity Flow Problems
