A computational approach to enhancing course timetabling with integer programming
From MaRDI portal
Publication:2369205
DOI10.1016/J.AMC.2005.07.039zbMATH Open1092.90025OpenAlexW2062660149MaRDI QIDQ2369205FDOQ2369205
Authors: S. A. MirHassani 
Publication date: 28 April 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.07.039
Recommendations
- New integer linear programming approaches for course timetabling
- An integer programming approach to curriculum-based examination timetabling
- Application of a real-world university-course timetabling model solved by integer programming
- Integer programming for minimal perturbation problems in university course timetabling
- Efficient solutions for a university timetabling problem through integer programming
- Integer programming techniques for educational timetabling
- An integer programming formulation for a case study in university timetabling.
- The multiphase course timetabling problem
Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Boolean programming (90C09)
Cites Work
- Applied simulated annealing
- Tabu search for large scale timetabling problems
- An integer programming formulation for a case study in university timetabling.
- A column generation approach for the timetabling problem of Greek high schools
- A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies
- Constructing Good Solutions for the Spanish School Timetabling Problem
- School Timetabling—A Case in Large Binary Integer Linear Programming
- An overview of heuristic solution methods
- Matrix reduction using the Hungarian method for the generation of school timetables
Cited In (29)
- Integer programming for minimal perturbation problems in university course timetabling
- A university-timetabling problem and its solution using Benders' partitioning---a case study
- New integer linear programming approaches for course timetabling
- An overview of curriculum-based course timetabling
- An integer program and a hybrid genetic algorithm for the university timetabling problem
- Improving paper spread in examination timetables using integer programming
- School Timetabling—A Case in Large Binary Integer Linear Programming
- A column generation mathematical programming approach for a class-faculty assignment problem with preferences
- A two-stage decomposition of high school timetabling applied to cases in Denmark
- An integer programming model for assigning students to elective courses
- A branch-and-cut procedure for the Udine course timetabling problem
- Implementation of a university course and examination timetabling system
- Computational models for timetabling problem
- Optimal block design models for course timetabling
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
- A 0-1 integer programming approach to a university timetabling problem
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
- Application of a real-world university-course timetabling model solved by integer programming
- Decomposition, reformulation, and diving in university course timetabling
- Timetabling problems at the TU Eindhoven
- An automated university course timetabling system developed in a distributed environment: a case study.
- An integer programming formulation for a case study in university timetabling.
- A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems
- Integer programming for the generalized high school timetabling problem
- Efficient solutions for a university timetabling problem through integer programming
- Mixed integer linear programming models for university timetabling and its application
- A timetabling system for scheduling courses of statistics and data science: methodology and case study
- Integer programming techniques for educational timetabling
- Penalising patterns in timetables: novel integer programming formulations
This page was built for publication: A computational approach to enhancing course timetabling with integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369205)
