A large scale timetabling problem
From MaRDI portal
Publication:1112719
DOI10.1016/0305-0548(89)90053-1zbMath0659.90056OpenAlexW2025084346MaRDI QIDQ1112719
Jean Aubin, Jacques A. Ferland
Publication date: 1989
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(89)90053-1
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
A tabu search algorithm for computing an operational timetable, A complexity analysis and an algorithmic approach to student sectioning in existing timetables, A matheuristic for customized multi-level multi-criteria university timetabling, An integer programming formulation for a case study in university timetabling., An automated university course timetabling system developed in a distributed environment: a case study., Exchanges procedures for timetabling problems, Finding a feasible course schedule using Tabu search, Computerised decision aid for timetabling --- a case analysis, New integer linear programming approaches for course timetabling, Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem, A university-timetabling problem and its solution using Benders' partitioning---a case study, Implementation of a university course and examination timetabling system, Term-end exam scheduling at United States Military Academy/West Point, Mathematical programming models and algorithms for a class--faculty assignment problem, Distribution requirements and compactness constraints in school timetabling, The course scheduling problem at Lufthansa technical training, Design and implementation of a course scheduling system using Tabu Search, Tabu search for large scale timetabling problems
Cites Work
- Timetabling problem for university as assignment of activities to resources
- A classroom/time assignment model
- School Timetabling—A Case in Large Binary Integer Linear Programming
- A Lagrangean Relaxation Approach to Course Timetabling
- Scheduling activities among conflicting facilities to minimize conflict cost
- Scheduling to Minimize Interaction Cost
- Elements of Large-Scale Mathematical Programming Part I: Concepts
