An integer programming formulation for a case study in university timetabling.
From MaRDI portal
Publication:1417497
DOI10.1016/S0377-2217(03)00103-6zbMath1053.90078OpenAlexW1993342066MaRDI QIDQ1417497
Publication date: 5 January 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00103-6
Related Items (39)
A computational approach to enhancing course timetabling with integer programming ⋮ Efficient solutions for a university timetabling problem through integer programming ⋮ School timetabling for quality student and teacher schedules ⋮ A decision support approach to automatic timetabling in higher education institutions ⋮ A MILP model for the teacher assignment problem considering teachers' preferences ⋮ Developing compact course timetables with optimized student flows ⋮ Assignment problems: a golden anniversary survey ⋮ A two-stage decomposition of high school timetabling applied to cases in Denmark ⋮ Variable neighborhood search based algorithms for high school timetabling ⋮ Modelling and planning public cultural schedules for efficient use of resources ⋮ Mathematical models and algorithms for a high school timetabling problem ⋮ A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem ⋮ A mixed-integer mathematical modeling approach to exam timetabling ⋮ A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations ⋮ A computational study of a cutting plane algorithm for university course timetabling ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ Generating class schedules within a complex modular environment with application to secondary schools ⋮ Hybrid particle swarm optimization for pure integer linear solid transportation problem ⋮ A matheuristic for customized multi-level multi-criteria university timetabling ⋮ The maximum-impact coloring polytope ⋮ Computational models for timetabling problem ⋮ Unnamed Item ⋮ Linear integer model for the course timetabling problem of a faculty in Rio de Janeiro ⋮ Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables ⋮ A survey of metaheuristic-based techniques for university timetabling problems ⋮ A university-timetabling problem and its solution using Benders' partitioning---a case study ⋮ Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results ⋮ A branch-and-cut procedure for the Udine course timetabling problem ⋮ Curriculum based course timetabling: new solutions to Udine benchmark instances ⋮ Strong bounds with cut and column generation for class-teacher timetabling ⋮ A heuristic method for solving integer-valued decompositional multiindex problems ⋮ Facet-generating procedures for the maximum-impact coloring polytope ⋮ Facet-generating procedures for the maximum-impact coloring polytope ⋮ Application of a real-world university-course timetabling model solved by integer programming ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem ⋮ An overview of curriculum-based course timetabling ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences
Cites Work
- Unnamed Item
- Unnamed Item
- An introduction to timetabling
- Timetabling problem for university as assignment of activities to resources
- A large scale timetabling problem
- Finding a feasible course schedule using Tabu search
- Computerised decision aid for timetabling --- a case analysis
- A logic approach to the resolution of constraints in timetabling
- The combinatorics of timetabling
- The teacher assignment problem: A special case of the fixed charge transportation problem
- Distribution requirements and compactness constraints in school timetabling
- A tabu search algorithm for computing an operational timetable
- A multi-objective course scheduling model: Combining faculty preferences for courses and times.
- Combinatorial Optimization Problems with Soft and Hard Requirements
- A linear algorithm for computing the optimum university timetable
- School Timetabling—A Case in Large Binary Integer Linear Programming
- University timetabling by constraint-based reasoning: A case study
- Timetabling for Greek high schools
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Implementation of a university course and examination timetabling system
This page was built for publication: An integer programming formulation for a case study in university timetabling.
