Solving the multi-objective nurse scheduling problem with a weighted cost function

DOI10.1007/s10479-007-0202-4zbMath1145.90026OpenAlexW2089131234MaRDI QIDQ2468745

D. Parr, Jonathan M. Thompson

Publication date: 25 January 2008

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

Full work available at URL: https://doi.org/10.1007/s10479-007-0202-4

zbMATH Keywords

simulated annealingmeta-heuristicnurse schedulingnoisingsawing

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) Manpower systems in sociology (91D35) Theory of organizations, manpower planning in operations research (90B70)

Related Items (13)

An assessment of a days off decomposition approach to personnel shift scheduling ⋮ A grasp-knapsack hybrid for a nurse-scheduling problem ⋮ A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department ⋮ Optimization in dubbing scheduling ⋮ Practical statistical methods for call centres with a case study addressing urgent medical care delivery ⋮ Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure ⋮ A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem ⋮ Staff assignment with lexicographically ordered acceptance levels ⋮ Finding good nurse duty schedules: a case study ⋮ A comparison of two approaches to nurse rostering problems ⋮ A scenario-based robust optimization with a pessimistic approach for nurse rostering problem ⋮ A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management ⋮ On the characterization and generation of nurse scheduling problem instances

Cites Work

• Optimization by Simulated Annealing
• Some experiments with simulated annealing techniques for packing problems
• The noising method: A new method for combinatorial optimization
• A greedy-based neighborhood search approach to a nurse rostering problem.
• An indirect genetic algorithm for a nurse-scheduling problem
• Nurse scheduling with tabu search and strategic oscillation
• Variants of simulated annealing for the examination timetabling problem
• The state of the art of nurse rostering
• Solving a nurse scheduling problem with knapsacks, networks and tabu search
• Convergence of an annealing algorithm
• Tabu Search—Part I
• Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements
• Workforce Scheduling with Cyclic Demands and Day-Off Constraints
• The noising methods: A generalization of some metaheuristics

This page was built for publication: Solving the multi-objective nurse scheduling problem with a weighted cost function