Abstract
Scheduling of staff is an important area, both from an academic and industrial point of view. There has been a lot of attention to develop new and efficient methods and models. In this paper, we consider the problem that given a work-force demand, a set of working rules and regulations find schedules for staff members with individual skills and preferences. The planning horizon is typically one week to several months. The problem both constructs tasks and simultaneously allocates them to staff members. The purpose of this paper is not to develop new theoretical results. Instead it deals with novel applications of known approaches to real-world practice. We describe a general scheduling software called SCHEDULER that includes a number of important features. The model is based on a elastic set-partitioning model and as solution method we use a branch-and-price algorithm. As branching strategy we make use of constraint branching and the column generator is a nested constrained shortest path formulation. An important feature is that only legal schedules are generated and used within the model. The system also allows for task changes within shifts, a general description of legal restrictions, preferences and allowable times. The system is in use at a number of companies and we report on the usage at some companies. We also give some numerical results to illustrate the behavior of some important features.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barnhart, C., E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.M. Vance. (1998). “Branch-and-Price: Column Generation for Solving Huge Integer Programs.” Operations Research 46(3), 316–332.
Beasley, J.E. and B. Cao. (1996). “A Tree Search Algorithm for the Crew Scheduling Problem.” European Journal of Operational Research 94, 517–526.
Beaumont, N. (1997). “Scheduling Staff Using Mixed Integer Programming.” European Journal of Operational Research 98, 473–484.
Brailsford, S.C., C.N. Potts, and B.M. Smith. (1999). “Constraint Satisfaction Problems: Algorithms and Applications.” European Journal of Operational Research 119, 557–581.
Brusco, M.J. and L.W. Jacobs. (1993). “A Simulated Annealing Approach to the Cyclic Staff-Scheduling Problem.” Naval Research Logistics 40, 69–84
Cai, X. and K.N. Li. (2000). “A Genetic Algorithm for Scheduling Staff of Mixed Skills under Multi-Criteria.” European Journal of Operational Research 125, 359–369.
Caprara, A., F. Focacci, E. Lamma, P. Mello, M. Milano, P. Toth, and D. Vigo. (1998). “Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem.” Software-Practice and Experiences 48(1).
Day, P. and D. Ryan. (1999). “Flight Attendant Rostering for Short-Haul Airline Operations.” Operations Research 45(5), 649–661.
Dowsland, K.A. (1998). “Nurse Scheduling with Tabu Search and Strategic Oscillation.” European Journal of Operational Research 106, 393–407.
Gamache, M., F. Soumis, G. Marquis, and J. Desrosiers. (1999). “A Column Generation Approach for Large-Scale Aircrew Rostering Problems.” Operations Research 47(2), 247–263.
Hoffman, K.L. and M. Padberg. (1993). “Solving Airline Crew Scheduling Problems by Branch-and-Cut.” Management Science 39(6), 657–682.
Ingolfsson, A., Md.A. Haque, and A. Umnikov. (2002). “Accounting for Time-Varying Queuing Effects in Workforce Scheduling.” European Journal of Operational Research 139, 585–597
Jarrah, A.I.Z., J.F. Bard, and A.H. de Silva. (1994). “Solving Large-Scale Tour Scheduling Problems.” Management Science 40, 1124–1150.
SCHEDULER 45
Jaumard, B., F. Semet, and T. Vovor. (1998). “A Generalized Linear Programming Model for Nurse Scheduling.” European Journal of Operational Research 107, 1–18.
Lin, C.K.Y., K.F. Lai, and S.L. Hung. (2000). “Development of a Workforce Management System for a Customer Hotline Service.” Computers and Operations Research 27, 987–1004.
Mason, A.J. and A. Nielsen. (1999). “PETRA: A Programmable Optimisation Engine and Toolbox for Personnel Rostering Applications.” School of Engineering Technical Report 593, The University of Auckland.
Mason, A.J. and M.C. Smith. (1998). “A Nested Column Generator for Solving Rostering Problems with Integer Programming.” In L. Caccetta, K.L. Teo, P.F. Siew, Y.H. Leung, L.S. Jennings, and V. Rehbock (eds.), International Conference on Optimisation: Techniques and Applications, Curtin University of Technology, Perth, Australia, pp. 827–834.
Mason, A.J., D.M. Ryan, and D.M. Panton. (1998). “Integrated Simulation, Heuristic and Optimisation Approaches to Staff Scheduling.” Operations Research 46(2), 161–175.
Mingozzi, A., M.A. Boschetti, S. Ricciardelli and L. Bianco. (1999). “A Set Partitioning Approach to the Crew Scheduling Problem.” Operations Research 47(6), 873–898.
Ribeiro, C.C. and F. Soumis. (1994). “A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem.” Operations Research 42(1), 41–52.
Ryan, D.M. and B.A. Foster. (1981). “An Integer Programming Approach to Scheduling.” In A. Wren (ed.), Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling. Amsterdam: North-Holland, pp. 269–280.
Valouxis, C. and E. Housos. (2000). “Hybrid Optimization Techniques for the Workshift and Rest Assignment of Nursing Personnel.” Artificial Intelligence in Medicine 20, 155–175.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Eveborn, P., Rönnqvist, M. Scheduler – A System for Staff Planning. Annals of Operations Research 128, 21–45 (2004). https://doi.org/10.1023/B:ANOR.0000019097.93634.07
Issue Date:
DOI: https://doi.org/10.1023/B:ANOR.0000019097.93634.07