An approximate dynamic programming method for the multi-period technician scheduling problem with experience-based service times and stochastic customers

Xi Chen; Mike Hewitt; Barrett W. Thomas

doi:10.1016/j.ijpe.2017.10.028

Back

An approximate dynamic programming method for the multi-period technician scheduling problem with experience-based service times and stochastic customers

Journal article

Open access

Peer reviewed

An approximate dynamic programming method for the multi-period technician scheduling problem with experience-based service times and stochastic customers

Xi Chen, Mike Hewitt and Barrett W. Thomas

International journal of production economics, Vol.196, pp.122-134

02/01/2018

DOI: 10.1016/j.ijpe.2017.10.028

Files and links (1)

url

https://doi.org/10.1016/j.ijpe.2017.10.028View

Published (Version of record) Open Access

Abstract

In this paper, we study how an organization can recognize that individuals learn when assigning employees to tasks. By doing so, an organization can meet current demands and position the capabilities of their workforce for the yet unknown demands in future days. Specifically, we study a variant of the technician and task scheduling problem in which the tasks to be performed in the current day are known, but there is uncertainty regarding the tasks to be performed in subsequent days. To solve this problem, we present an Approximate Dynamic Programming-based approach that incorporates into daily assignment decisions estimates of the long-term benefits associated with experience accumulation. We benchmark this approach against an approach that only considers the impact of experience accumulation on just the next day's productivity and show that the ADP approach outperforms this one-step lookahead approach. Finally, based on the results from an extensive computational study we derive insights into how an organization can schedule their employees in a manner that enables meeting both near and long-term demands.

Engineering

Engineering, Industrial

Engineering, Manufacturing

Operations Research & Management Science

Science & Technology

Technology

Details

Title: Subtitle: An approximate dynamic programming method for the multi-period technician scheduling problem with experience-based service times and stochastic customers
Creators: Xi Chen - Beijing Foreign Studies University
Mike Hewitt - Loyola University Chicago
Barrett W. Thomas - University of Iowa
Resource Type: Journal article
Publication Details: International journal of production economics, Vol.196, pp.122-134
DOI: 10.1016/j.ijpe.2017.10.028
ISSN: 0925-5273
eISSN: 1873-7579
Publisher: Elsevier
Number of pages: 13
Grant note: Fundamental Research Funds for the Central Universities CMMI-1266010 / National Science Foundation; National Science Foundation (NSF)
Language: English
Date published: 02/01/2018
Academic Unit: Bus Admin College; Business Analytics
Record Identifier: 9984380531402771

Metrics

22 Record Views

13 Times Cited - Web of Science