A novel approach for nurse rerostering based on a parallel algorithm

DOI10.1016/j.ejor.2015.11.022zbMath1346.90468OpenAlexW2183312259WikidataQ56484357 ScholiaQ56484357MaRDI QIDQ322731

Přemysl Šucha, Jan Dvořák, Zdeněk Bäumelt, Zdeněk Hanzálek

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.11.022

zbMATH Keywords

homogeneous/heterogeneous modellist-based heuristicnurse rerostering problemparallel/GPU algorithmpersonnel/human resources rescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Theory of organizations, manpower planning in operations research (90B70)

Related Items (4)

Fair shift change penalization scheme for nurse rescheduling problems ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ The nurse rerostering problem: strategies for reconstructing disrupted schedules ⋮ Nurse scheduling with quick-response methods: improving hospital performance, nurse workload, and patient experience

Uses Software

• CUDA

Cites Work

• Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
• An evolutionary approach for the nurse rerostering problem
• Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic
• Nurse rostering problems -- a bibliographic survey.
• Solving knapsack problems on GPU
• Personnel scheduling: a literature review
• A genetic algorithm approach to a nurse rerostering problem

This page was built for publication: A novel approach for nurse rerostering based on a parallel algorithm