An estimation of distribution algorithm for nurse scheduling
From MaRDI portal
Publication:2468746
DOI10.1007/s10479-007-0214-0zbMath1145.90031OpenAlexW3104933531MaRDI QIDQ2468746
Publication date: 25 January 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/568/1/07annals_eda.pdf
Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)
Related Items
A grasp-knapsack hybrid for a nurse-scheduling problem ⋮ A hybrid metaheuristic case-based reasoning system for nurse rostering ⋮ Predicting pediatric clinic no-shows: a decision analytic framework using elastic net and Bayesian belief network ⋮ A shift sequence based approach for nurse scheduling and a new benchmark dataset ⋮ Local search neighbourhoods for dealing with a novel nurse rostering model ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates ⋮ A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Building better nurse scheduling algorithms
- Nurse rostering problems -- a bibliographic survey.
- A greedy-based neighborhood search approach to a nurse rostering problem.
- An indirect genetic algorithm for a nurse-scheduling problem
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- The state of the art of nurse rostering
- Solving a nurse scheduling problem with knapsacks, networks and tabu search
- Introduction to Graphical Modelling
- An indirect genetic algorithm for set covering problems
- A memetic approach to the nurse rostering problem
