Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
From MaRDI portal
Publication:1579122
DOI<139::AID-JOS41>3.0.CO;2-2 10.1002/(SICI)1099-1425(200005/06)3:3<139::AID-JOS41>3.0.CO;2-2zbMath0965.90019OpenAlexW3103464856MaRDI QIDQ1579122
Uwe Aickelin, Kathryn A. Dowsland
Publication date: 5 August 2001
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(200005/06)3:3<139::aid-jos41>3.0.co;2-2
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (33)
Near-optimal MIP solutions for preference based self-scheduling ⋮ A grasp-knapsack hybrid for a nurse-scheduling problem ⋮ A hybrid metaheuristic case-based reasoning system for nurse rostering ⋮ A decision support system for cyclic master surgery scheduling with multiple objectives ⋮ Team-building with answer set programming in the Gioia-Tauro seaport ⋮ A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department ⋮ A particle swarm optimization approach with refinement procedure for nurse rostering problem ⋮ Accelerating the branch-and-price algorithm using machine learning ⋮ Cyclic preference scheduling of nurses using a Lagrangian-based heuristic ⋮ A variable neighborhood search algorithm for the multimode set covering problem ⋮ An evolutionary approach for the nurse rerostering problem ⋮ Scheduling trainees at a hospital department using a branch-and-price approach ⋮ Nurse rostering problems -- a bibliographic survey. ⋮ An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria ⋮ Analysis of three mathematical models of the staff rostering problem ⋮ Staff scheduling and rostering: a review of applications, methods and models. ⋮ A greedy-based neighborhood search approach to a nurse rostering problem. ⋮ A shift sequence based approach for nurse scheduling and a new benchmark dataset ⋮ Bridging the gap between self schedules and feasible schedules in staff scheduling ⋮ An indirect genetic algorithm for a nurse-scheduling problem ⋮ Simulated annealing approach to nurse rostering benchmark and real-world instances ⋮ What makes a VRP solution good? The generation of problem-specific knowledge for heuristics ⋮ Comparison and hybridization of crossover operators for the nurse scheduling problem ⋮ Staff assignment with lexicographically ordered acceptance levels ⋮ An estimation of distribution algorithm for nurse scheduling ⋮ A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem ⋮ A Pareto-based search methodology for multi-objective nurse scheduling ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ Unnamed Item ⋮ A hybrid scatter search heuristic for personalized crew rostering in the airline industry ⋮ Shift rostering using decomposition: assign weekend shifts first ⋮ On the characterization and generation of nurse scheduling problem instances ⋮ A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
Cites Work
This page was built for publication: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
