A large scale timetabling problem
This problem has two main components. In the timetabling subproblem a master timetable is derived taking into account student registrations and lecturer and classroom availabilities. The grouping subproblem specifies groups of students for large courses that have to be repeated several times during the week. In this paper we propose an approach to handle both subproblems and to deal with their strong relationship. The solution approach includes several heuristic procedures to handle the subproblems which are formulated as assignment type problems in which entities are assigned to resources by using penalty terms for conflicts and excessive use of classrooms. Finally numerical results are also reported.
- A constraint-based approach to the timetabling problem
- scientific article; zbMATH DE number 1054932
- School Timetabling—A Case in Large Binary Integer Linear Programming
- A decomposition approach to the solution of large-scale scheduling problems
- scientific article; zbMATH DE number 4031379
- Solving Large-Scale Tour Scheduling Problems
- The multiphase course timetabling problem
- The combinatorics of timetabling
- Improving the modulo simplex algorithm for large-scale periodic timetabling
- A classroom/time assignment model
- A Lagrangean Relaxation Approach to Course Timetabling
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Scheduling activities among conflicting facilities to minimize conflict cost
- Scheduling to Minimize Interaction Cost
- School Timetabling—A Case in Large Binary Integer Linear Programming
- Timetabling problem for university as assignment of activities to resources
- Timetabling problem for university as assignment of activities to resources
- Exchanges procedures for timetabling problems
- Finding a feasible course schedule using Tabu search
- Computerised decision aid for timetabling --- a case analysis
- Distribution requirements and compactness constraints in school timetabling
- The course scheduling problem at Lufthansa technical training
- A tabu search algorithm for computing an operational timetable
- 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.
- Complexity of some special types of timetabling problems
- Design and implementation of a course scheduling system using Tabu Search
- A multi-stage IP-based heuristic for class timetabling and trainer rostering
- New integer linear programming approaches for course timetabling
- Mathematical programming models and algorithms for a class--faculty assignment problem
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables
- Solving Large-Scale Tour Scheduling Problems
- scientific article; zbMATH DE number 2148765 (Why is no real title available?)
- Implementation of a university course and examination timetabling system
- A matheuristic for customized multi-level multi-criteria university timetabling
- Curriculum-based university course timetabling considering individual course of studies
- Term-end exam scheduling at United States Military Academy/West Point
- Tabu search for large scale timetabling problems
- 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
This page was built for publication: A large scale timetabling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112719)
