An indirect genetic algorithm for a nurse-scheduling problem

From MaRDI portal
Revision as of 18:13, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1433170

DOI10.1016/S0305-0548(03)00034-0zbMath1048.90102OpenAlexW3125132395MaRDI QIDQ1433170

Uwe Aickelin, Kathryn A. Dowsland

Publication date: 15 June 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00034-0




Related Items (36)

A grasp-knapsack hybrid for a nurse-scheduling problemWorkforce planning incorporating skills: state of the artElitist genetic algorithm for assignment problem with imprecise goalA two-stage heuristic approach for nurse scheduling problem: a case study in an emergency departmentA particle swarm optimization approach with refinement procedure for nurse rostering problemCyclic preference scheduling of nurses using a Lagrangian-based heuristicA column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtimeTwo stage decision making approach for Sensor Mission Assignment ProblemA heuristic algorithm for the hospital health examination scheduling problemNurse rostering problems -- a bibliographic survey.An ACO algorithm for a dynamic regional nurse-scheduling problem in AustriaA genetic algorithm approach to a nurse rerostering problemA shift sequence based approach for nurse scheduling and a new benchmark datasetModelling a nurse shift schedule with multiple preference ranks for shifts and days-offPhysician Staffing for Emergency Departments with Time-Varying DemandSolving shift scheduling problem with days-off preference for power station workers using binary integer goal programming modelA generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problemComparison and hybridization of crossover operators for the nurse scheduling problemSolving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristicStaff assignment with lexicographically ordered acceptance levelsTowards a practical engineering tool for rosteringSolving the multi-objective nurse scheduling problem with a weighted cost functionAn estimation of distribution algorithm for nurse schedulingFinding good nurse duty schedules: a case studyA hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problemsAn evolutionary approach to rehabilitation patient scheduling: A case studyA Pareto-based search methodology for multi-objective nurse schedulingNurse scheduling using fuzzy modeling approachA three-stage mixed integer programming approach for optimizing the skill mix and training schedules for aircraft maintenanceStochastic programming for nurse assignmentOn the characterization and generation of nurse scheduling problem instancesA shift scheduling model for employees with different seniority levels and an application in healthcareExploring further advantages in an alternative formulation for the set covering problemA branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problemA hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problemsUsing tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems



Cites Work


This page was built for publication: An indirect genetic algorithm for a nurse-scheduling problem