Optimal Scheduling for a Service Technician Workforce with Time-varying Work Volume and Technician Availability
American Journal of Engineering and Technology Management
Volume 2, Issue 6, December 2017, Pages: 77-82
Received: May 30, 2017; Accepted: Jul. 5, 2017; Published: Nov. 7, 2017
Views 1522      Downloads 61
Author
Dennis Charles Dietz, Analytics and Forecasting, CenturyLink, Inc., Boulder, USA
Article Tools
Follow on us
Abstract
A practical scheduling method is developed and implemented to determine the optimal allocation of technicians to candidate tour types and start times in a field service environment. Historical data is aggregated to determine a weekly work volume distribution and technician availability profile. These and other quantitative factors populate a mixed integer programming model for determining the distribution of technician tours that will minimize queueing delay in completing service, subject to side constraints on tour type quantities. The approach has been successfully implemented to schedule installation and maintenance technicians at a major telecommunication service provider and could easily be adapted to other operational contexts.
Keywords
Scheduling, Mixed Integer Linear Programming, Operations Management
To cite this article
Dennis Charles Dietz, Optimal Scheduling for a Service Technician Workforce with Time-varying Work Volume and Technician Availability, American Journal of Engineering and Technology Management. Vol. 2, No. 6, 2017, pp. 77-82. doi: 10.11648/j.ajetm.20170206.11
Copyright
Copyright © 2017 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
References
[1]
J. V. den Bergh, J. Belien, P. De Bruecker, E. Demeeulemeester, L. De Boeck, Personnel Scheduling: A Literature Review, European Journal of Operational Research 226 (3) (2013) 367-385.
[2]
J. O. Brunner, Literature Review on Personnel Scheduling, Flexible Shift Planning in the Service Industry, Lecture Notes in Economics and Mathematical Systems 640 (2010) 5-12.
[3]
A. T. Ernst, H. Jiang, M. Krishnamoorthy, B. Owens, D. Sier, An Annotated Bibliography of Personnel Scheduling and Rostering, Annals of Operations Research 127 (2004) 21-144.
[4]
A. Parisio, C. N. Jones, A Two-stage Stochastic Programming Approach to Employee Scheduling in Retail Outlets with Uncertain Demand, Omega 53 (2015) 97-103.
[5]
S. A. Zolfaghari, A. El-Bouri, B. Namiranian, V. Quan, Heuristics for Large Scale Scheduling in the Retail Sector, INFOR 45 (2007) 111-122.
[6]
O. Berman, R. C. Larson, E. Pinker, Scheduling Workforce and Workflow in a High Volume Factory, Management Science 43 (1997) 158-172.
[7]
S. C. K. Chu, Generating, Scheduling, and Rostering of Shift-crew Duties: Applications at the Hong Kong International Airport, European Journal of Operational Research 177 (2007) 1764-1778.
[8]
B. Gopalakrishnan, E. L. Johnson, Airline Crew Scheduling: State-of-the-art, Annals of Operations Research 140 (2005) 305-337.
[9]
B. M. Smith, A. Wren, A Bus Crew Scheduling System Using a Set Covering Formulation, Transportation Research Part A: General 22 (1988) 97-108.
[10]
S. Topalogu, A Multi-objective Programming Model for Scheduling Emergency Medicine Residents, Computers and Industrial Engineering 51 (2006) 375-388.
[11]
D. Parr, J. Thompson, Solving the Multi-objective Nurse Scheduling Problem with a Weighted Cost Function, Annals of Operational Research 155 (2007) 279-288.
[12]
N. K. Kwak, C. Lee, A Linear Goal Programming Model for Human Resource Allocation in a Health-care Organization, Journal of Medical Systems 21 (1997) 129-140.
[13]
D. C. Dietz, Practical Scheduling for Call Center Operations, Omega 39 (2010) 550-557.
[14]
M. Segal, The Operator-scheduling Problem: A Network-flow Approach, Operations Research 22 (1974) 808-823.
[15]
A. Caprara, M. Monaci, P. Toth, Models and Algorithms for a Staff Scheduling Problem, Mathematical Programming 98 (2003) 445-476.
[16]
A. Billionnet, Integer Programming to Schedule a Hierarchical Workforce with Variable Demands, European Journal of Operational Research 114 (1999) 105-114.
[17]
G. M. Thompson, Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem, Management Science 41 (4) (1995) 595-607.
[18]
A. P. Muhlemann, A Simulation Study of the Operations of a Telephone Bureau, Omega 9 (2002) 633-637.
[19]
M. Elshafei, H. K. Alfares, A Dynamic Programming Algorithm for Days-off Scheduling with Sequence Dependent Labor Costs, Journal of Scheduling 11 (2008) 85-93.
[20]
A. Ingolfsson, A. Haque, A. Umnikov, Accounting for Time-varying Queueing Effects in Workforce Scheduling, European Journal of Operational Research 139 (2002) 585-597.
[21]
J. Li, E. K. Burke, T. Curtois, S. Petrovic, R. Qu, The Falling Tide Algorithm: A New Multi-objective Approach for Complex Workforce Scheduling, Omega 40 (2012) 283-293.
[22]
W. B. Henderson, W. L. Berry, Heuristic Methods for Telephone Operator Shift Scheduling, Management Science 22 (1976) 1372-1380.
[23]
D. Lesaint, C. Voudouris, N. Azarmi, Dynamic Workforce Scheduling for British Telecommunications plc, Interfaces 30 (2000) 45-56.
[24]
J. D. C. Little, A Proof of the Queuing Formula L=W, Operations Research 9 (1961) 383-387.
[25]
A. J. Mason, OpenSolver-An Open Source Add-in to Solve Linear and Integer Programmes in Excel, Operations Research Proceedings 2011, eds. D. Klatte, H. Luthi, K. Schmedders, Springer Berlin Heidelberg (2012) 401-406, http: //opensolver.org.
ADDRESS
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
U.S.A.
Tel: (001)347-983-5186