The general employee scheduling problem: an integration of MS and AI
Computers and Operations Research - Special issue: Applications of integer programming
A modular approach to optimal multiple-shift manpower scheduling
Operations Research
A simulated-annealing heuristic for shift scheduling using non-continuously available employees
Computers and Operations Research
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Heuristic Algorithm for the Set Covering Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
The State of the Art of Nurse Rostering
Journal of Scheduling
SchedSP: a Grid-based application service provider of scheduling solutions: Research Articles
Software—Practice & Experience
Expert Systems with Applications: An International Journal
Finding good nurse duty schedules: a case study
Journal of Scheduling
Medical doctor rostering problem in a hospital emergency department by means of genetic algorithms
Computers and Industrial Engineering
Constraint-based rostering using meta-level reasoning and probability-based ordering
Engineering Applications of Artificial Intelligence
Solving nurse rostering problems using soft global constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A shift sequence based approach for nurse scheduling and a new benchmark dataset
Journal of Heuristics
Expert Systems with Applications: An International Journal
A hybrid approach for solving real-world nurse rostering problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
SchedSP: providing GRID-enabled real-world scheduling solutions as application services
EuroWeb'02 Proceedings of the 2002 international conference on EuroWeb
Cyclic staff scheduling: optimization models for some real-life problems
Journal of Scheduling
A Time Predefined Variable Depth Search for Nurse Rostering
INFORMS Journal on Computing
Hi-index | 0.00 |
In this paper, a detailed model and an efficient solution methodology for the monthly workshift and rest assignment of hospital nursing personnel is presented. A model that satisfies the rules of a typical hospital environment based both on published research data and on local hospital requirements is designed. A hybrid methodology that utilizes the strengths of operations research and artificial intelligence was used for the solution of the problem. In particular, an approximate integer linear programming (ILP) model is firstly solved and its solution is further improved using local search techniques. Finally, a tabu search strategy that uses as its neighborhood the solution space that the local heuristics define is presented. The use of heuristics is required because one of the main user requirements involving the user preference for specific workstretch patterns is not, for efficiency reasons, explicitly modeled in the ILP. In addition, for comparison and evaluation purposes the CLP based ILOG solver is also used to solve the same problem. The inferior computational results obtained with the ILOG solver do verify the speed and efficiency of the hybrid solution approach suggested in this paper. Extensive computational results are presented together with a detailed discussion on the quality, the computational efficiency and the operational acceptability of the solutions.