Abstract
We present a new methodology for solving large-scale employee tour scheduling problems. An integer programming model is proposed where tours are decomposed into shifts and start times. This formulation can model complex shift and start time rules for both continuous and discontinuous scheduling problems. A branch-and-price approach is devised to solve this model efficiently. The methodology was tested on the largest tour scheduling problems found in the open literature. In comparison with an alternative implicit model, our approach showed superior computational performance.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
ABACUS (1999). ABACUS 2.3. User’s guide and reference manual. http://www.informatik.uni-koeln.de/abacus/.
Bard, J. F., Binici, C., & deSilva, A. H. (2003). Staff scheduling at the united states postal service. Computers and Operations Research, 30, 745–771.
Bartholdi, J. J. (1981). A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Operations Research, 29, 501–510.
Bechtold, S. E., & Jacobs, L. W. (1990). Implicit modeling of flexible break assignments in optimal shift scheduling. Management Science, 36, 1339–1351.
Bechtold, S. E., Brusco, M. J., & Showalter, M. J. (1991). A comparative evaluation of labor tour scheduling methods. Decision Sciences, 22, 683–699.
Bechtold, S. E., & Brusco, M. J. (1994). Working set generation methods for labor tour scheduling. European Journal of Operational Research, 74, 540–551.
Brusco, M. J., & Jacobs, L. W. (1998). Personnel tour scheduling when starting-time restriction are present. Management Science, 44, 534–547.
Brusco, M. J., & Jacobs, L. W. (2000). Optimal models for meal-break and start-time flexibility in continuous tour scheduling. Management Science, 46, 1630–1641.
Burns, R. N., & Carter, M. W. (1985). Work force size and single shift schedules with variable demands. Management Science, 31, 599–607.
Cezik, T., Gunluk, O., & Luss, H. (2001). An integer programming model for the weekly tour scheduling problem. Naval Research Logistics, 48, 607–624.
Dantzig, G. B. (1954). A comment on Edie’s traffic delays at toll booths. Operations Research Journal, 3, 339–341.
Isken, M. W. (2004). An implicit tour scheduling model with applications in health care. Annals of Operations Research, 128, 91–110.
Jacobs, L. W., & Brusco, M. J. (1996). Overlapping start-time bands in implicit tour scheduling. Management Science, 42, 1247–1259.
Jarrah, A. I. Z., Bard, J. F., & deSilva, A. H. (1994). Solving large-scale tour scheduling problems. Management Science, 40, 1124–1144.
Mabert, V. A., & Showalter, M. J. (1988). Measuring the impact of part-time workers in service organizations. Journal of Operations Management, 9(2), 209–229.
Mehrotra, A., Murphy, K. E., & Trick, M. A. (2000). Optimal shift scheduling: a branch-and-price approach. Naval Research Logistics, 47, 185–200.
Moondra, S. L. (1976). An LP model for work force scheduling for banks. Journal of Bank Research, 7, 299–301.
Morris, J. G., & Showalter, M. J. (1983). Simple approaches to shift, days-off and tour scheduling problems. Management Science, 29, 942–950.
Ni, H. (2003). A branch-and-price approach to employee tour scheduling. D.Sc. thesis, The George Washington University, Washington DC, USA.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ni, H., Abeledo, H. A branch-and-price approach for large-scale employee tour scheduling problems. Ann Oper Res 155, 167–176 (2007). https://doi.org/10.1007/s10479-007-0212-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0212-2