Integer programming for minimal perturbation problems in university course timetabling

DOI10.1007/S10479-015-2094-ZMaRDI QIDQ2398425zbMATH OpenOpenAlexFDO

Authors Antony E. Phillips, Cameron G. Walker, Matthias Ehrgott, David M. Ryan

Publication date 16 August 2017

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://eprints.lancs.ac.uk/id/eprint/77963/4/Phillips_MinPertFinalSubmitted.pdf

zbMATH Keywords

decision support systemsinteger programmingminimal perturbation problemsuniversity course timetabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• A computational approach to enhancing course timetabling with integer programming
• Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
• Quality recovering of university timetables
• An integer programming formulation for a case study in university timetabling.
• A 0-1 integer programming approach to a university timetabling problem

Cites work

• Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
• Bridging the gap between self schedules and feasible schedules in staff scheduling
• Hybrid search for minimal perturbation in dynamic CSPs
• Integer programming for minimal perturbation problems in university course timetabling
• Integer programming methods for large-scale practical classroom assignment problems
• Penalising patterns in timetables: novel integer programming formulations
• Probe backtrack search for minimal perturbation in dynamic scheduling
• The train driver recovery problem-a set partitioning based model and solution method
• Towards improving the utilization of university teaching space

Cited in

(14)

• Application of a real-world university-course timetabling model solved by integer programming
• Exact lexicographic scheduling and approximate rescheduling
• Robust university course timetabling problem subject to single and multiple disruptions
• A computational approach to enhancing course timetabling with integer programming
• Integer programming for minimal perturbation problems in university course timetabling
• Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
• An integer programming model for assigning students to elective courses
• Integer programming methods for large-scale practical classroom assignment problems
• Hybrid search for minimal perturbation in dynamic CSPs
• Quality recovering of university timetables
• On the computation of robust examination timetables: methods and experimental results
• A matheuristic for complex pricing problems: an application to rentable resources
• University course timetabling with multi-section courses, room stability and lecturer preferences: an application in a business school
• Curriculum-based university course timetabling considering individual course of studies

This page was built for publication: Integer programming for minimal perturbation problems in university course timetabling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398425)