Finding a feasible course schedule using Tabu search

DOI10.1016/0166-218X(92)90248-9MaRDI QIDQ1186313zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

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

Cited in

(20)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186313)