Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
From MaRDI portal
Publication:880573
DOI10.1007/s10951-006-0323-7zbMath1154.90410OpenAlexW2102377323MaRDI QIDQ880573
Hadi W. Purnomo, Jonathan F. Bard
Publication date: 15 May 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-006-0323-7
Related Items
A particle swarm optimization approach with refinement procedure for nurse rostering problem ⋮ A General Branch-and-Cut Framework for Rotating Workforce Scheduling ⋮ Fair optimization of fortnightly physician schedules with flexible shifts ⋮ A shift sequence based approach for nurse scheduling and a new benchmark dataset ⋮ A stochastic optimization approach to shift scheduling with breaks adjustments ⋮ A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem ⋮ Finding good nurse duty schedules: a case study ⋮ A Pareto-based search methodology for multi-objective nurse scheduling ⋮ Local search neighbourhoods for dealing with a novel nurse rostering model ⋮ A comparison of two approaches to nurse rostering problems ⋮ Shift rostering using decomposition: assign weekend shifts first ⋮ A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm ⋮ A cubic chromosome representation for patient scheduling in the Emergency Department ⋮ A shift scheduling model for employees with different seniority levels and an application in healthcare
Cites Work
- Unnamed Item
- Unnamed Item
- An implicit tour scheduling model with applications in healthcare
- An implicit goal programming model for the tour scheduling problem considering the employee work preferences
- Cyclic and non-cyclic scheduling of 12h shift nurses by network programming
- A generalized linear programming model for nurse scheduling
- Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
- Staff scheduling and rostering: a review of applications, methods and models.
- Models and algorithms for a staff scheduling problem
- An indirect genetic algorithm for a nurse-scheduling problem
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- Nurse scheduling with tabu search and strategic oscillation
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- Generalized assignment type goal programming problem: application to nurse scheduling
- On the complexity of manpower shift scheduling
- Preference scheduling for nurses using column generation
- The state of the art of nurse rostering
- Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach
- Nurse Scheduling Using Mathematical Programming
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A Heuristic Method for the Set Covering Problem
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- A memetic approach to the nurse rostering problem
