Robust university course timetabling problem subject to single and multiple disruptions

DOI10.1016/J.EJOR.2019.11.024MaRDI QIDQ2286982zbMATH OpenOpenAlexFDO

Authors Ayla Gülcü, Can Akkan

Publication date 23 January 2020

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2019.11.024

zbMATH Keywords

bi-criteria optimizationrobustnesssimulated annealingstochastic combinatorial optimizationtimetabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
• Quality recovering of university timetables
• A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
• Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
• Integer programming for minimal perturbation problems in university course timetabling

Cites work

• A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
• A multi-objective evolutionary algorithm for examination timetabling
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• A provably convergent heuristic for stochastic bicriteria integer programming
• A simulated annealing algorithm with constant temperature for discrete stochastic optimization
• A survey of metaheuristic-based techniques for university timetabling problems
• A survey of school timetabling research
• A survey of simulated annealing as a tool for single and multiobjective optimization
• Automated scheduling and planning. From theory to practice
• Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
• scientific article; zbMATH DE number 5829047 (Why is no real title available?)
• scientific article; zbMATH DE number 721857 (Why is no real title available?)
• scientific article; zbMATH DE number 1086965 (Why is no real title available?)
• Hybrid variable neighbourhood approaches to university exam timetabling
• Integer programming for minimal perturbation problems in university course timetabling
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Quality recovering of university timetables
• Setting the research agenda in automated timetabling: the second international timetabling competition
• Stochastic Algorithms: Foundations and Applications
• The sample average approximation method for stochastic discrete optimization

Cited in

(6)

• Fuzzy robust courses scheduling problem
• Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
• Finding robust timetables for project presentations of student teams
• A multi-objective mixed integer linear programming model for thesis defence scheduling
• Quality recovering of university timetables
• Educational timetabling problem with teaching load assignment using preferences and compactness

This page was built for publication: Robust university course timetabling problem subject to single and multiple disruptions

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