Nurse rostering problems––a bibliographic survey
TL;DR: A brief overview, in the form of a bibliographic survey, of the many models and methodologies available to solve the nurse rostering problem is presented.
read more
About: This article is published in European Journal of Operational Research. The article was published on 16 Dec 2003. and is currently open access.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
PointFix: Learning from fixing individual condition violations
Ulas Bardak,Seiya Hasegawa,Takayuki Saito +2 more
- 15 May 2009
TL;DR: An algorithm that can be added to a scheduling system for fixing selected violations and a method for exploiting users' interactions with this algorithm for automatically tuning the importances of conditions in an existing nurse rostering system, leading to better rosters.
On the Multi-objective Nature of Nurse Scheduling
Edmund K. Burke,Dario Landa-Silva,Baharuddin Mohamed +2 more
- 01 Jan 2007
TL;DR: This work investigates the interactions between constraints in a nurse scheduling problem at the Queen’s Medical Centre in Nottingham, UK to assess if the constraints in nurse scheduling problems are multi-objective in nature in order to better inform the design of multi- objective meta-heuristics to solve these problems.
Modeling in outpatient care in a public hospital: a management tool
Aurora Inés Gáfaro-Rojas,Fermín Mallor-Giménez,Cristina Azcárate-Camio +2 more
- 01 Jun 2014
TL;DR: A mathematical model useful in similar contexts to generate arrivals or analysis of the influx of patients was generated and described and implemented to model the arrival process of patients in a hospital in Colombia aimed at improving organizational management.
The impact of problem characteristics on the robustness of a personnel schedule: An empirical investigation
Jonas Ingels,Broos Maenhout +1 more
- 01 Jan 2013
TL;DR: In this article, the goal is to meet the customer demands as much as possible while offering an attractive roster to employees, while minimizing the total cost for the organization, which is not clear from an employee's point of view.
References
•Book
Tabu Search
Fred Glover,Manuel Laguna +1 more
- 31 Jul 1997
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.
7K
Branch-and-Bound Methods: A Survey
Eugene L. Lawler,D. E. Wood +1 more
TL;DR: The essential features of the branch-and-bound approach to constrained optimization are described, and several specific applications are reviewed, including integer linear programming Land-Doig and Balas methods, nonlinear programming minimization of nonconvex objective functions, and the quadratic assignment problem Gilmore and Lawler methods.
2.1K
On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms
Pablo Moscato
- 01 Jan 1989
TL;DR: In this paper, the authors present a short abstract, which is a summary of the paper.Short abstract, isn't it? But it is short abstracts, not abstracts.
1.8K
Constraint logic programming : A survey
Joxan Jaffar,Michael J. Maher +1 more
TL;DR: This survey of CLP is to give a systematic description of the major trends in terms of common fundamental concepts and the three main parts cover the theory, implementation issues, and programming for applications.
1.6K
•Book
Constraint satisfaction in logic programming
Pascal Van Hentenryck
- 01 Jan 1989
TL;DR: Van Hentenryck as mentioned in this paper proposes a new approach to solving discrete combinatorial problems using consistency techniques. But this approach is not suitable for many real-world problems, such as disjunctive scheduling, warehouse location, cutting stock car sequencing, and microcode labeling.
1.3K