Finding good nurse duty schedules: a case study
TL;DR: The problem of constructing duty schedules for nurses at large hospitals is solved using a tabu search approach as a case study at Stikland Hospital, a large psychiatric hospital in the South African Western Cape, for which a computerized decision support system with respect to nurse scheduling was developed.
Abstract: Constructing duty schedules for nurses at large hospitals is a difficult problem. The objective is usually to ensure that there is always sufficient staff on duty, while taking into account individual preferences with respect to work patterns, requests for leave and financial restrictions, in such a way that all employees are treated fairly. The problem is typically solved via mixed integer programming or heuristic (local) search methods in the operations research literature. In this paper the problem is solved using a tabu search approach as a case study at Stikland Hospital, a large psychiatric hospital in the South African Western Cape, for which a computerized decision support system with respect to nurse scheduling was developed. This decision support system, called NuRoDSS (short for Nurse Rostering Decision Support System) is described in some detail.
Citations
More filters
TL;DR: This paper presents a review of the literature on personnel scheduling problems and discusses the classification methods in former review papers, and evaluates the literature in the many fields that are related to either the problem setting or the technical features.
706 citations
TL;DR: A comprehensive overview of the typical decisions to be made in resource capacity planning and control in health care, and a structured review of relevant articles from the field of Operations Research and Management Sciences (OR/MS) for each planning decision.
Abstract: We provide a comprehensive overview of the typical decisions to be made in resource capacity planning and control in health care, and a structured review of relevant articles from the field of Operations Research and Management Sciences (OR/MS) for each planning decision. The contribution of this paper is twofold. First, to position the planning decisions, a taxonomy is presented. This taxonomy provides health care managers and OR/MS researchers with a method to identify, break down and classify planning and control decisions. Second, following the taxonomy, for six health care services, we provide an exhaustive specification of planning and control decisions in resource capacity planning and control. For each planning and control decision, we structurally review the key OR/MS articles and the OR/MS methods and techniques that are applied in the literature to support decision making.
357 citations
TL;DR: This paper surveys several applications of Operations Research in the domain of Healthcare and highlights current research activities, focusing on a variety of optimisation problems as well as solution techniques used for solving the Optimisation problems.
339 citations
Cites background from "Finding good nurse duty schedules: ..."
...Operating room scheduling is discussed in Blake et al. (2002) and Blake and Donald (2002), among others....
[...]
...…found as follows: Evolutionary Algorithms in Aickelin et al. (2007), Aickelin and Dowsland (2004) and Aickelin and Dowsland (2000); Tabu Search in Bester et al. (2007), Ikegami and Niwa (2003), Dowsland and Thompson (2000) and Dowsland (1998); Scatter Search in Burke et al. (2010) and Ant Colony…...
[...]
TL;DR: A review and classification of the literature regarding workforce planning problems incorporating skills to present a combination of technical and managerial knowledge to encourage the production of more realistic and useful solution techniques.
Abstract: This paper presents a review and classification of the literature regarding workforce planning problems incorporating skills. In many cases, technical research regarding workforce planning focuses very hard on the mathematical model and neglects the real life implications of the simplifications that were needed for the model to perform well. On the other hand, many managerial studies give an extensive description of the human implications of certain management decisions in particular cases, but fail to provide useful mathematical models to solve workforce planning problems. This review will guide the operations researcher in his search to find useful papers and information regarding workforce planning problems incorporating skills. We not only discuss the differences and similarities between different papers, but we also give an overview of the managerial insights. The objective is to present a combination of technical and managerial knowledge to encourage the production of more realistic and useful solution techniques.
207 citations
Cites background from "Finding good nurse duty schedules: ..."
...Quality [15, 93, 108, 109] Task restrictions [1, 2, 3, 4, 7, 9, 10, 11, 12, 16, 17, 19, 20, 21, 23, 24, 26, 28, 31, 32, 33, 35, 36, 38, 40, 42, 48, 49, 51, 52, 54, 55, 56, 57, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 77, 80, 81, 83, 84, 85, 88, 89, 91, 92, 94, 97, 99, 100, 102, 103, 104, 105, 107, 111, 114, 115, 121]...
[...]
...89, 91, 94, 100, 102, 105, 111] Nurse grade [1, 2, 3, 9, 10, 11, 16, 17, 21, 24, 26, 31, 32, 38, 65, 68, 70, 88, 92, 104] User definable/undefined [12, 15, 19, 20, 22, 23, 33, 49, 55, 67, 68, 69, 72, 75, 77, 80, 81, 84, 85, 97, 99, 101, 115] Other [21, 54, 66, 93, 110, 121]...
[...]
...Services General [42, 51, 64, 66, 67, 75, 77, 87, 102, 105, 111] Health care [1, 2, 3, 9, 10, 11, 16, 17, 21, 24, 26, 27, 28, 31, 32, 38, 40, 55, 65, 68, 70, 88, 89, 92, 104] Maintenance [37, 56, 71]...
[...]
...Other definitions of Πtw are the time required for worker w to perform task t, the efficiency, the quantity of resources that worker w requires to perform task t, etc....
[...]
...Other researchers even assume that temporary workers have less skills than the permanent workers and therefore entail lower labour costs [37, 43]....
[...]
TL;DR: A review and classification of the literature regarding workforce planning problems incorporating skills is presented in this paper, where the authors present a combination of technical and managerial knowledge to encourage the production of more realistic and useful solution techniques.
202 citations
References
More filters
Book•
01 Jan 1992
TL;DR: GAs and Evolution Programs for Various Discrete Problems, a Hierarchy of Evolution Programs and Heuristics, and Conclusions.
Abstract: 1 GAs: What Are They?.- 2 GAs: How Do They Work?.- 3 GAs: Why Do They Work?.- 4 GAs: Selected Topics.- 5 Binary or Float?.- 6 Fine Local Tuning.- 7 Handling Constraints.- 8 Evolution Strategies and Other Methods.- 9 The Transportation Problem.- 10 The Traveling Salesman Problem.- 11 Evolution Programs for Various Discrete Problems.- 12 Machine Learning.- 13 Evolutionary Programming and Genetic Programming.- 14 A Hierarchy of Evolution Programs.- 15 Evolution Programs and Heuristics.- 16 Conclusions.- Appendix A.- Appendix B.- Appendix C.- Appendix D.- References.
12,212 citations
"Finding good nurse duty schedules: ..." refers background in this paper
...…and Dowsland 2003; Aickelin and White 2004; Beddoe and Petrovic 2006; Burke et al. 2002a; Inoue et al. 1999, 2003; Jan et al. 2000; Kragelund 1997; Michalewics 1996; Moz and Pato 2007), hyper-heuristics (Burke et al. 2003; Cowling et al. 2002), expert systems and artificial intelligence methods…...
[...]
Book•
[...]
TL;DR: This book explores the meta-heuristics approach called tabu search, which is dramatically changing the authors' ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservation and scores of other problems.
Abstract: From the Publisher:
This book explores the meta-heuristics approach called tabu search, which is dramatically changing our ability to solve a hostof problems that stretch over the realms of resource planning,telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics,pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservationand scores of other problems. The major ideas of tabu search arepresented with examples that show their relevance to multipleapplications. Numerous illustrations and diagrams are used to clarifyprinciples that deserve emphasis, and that have not always been wellunderstood or applied. The book's goal is to provide ''hands-on' knowledge and insight alike, rather than to focus exclusively eitheron computational recipes or on abstract themes. This book is designedto be useful and accessible to researchers and practitioners inmanagement science, industrial engineering, economics, and computerscience. It can appropriately be used as a textbook in a masterscourse or in a doctoral seminar. Because of its emphasis on presentingideas through illustrations and diagrams, and on identifyingassociated practical applications, it can also be used as asupplementary text in upper division undergraduate courses.
Finally, there are many more applications of tabu search than canpossibly be covered in a single book, and new ones are emerging everyday. The book's goal is to provide a grounding in the essential ideasof tabu search that will allow readers to create successfulapplications of their own. Along with the essentialideas,understanding of advanced issues is provided, enabling researchers togo beyond today's developments and create the methods of tomorrow.
6,373 citations
Book•
01 Jan 1993TL;DR: In this paper, the Lagrangian relaxation and dual ascent tree search were used to solve the graph bisection problem and the graph partition problem, and the traveling salesman problem scheduling problems.
Abstract: Part 1 Introduction: combinatorial problems local and global optima heuristics. Part 2 Simulated annealing: the basic method enhancements and modifications applications conclusions. Part 3 Tabu search: the tabu framework broader aspects of intensification and diversification tabu search applications connections and conclusions. Part 4 Genetic algorithms: basic concepts a simple example extensions and modifications applications conclusions. Part 5 Artificial neural networks: neural networks combinatorial optimization problems the graph bisection problem the graph partition problem the travelling salesman problem scheduling problems deformable templates inequality constraints, the Knapsack problem summary. Part 6 Lagrangian relaxation: overview basic methodology Lagrangian heuristics and problem reduction determination of Lagrange multipliers dual ascent tree search applications conclusions. Part 7 Evaluation of heuristic performance: analytical methods empirical testing statistical inference conclusions.
2,571 citations
"Finding good nurse duty schedules: ..." refers methods in this paper
...The extensively documented tabu search method (Glover and Laguna 1993) is a heuristic local search procedure whereby a sequence of potential duty schedules is updated iteratively, by repeatedly applying modifications (called moves) to attributes of the previous schedule in the sequence....
[...]
Book•
09 May 1996TL;DR: Genetic algorithms are a probabilistic search approach which are founded on the ideas of evolutionary processes and applicable to many hard optimization problems such as optimization of functions with linear and nonlinear constraints.
Abstract: IN THIS CONTRIBUTION A WAY TO ENHANCE THE PERFORMANCE OF THE CLASSIC GENETIC ALGORITHM IS PROPOSED THE IDEA OF RESTARTING A GENETIC ALGORITHM IS APPLIED IN ORDER TO OBTAIN BETTER KNOWLEDGE OF THE SOLUTION SPACE OF THE PROBLEM' 3 / 12 'PDF Genetic Algorithms In C April 30th, 2020 The Design of Innovation Lessons from and for petent Genetic Algorithms Genetic Algorithms and Evolutionary putation Genetic Algorithms and Genetic Programming in putational Finance Genetic Algorithms Data Structures Evolution Programs An Introduction to Genetic' 'Genetic algorithms data STRUCTURES evolution programs March 24th, 2020 Genetic algorithms data STRUCTURES evolution programs Zbigniew Michalewicz 1996 3rd ed New York Springer pp 387 ISBN 3 540 60676 9 58 00 DM' 'Genetic Algorithms Data Structures Evolution Programs May 1st, 2020 Genetic algorithms are founded upon the principle of evolution i e survival of the fittest Hence evolution programming techniques based on genetic algorithms are applicable to many hard optimization problems such as optimization of functions with linear and nonlinear constraints the traveling salesman problem and problems of scheduling partitioning and control''evolutionary approach for relative gene expression algorithms april 23rd, 2020 a relative expression analysis rxa uses ordering relationships in a small collection of genes and is successfully applied to classiffication using microarray data as checking all possible subsets of genes is putationally infeasible the rxa algorithms require feature selection and multiple restrictive assumptions our main contribution is a specialized evolutionary algorithm ea for top''An Enhanced Algorithm For Multiple Sequence Alignment Of February 6th, 2017 In This Paper An Alignment Method Using Genetic Algorithm For Multiple Sequence Alignment Has Been Proposed Two Different Genetic Operators Mainly Crossover And Mutation Were Defined And Implemented With The 4 / 12 Proposed Method In Order To Know The Population Evolution And Quality Of The Sequence Aligned' 'Fuzzy Evolutionary and Neuro puting April 22nd, 2020 Genetic algorithms and evolution programs Principle of evolution Genetic code Representation Initial population Evaluation function Genetic operators selection crossover and mutation Genetic algorithm parameters Simple GA Schema theorem and building block hypothesis Genetic algorithm in practise Numerical optimisation'' overview of genetic algorithms for the solution of April 21st, 2020 Genetic algorithms are a probabilistic search approach which are founded on the ideas of evolutionary processes The GA procedure is based on the Darwinian principle of survival of the fittest An initial population is created containing a predefined number of individuals or solutions each represented by a genetic string incorporating the variable ' 'gaoptim Function R Documentation March 23rd, 2020 Randy L Haupt Sue Ellen Haupt 2004 Practical Genetic Algorithms 2nd Ed Michalewicz Zbigniew Genetic Algorithms Data Structures Evolution Programs 3rd Ed Luke Sean Department Of Puter Science Gee Mason University Essentials Of Metaheuristics Online Version 1 2 July 2011' 'Anthony Awuley Stack Overflow April 13th, 2020 Introduction to Algorithms 3rd Edition MIT Press Thomas H Cormen Charles E Leiserson Ronald L Rivest Clifford Stein Data Structures and the Standard Template Library William Collins Genetic Algorithms Data Structures Evolution Programs Zbigniew Michalewicz A Field Guide to Genetic Programming'
1,433 citations
TL;DR: A review of staff scheduling and rostering, an area that has become increasingly important as business becomes more service oriented and cost conscious in a global environment, and the models and algorithms that have been reported in the literature for their solution.
1,238 citations