Robust university course timetabling problem subject to single and multiple disruptions

DOI10.1016/j.ejor.2019.11.024zbMath1431.90066OpenAlexW2991295123MaRDI QIDQ2286982

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

robustnesssimulated annealingtimetablingstochastic combinatorial optimizationbi-criteria optimization

Mathematics Subject Classification ID

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

Related Items (2)

Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions ⋮ A multi-objective mixed integer linear programming model for thesis defence scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
• Automated scheduling and planning. From theory to practice
• A survey of school timetabling research
• Quality recovering of university timetables
• A multi-objective evolutionary algorithm for examination timetabling
• Hybrid variable neighbourhood approaches to university exam timetabling
• A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
• A provably convergent heuristic for stochastic bicriteria integer programming
• Integer programming for minimal perturbation problems in university course timetabling
• A survey of metaheuristic-based techniques for university timetabling problems
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization
• A survey of simulated annealing as a tool for single and multiobjective optimization
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Stochastic Algorithms: Foundations and Applications

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