Efficient solutions for a university timetabling problem through integer programming
From MaRDI portal
(Redirected from Publication:1887870)
Recommendations
- A computational approach to enhancing course timetabling with integer programming
- An integer programming formulation for a case study in university timetabling.
- Application of a real-world university-course timetabling model solved by integer programming
- School Timetabling—A Case in Large Binary Integer Linear Programming
- A 0-1 integer programming approach to a university timetabling problem
Cites work
- scientific article; zbMATH DE number 1728529 (Why is no real title available?)
- scientific article; zbMATH DE number 1728530 (Why is no real title available?)
- scientific article; zbMATH DE number 1728531 (Why is no real title available?)
- scientific article; zbMATH DE number 1729253 (Why is no real title available?)
- A logic approach to the resolution of constraints in timetabling
- A multi-objective course scheduling model: Combining faculty preferences for courses and times.
- A tabu search algorithm for computing an operational timetable
- An integer programming formulation for a case study in university timetabling.
- An introduction to timetabling
- Computerised decision aid for timetabling --- a case analysis
- Distribution requirements and compactness constraints in school timetabling
- Finding a feasible course schedule using Tabu search
- Implementation of a university course and examination timetabling system
- School Timetabling—A Case in Large Binary Integer Linear Programming
- The combinatorics of timetabling
- Timetabling for Greek high schools
- University timetabling by constraint-based reasoning: A case study
Cited in
(37)- Optimization of the integrated problem of employee timetabling and job shop scheduling
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
- A column generation mathematical programming approach for a class-faculty assignment problem with preferences
- On a conjecture for the university timetabling problem
- An integer programming formulation for a case study in university timetabling.
- Integer programming techniques for educational timetabling
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
- A computational approach to enhancing course timetabling with integer programming
- A mixed-integer mathematical modeling approach to exam timetabling
- A two-stage decomposition of high school timetabling applied to cases in Denmark
- A decomposed metaheuristic approach for a real-world university timetabling problem
- School timetabling for quality student and teacher schedules
- An overview of curriculum-based course timetabling
- Exact and metaheuristic methods for a real-world examination timetabling problem
- A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems
- Application of a real-world university-course timetabling model solved by integer programming
- A decision support approach to automatic timetabling in higher education institutions
- Polynomial reduction of time-space scheduling to time scheduling
- School Timetabling—A Case in Large Binary Integer Linear Programming
- Decomposition, reformulation, and diving in university course timetabling
- An integer program and a hybrid genetic algorithm for the university timetabling problem
- Answer set programming as a modeling language for course timetabling
- Improving paper spread in examination timetables using integer programming
- A MILP model for the teacher assignment problem considering teachers' preferences
- A matheuristic for customized multi-level multi-criteria university timetabling
- Term-end exam scheduling at United States Military Academy/West Point
- Timetabling problems at the TU Eindhoven
- A new adjustment of the branch and price algorithm for university course timetabling
- Mathematical models and algorithms for a high school timetabling problem
- A university-timetabling problem and its solution using Benders' partitioning---a case study
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
- Computational models for timetabling problem
- A heuristic method to schedule training programs for small and medium enterprises
- Multi-objective faculty course assignment problem based on the double parametric form of fuzzy preferences
- Preference-based assignment of university students to multiple teaching groups
- A branch-and-cut procedure for the Udine course timetabling problem
- Curriculum based course timetabling: new solutions to Udine benchmark instances
This page was built for publication: Efficient solutions for a university timetabling problem through integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887870)
