A particle swarm optimization approach with refinement procedure for nurse rostering problem

DOI10.1016/J.COR.2014.08.016zbMATH Open1348.90659OpenAlexW2007328050MaRDI QIDQ337337FDOQ337337

Authors: Tai-Hsi Wu, Jinn-Yi Yeh, Yueh-Min Lee 

Publication date: 10 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2014.08.016

Recommendations

• The state of the art of nurse rostering
• Variable neighborhood search accelerated column generation for the nurse rostering problem
• The nurse rostering problem: a critical appraisal of the problem structure
• Nurse rostering problems -- a bibliographic survey.
• A systematic two phase approach for the nurse rostering problem

zbMATH Keywords

particle swarm optimizationnurse rostering problemPSOworkstretch pattern

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Cites Work

• The nurse rostering problem: a critical appraisal of the problem structure
• A generalized linear programming model for nurse scheduling
• Nurse rostering problems -- a bibliographic survey.
• Staff scheduling and rostering: a review of applications, methods and models.
• Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
• Nurse scheduling with tabu search and strategic oscillation
• A 0-1 goal programming model for nurse scheduling
• Preference scheduling for nurses using column generation
• The state of the art of nurse rostering
• A systematic two phase approach for the nurse rostering problem
• An indirect genetic algorithm for a nurse-scheduling problem
• An integer multicommodity flow model applied to the rerostering of nurse schedules
• Building better nurse scheduling algorithms
• Generalized assignment type goal programming problem: application to nurse scheduling
• A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
• Solving a nurse scheduling problem with knapsacks, networks and tabu search
• A memetic approach to the nurse rostering problem
• A discrete version of particle swarm optimization for flowshop scheduling problems
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• Cyclic preference scheduling of nurses using a Lagrangian-based heuristic

Cited In (5)

• Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak
• On a timetabling problem in the health care system
• A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
• First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem
• A variable neighborhood search algorithm for an integrated physician planning and scheduling problem

This page was built for publication: A particle swarm optimization approach with refinement procedure for nurse rostering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337337)