Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds

DOI10.1016/j.ejor.2020.11.017zbMath1487.90272OpenAlexW3102401085MaRDI QIDQ2030469

Pieter Smet, Elín Björk Böðvarsdóttir, Thomas J. R. Stidsen, Greet vanden Berghe

Publication date: 7 June 2021

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

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

zbMATH Keywords

multi-objective optimizationtimetablingnurse rosteringcompromise solutionslexicographic goal programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Fast, flexible MUS enumeration
• Polynomially solvable personnel rostering problems
• Multiobjective optimization. Interactive and evolutionary approaches
• Staff assignment with lexicographically ordered acceptance levels
• A Pareto-based search methodology for multi-objective nurse scheduling
• A comparison of two approaches to nurse rostering problems
• Personnel scheduling: a literature review
• The state of the art of nurse rostering
• Local and global constraint consistency in personnel rostering

This page was built for publication: Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds