Constructing a course schedule by solving a series of assignment type problems

DOI10.1016/S0377-2217(97)00097-0zbMath0936.90025OpenAlexW2092298566MaRDI QIDQ1296794

Alain Hertz, Vincent Robert

Publication date: 3 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00097-0

zbMATH Keywords

constrained course scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Operational research in education ⋮ A survey of school timetabling research ⋮ New integer linear programming approaches for course timetabling ⋮ A direct barter model for course add/drop process ⋮ The combinatorics of timetabling ⋮ Modeling and solving a real-life assignment problem at universities

Uses Software

• TABARIS

Cites Work

• Unnamed Item
• TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
• An introduction to timetabling
• Tabu search for large scale timetabling problems
• Tabu search techniques. A tutorial and an application to neural networks
• A classroom/time assignment model
• Exchanges procedures for timetabling problems
• Finding a feasible course schedule using Tabu search
• A survey of algorithms for the generalized assignment problem
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• A tabu search algorithm for computing an operational timetable
• Solving the maximum clique problem using a tabu search approach
• Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
• A Lagrangean Relaxation Approach to Course Timetabling
• Tabu Search—Part I
• Tabu Search—Part II
• A branch and bound algorithm for the generalized assignment problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
• Scheduling to Minimize Interaction Cost

This page was built for publication: Constructing a course schedule by solving a series of assignment type problems