A greedy-based neighborhood search approach to a nurse rostering problem.
From MaRDI portal
Publication:1417481
DOI10.1016/S0377-2217(03)00096-1zbMath1053.90090MaRDI QIDQ1417481
F. Bellanti, Roberto Tadei, Giuliana Carello, Frederico Della Croce
Publication date: 5 January 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Operations research and management science (90B99)
Related Items
A grasp-knapsack hybrid for a nurse-scheduling problem, Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport, A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department, Complexity results for the basic residency scheduling problem, An optimal decision-making approach for the management of radiotherapy patients, A variable neighborhood search based matheuristic for nurse rostering problems, Nurse rostering at a Danish ward, A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem, A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem, Solving the multi-objective nurse scheduling problem with a weighted cost function, An estimation of distribution algorithm for nurse scheduling, A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem, Finding good nurse duty schedules: a case study, Local search neighbourhoods for dealing with a novel nurse rostering model, A comparison of two approaches to nurse rostering problems, Workforce planning in a lotsizing mail processing problem, New approaches to nurse rostering benchmark instances, Minimizing shifts for personnel task scheduling problems: a three-phase algorithm, On the characterization and generation of nurse scheduling problem instances
Cites Work
- An introduction to timetabling
- The combinatorics of timetabling
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- Nurse scheduling with tabu search and strategic oscillation
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- Tabu Search—Part I
- Tabu Search—Part II
- Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach
- Nurse Scheduling Using Mathematical Programming
