Integer programming methods for large-scale practical classroom assignment problems
From MaRDI portal
Publication:337258
DOI10.1016/j.cor.2014.07.012zbMath1348.90300OpenAlexW1986747979MaRDI QIDQ337258
Antony E. Phillips, Hamish Waterer, Matthias Ehrgott, David M. Ryan
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/75294/1/roomAssignmentv13.pdf
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Related Items (12)
Developing compact course timetables with optimized student flows ⋮ Genetic based discrete particle swarm optimization for elderly day care center timetabling ⋮ Integer programming for minimal perturbation problems in university course timetabling ⋮ A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning ⋮ Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ The maximum-impact coloring polytope ⋮ Quality recovering of university timetables ⋮ An assignment problem and its application in education domain: a review and potential path ⋮ Facet-generating procedures for the maximum-impact coloring polytope ⋮ Comments on: ``An overview of curriculum-based course timetabling ⋮ An overview of curriculum-based course timetabling
Uses Software
Cites Work
- Unnamed Item
- A computational study of a cutting plane algorithm for university course timetabling
- Application of a real-world university-course timetabling model solved by integer programming
- Decomposition, reformulation, and diving in university course timetabling
- On the integer properties of scheduling set partitioning models
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- ITC2007 solver description: a hybrid approach
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Towards improving the utilization of university teaching space
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- When Is the Classroom Assignment Problem Hard?
- A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies
- Multicriteria Optimization
- Balanced matrices
- Timetabling problems at the TU Eindhoven
This page was built for publication: Integer programming methods for large-scale practical classroom assignment problems
