Abstract
This problem is based on the British Telecom workforce scheduling problem, in which technicians (with different skills) are assigned to tasks (which require different skills) which arrive (partially) dynamically during the day. In order to manage their workforce, British Telecom divides the different regions into several areas. At the beginning of each day all the technicians in a region are assigned to one of these areas. During the day, each technician is limited to tasks within the assigned area.
This effectively decomposes a large dynamic scheduling problem into smaller problems. On one hand, it makes the problem more manageable. On the other hand, it gives rise to, potentially, a mismatch between technicians and tasks within an area. Furthermore, it prevents technicians from being assigned a job which is just outside their area but happens to be close to where they are currently working.
This paper studies the effect of the number of partitions on the expected objective (number of completed tasks) that a rule-based system (responsible for the dynamic assignment and reassignment of tasks to resources following dynamic events) can reach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bent, R. W., & Van Hentenryck, P. (2004). Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Operations Research, 52(6), 977–987.
Bertsimas, D., & Van Ryzin, G. (1991). A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operations Research, 39, 601–615.
Bertsimas, D. J., & Ryzin, G. V. (1993). Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Operations Research, 41(1), 60–76.
Borenstein, Y., Shah, N., Tsang, E., Dorne, R., Alsheddy, A., & Voudouris, C. (2008). On the partitioning of dynamic scheduling problems—assigning technicians to areas. In M. Keijzer (Ed.), Proceedings of the 10th annual conference on genetic and evolutionary computation. GECCO ’08 (pp. 1691–1692) (Atlanta, GA, USA, July 12–16, 2008). New York: ACM.
Branke, J., Middendorf, M., Noeth, G., & Dessouky, M. (2005). Waiting strategies for dynamic vehicle routing. Transportation Science, 39(3), 298–312.
Cowling, K. D. P., Colledge, N., Dahal, K. P., & Remde, S. (2006). The trade off between diversity and quality for multi-objective workforce scheduling. In J. Gottlieb & G. R. Raidl (Eds.), Lecture notes in computer science : Vol. 3906. EvoCOP (pp. 13–24). Berlin: Springer.
Dorne, R., Voudouris, C., Liret, A., Ladde, C., & Lesaint, D. (2003). An optimisation tool-kit based on heuristic search to solve BT scheduling problems. BT Technology Journal, 21(4), 50–58.
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.
Gendreau, M., Guertin, F., Potvin, J.-Y., & Taillard, E. (1999). Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science, 33(4), 381–390.
Gianpaolo Ghiani, G. L. R. M., & Guerriero, F. (2003). Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. European Journal of Operational Research, 151, 1–11.
Ichoua, S., Gendreau, M., & Potvin, J.-Y. (2006). Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Science, 40(2), 211–225.
Karsten Lund, O. B. M., & Rygaard, J. M. (1996). Vehicle routing problems with varying degrees of dynamism (Technical report). IMM Department of Mathematical Modelling, The Technical University of Denmark.
Kolisch, R., & Hartmann, S. (2006). Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research, 174(1), 23–37.
Larsen, A., Madsen, O. B. G., & Solomon, M. M. (2002). Partially dynamic vehicle routing—models and algorithms. Journal of the Operational Research Society, 53(6), 637–646.
Larsen, A., Madsen, O. B. G., & Solomon, M. M. (2004). The a priori dynamic traveling salesman problem with time windows. Transportation Science, 38(4), 459–472.
Lesaint, D., Voudouris, C., & Azarmi, N. (2000). Dynamic workforce scheduling for British telecommunications plc. Interfaces, 30(1), 45–56.
Powell, W. B., Towns, M. T., & Marar, A. (2000). On the value of optimal myopic solutions for dynamic routing and scheduling problems in the presence of user noncompliance. Transportation Science, 34(1), 67–85.
Psaraftis, H. N. (1995). Dynamic vehicle routing: Status and prospects. Annals of Operations Research, 61(1), 143–164.
Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. European Journal for Operational Research, 35(2), 245–265.
Tibshirani, R., Walther, G., & Hastie, T. (2001). Estimating the number of clusters in a data set via the gap statistic. Journal of the Royal Statistical Society Series B, 63(2), 411–423.
Tsang, E., & Voudouris, C. (1997). Fast local search and guided local search and their application to British Telecom’s workforce scheduling problem. Operations Research Letters, 20(3), 119–127.
Tsang, E. P. K., Virginas, B., Gosling, T., & Liu, W. (2008a). Multi-agent systems for staff empowerment. In Service chain management (pp. 263–272). Berlin: Springer.
Tsang, E., Gosling, T., Botond, V., Voudouris, C., Gilbert, O., & Liu, W. (2008b). Retractable contract network for empowerment in workforce scheduling. Multiagent and Grid Systems Journal, 4(1), 25–44.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Borenstein, Y., Shah, N., Tsang, E. et al. On the partitioning of dynamic workforce scheduling problems. J Sched 13, 411–425 (2010). https://doi.org/10.1007/s10951-009-0152-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-009-0152-6