Abstract
This paper presents a dynamic programming (DP) algorithm for solving a labor scheduling problem with several realistic days-off scheduling constraints and a cost structure that depends on the work sequence for each employee. The days-off scheduling constraints include the following: (1) each employee is assigned no more than three workdays per week, (2) each employee is assigned at least two consecutive off days per week, and (3) any work stretch cannot exceed four consecutive workdays. The sequence-dependent cost structure assumes that the daily wage of each employee depends on two factors: (1) whether the given workday is weekend or a regular workday, and (2) the sequence of work patterns assigned in previous days. A DP algorithm suited to instances of moderate size is used to determine the optimum work assignments that minimize the total labor cost, while satisfying the work demand under the stated constraints.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alfares, H. K. (2003). Flexible four-day workweek scheduling with weekend work frequency constraints. Computers & Industrial Engineering, 44(3), 325–338.
Alfares, H. K. (2006). Compressed workweek scheduling with days-off consecutivity, weekend-off frequency, and work stretch constraints. INFOR, 44(3), 175–189.
Alfares, H. K., & Bailey, J. E. (1997). Integrated project task and manpower scheduling. IIE Transactions, 29(9), 711–718.
Anonymous (2003). UK business caught short on flexible working. Management Services Journal, 47(3), 3.
Azmat, C. S., & Widmer, M. (2004). A case study of single shift planning and scheduling under annualized hours: A simple three-step approach. European Journal of Operational Research, 153(1), 148–175.
Billionnet, A. (1999). Integer programming to schedule a hierarchical workforce with variable demands. European Journal of Operational Research, 114(1), 105–114.
Browne, J., & Nanda, R. (1987). Scheduling efficiency of the four-day week at transportation facilities. In Proceedings of the Institute of Transportation Engineers 57th annual meeting (pp. 58–62), New York, 16–20 August 1987.
Burns, R. N., Narasimhan, R., & Smith, L. D. (1998). A set processing algorithm for scheduling staff on 4-day or 3-day work weeks. Naval Research Logistics, 45(8), 839–853.
Caprara, A., Monaci, M., & Toth, P. (2003). Models and algorithms for a staff scheduling problem. Mathematical Programming, 98(1–3), 445–476.
Costa, M.-C., Jarray, F., & Picouleau, C. (2006). An acyclic days-off scheduling problem. 4OR, 4(1), 73–85.
Davis, S. G., & Reutzel, E. T. (1981). A dynamic programming approach to work force scheduling with time-dependent performance measures. Journal of Operations Management, 1(3), 165–171.
Easton, F. F., & Rossin, D. F. (1991). Sufficient working subsets for the tour scheduling problem. Management Science, 37(11), 1441–1451.
Ernst, A. T., Jiang, H., Krishnamoorthy, M., & Sier, D. (2004). Staff scheduling and rostering: a review of applications, methods, and models. European Journal of Operational Research, 153(1), 3–27.
Gould, C. H. (1988). Rolling fours: novel work schedule. Journal of Construction Engineering and Management, 114(4), 577–593.
Hung, R. (1996). An annotated bibliography of compressed workweeks. International Journal of Manpower, 17(6–7), 43–53.
Hung, R., & Emmons, H. (1993). Multiple-shift workforce scheduling under the 3–4 compressed workweek with a hierarchical workforce. IIE Transactions, 25(2), 82–89.
Jonsson, H. (1987). Dimensioning of bus driver buffers subject to variations in the traffic load. Engineering Costs and Production Economics, 12(1–4), 29–38.
Koole, G., & Pot, A. (2005). Approximate dynamic programming in multi-skill call centers. In Proceedings of the 37th conference on winter simulation (pp. 576–583), Orlando, FL, 4–7 December 2005.
McCampbell, A. S., (1996). Benefits achieved through alternative work schedules. Human Resource Planning, 19(3), 30–37.
Mohamed, K. A., Datta, A., & Kozera, R. (2003). A knowledge-based technique for constraints satisfaction in manpower allocation. Lecture Notes in Computer Science, 2659, 100–108.
Nanda, R., & Browne, J. (1992). Introduction to employee scheduling. New York: Van Nostrand Reinhold.
Narasimhan, R. (2000). An algorithm for multiple-shift scheduling of hierarchical workforce on four-day or three-day workweek. INFOR, 38(1), 14–32.
Vassilacopoulos, G. (1985). Allocating doctors to shifts in an accident and emergency department. Journal of the Operational Research Society, 36(6), 517–523.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Elshafei, M., Alfares, H.K. A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs. J Sched 11, 85–93 (2008). https://doi.org/10.1007/s10951-007-0040-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-007-0040-x