The general employee scheduling problem: an integration of MS and AI
Computers and Operations Research - Special issue: Applications of integer programming
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
Improved implicit optimal modeling of the labor shift scheduling problem
Management Science
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Scheduling, Timetabling and Rostering - A Special Relationship?
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Journal of Heuristics
An indirect genetic algorithm for a nurse-scheduling problem
Computers and Operations Research
A Polyhedral Approach for the Staff Rostering Problem
Management Science
The State of the Art of Nurse Rostering
Journal of Scheduling
How to Solve It: Modern Heuristics
How to Solve It: Modern Heuristics
Finding good nurse duty schedules: a case study
Journal of Scheduling
Hybrid optimization techniques for the workshift and rest assignment of nursing personnel
Artificial Intelligence in Medicine
Optimizing staff rosters for emergency shifts for doctors
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Hi-index | 0.00 |
Organising shifts, or work rosters, is a problem that affects a large number of businesses where employees are subject to some kind of work rotation. Researchers in the fields of Operations Research and Artificial Intelligence have resorted to several different optimisation systems to solve the problem. The motivation for the medical-staff shift-rotation research presented in this paper stems from the needs of an actual hospital emergency department (HED) and from the observed growing staff of these services in Spain. The problem approach, which has been hardly dealt with in the literature, intends to automate the creation of time-tables by applying genetic algorithms (GAs) in an actual HED. HEDs work organisation becomes different because of the combination of shifts and 24-h duties. After knowing the HED workers' requirements (which will allow to identify the hard and soft constraints imposed to the problem) and after defining the adequate encoding to be used in the solutions, a heuristic-schedule builder -designed ad hoc to satisfy the hard constraints - produces an initial population of feasible solutions. Afterwards, iteratively, GA obtains new generations of feasible individuals, thanks to the use of a specific crossover operator, based in the exchange of whole work weeks, that operates together with a repair function. Once the optimum is reached, the results obtained are discussed as a function of the degree of satisfaction of the constraints under which the system operates and of the adaptability of the system as the constraints vary.