Finding a feasible course schedule using Tabu search

DOI10.1016/0166-218X(92)90248-9zbMath0800.90562OpenAlexW2011716148MaRDI QIDQ1186313

Alain Hertz

Publication date: 28 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90248-9

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (20)

Scheduling the replenishment of just-in-time supermarkets in assembly plants ⋮ A tabu search algorithm for computing an operational timetable ⋮ A stochastic local search algorithm with adaptive acceptance for high-school timetabling ⋮ 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 ⋮ Metaheuristics: A bibliography ⋮ Profit margin oriented course scheduling at Lufthansa Technical Training Ltd. ⋮ Parts-to-picker based order processing in a rack-moving mobile robots environment ⋮ Guidelines for the use of meta-heuristics in combinatorial optimization. ⋮ An integer programming formulation for a case study in university timetabling. ⋮ Scheduling in-house transport vehicles to feed parts to automotive assembly lines ⋮ A direct barter model for course add/drop process ⋮ 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 ⋮ Design and implementation of a course scheduling system using Tabu Search ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences

Cites Work

• Using tabu search techniques for graph coloring
• Algorithms for the maximum satisfiability problem
• An introduction to timetabling
• Tabu search for large scale timetabling problems
• Timetabling problem for university as assignment of activities to resources
• A large scale timetabling problem
• A new heuristic method for the flow shop sequencing problem
• Tabu search techniques. A tutorial and an application to neural networks
• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• The tabu search metaheuristic: How we used it
• Future paths for integer programming and links to artificial intelligence
• Combinatorial Optimization Problems with Soft and Hard Requirements
• A Lagrangean Relaxation Approach to Course Timetabling
• Scheduling activities among conflicting facilities to minimize conflict cost
• On the Complexity of Timetable and Multicommodity Flow Problems
• Scheduling to Minimize Interaction Cost

This page was built for publication: Finding a feasible course schedule using Tabu search