Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
From MaRDI portal
Publication:1730745
DOI10.1007/s10479-017-2646-5zbMath1434.90055OpenAlexW2765899991MaRDI QIDQ1730745
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2646-5
Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding robust timetables for project presentations of student teams
- A fix-and-optimize heuristic for the high school timetabling problem
- A variable neighborhood search based matheuristic for nurse rostering problems
- The design and implementation of an interactive course-timetabling system
- A short-turning policy for the management of demand disruptions in rapid transit systems
- A multiobjective framework for heavily constrained examination timetabling problems
- A robust approach for the single machine scheduling problem
- On operators and search space topology in multi-objective flow shop scheduling
- Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
- A Pareto-based search methodology for multi-objective nurse scheduling
- Flight gate scheduling with respect to a reference schedule
- A comparison of two approaches to nurse rostering problems
- An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007
- Variants of simulated annealing for the examination timetabling problem
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- A multi-stage IP-based heuristic for class timetabling and trainer rostering
- A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty
- Solving the multi-objective nurse scheduling problem with a weighted cost function
- An overview of population-based algorithms for multi-objective optimisation
- Matheuristics
This page was built for publication: Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
