A grasp-knapsack hybrid for a nurse-scheduling problem
DOI10.1007/S10732-007-9066-7zbMATH Open1180.90119OpenAlexW2123388811MaRDI QIDQ835758FDOQ835758
Authors: Melissa D. Goodman, K. Dowsland, J. Thompson 
Publication date: 31 August 2009
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-007-9066-7
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- A generalized linear programming model for nurse scheduling
- Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
- Nurse rostering problems -- a bibliographic survey.
- Staff scheduling and rostering: a review of applications, methods and models.
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- Nurse scheduling with tabu search and strategic oscillation
- A genetic algorithm approach to a nurse rerostering problem
- The state of the art of nurse rostering
- Solving the multi-objective nurse scheduling problem with a weighted cost function
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- Title not available (Why is that?)
- An implicit tour scheduling model with applications in healthcare
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Variants of simulated annealing for the examination timetabling problem
- An indirect genetic algorithm for a nurse-scheduling problem
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
- Crane scheduling with non-crossing constraint
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- A GRASP for coloring sparse graphs
- Distribution requirements and compactness constraints in school timetabling
- A greedy-based neighborhood search approach to a nurse rostering problem.
- Solving a nurse scheduling problem with knapsacks, networks and tabu search
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- A memetic approach to the nurse rostering problem
- An estimation of distribution algorithm for nurse scheduling
- A grasp for job shop scheduling
- Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies
Cited In (8)
- Solving a nurse scheduling problem with knapsacks, networks and tabu search
- A stochastic integer programming approach to reserve staff scheduling with preferences
- Workforce planning incorporating skills: state of the art
- Nurse rostering at a Danish ward
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Title not available (Why is that?)
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
- On the characterization and generation of nurse scheduling problem instances
Uses Software
This page was built for publication: A grasp-knapsack hybrid for a nurse-scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835758)
