Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
Efficient generation of rotating workforce schedules
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
A Memetic Approach to the Nurse Rostering Problem
Applied Intelligence
An Integer Programming-Based Nurse Rostering System
ASIAN '96 Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security
A Constraint-Based Nurse Rostering System Using a Redundant Modeling Approach
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
The State of the Art of Nurse Rostering
Journal of Scheduling
Cyclic staff scheduling: optimization models for some real-life problems
Journal of Scheduling
| Hi-index | 0.00 |
Although optimal staff scheduling often requires elaborate computational methods, those cases which are not highly constrained can be efficiently solved using simpler approaches. This paper describes how a simple procedure, combining random and greedy strategies with heuristics, has been successfully applied in a Spanish hospital to assign guard shifts to the physicians in a department. In this case, the employees prefer that their guard duties are regularly distributed in time. The workload distribution must also satisfy some constraints: in particular, the distribution of duties among the staff must be uniform when a number of tasks and shift types (including some unfrequent and aperiodic types, such as those scheduled during long weekends) are considered. Furthermore, the composition of teams should be varied, in the sense that no particular pairing should dominate the assignments. The procedure proposed is able to find suitable solutions when the number of employees available for every task is not small compared to the number required at every shift. The software is distributed under the terms of the GNU General Public License.