An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
From MaRDI portal
Publication:3518803
DOI10.1057/palgrave.jors.2602308zbMath1145.90377OpenAlexW2109694902MaRDI QIDQ3518803
Uwe Aickelin, Jingpeng Li, Edmund Kieran Burke
Publication date: 12 August 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/655/
Related Items (12)
Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling ⋮ A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department ⋮ EA/G-GA for single machine scheduling problems with earliness/tardiness costs ⋮ Hybridizing evolutionary algorithms with variable-depth search to overcome local optima ⋮ Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model ⋮ Finding good nurse duty schedules: a case study ⋮ A self-guided genetic algorithm for permutation flowshop scheduling problems ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates ⋮ Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems ⋮ A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem ⋮ On the characterization and generation of nurse scheduling problem instances ⋮ The impact of parametrization in memetic evolutionary algorithms
This page was built for publication: An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering