Optimization of Worker Redeployment for Enhancing Customer Service Performance

This study considers ways in which workers can be allocated dynamically in the few hours before the truck departure to flush the system of orders that are almost completed, thereby increasing the service performance of the system. To implement a worker allocation policy correctly, we need to answer the following questions: how many workers should we move, and when? We present the optimal number of workers required and the switching time for the proposed three dynamic worker reallocation policies through simulation experiments. The number of workers required was determined by the difference between the current and target probability of success of an order in the system based on the state-dependent sojourn time distribution, and the performance of the system was measured by Next Scheduled Departure (NSD). We find that the policies with late switching times and higher target probability of success have a greater effect on customer satisfaction. Our results suggest that it is possible to improve service performance significantly, in some conditions, by moving the right number of workers to the right place at the right time.

Authors

Institutions

Publication Details

Journal
Information
Published
2025-02-18
DOI
https://doi.org/10.3390/info16020149
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimization of Worker Redeployment for Enhancing Customer Service Performance

Wan Ju Kang, Eunmi Lee, Hyunho Kim
Information
Scheduling and Optimization Algorithms
article

Optimization of Worker Redeployment for Enhancing Customer Service Performance

Wan Ju Kang, Eunmi Lee, Hyunho Kim
article en

Abstract

This study considers ways in which workers can be allocated dynamically in the few hours before the truck departure to flush the system of orders that are almost completed, thereby increasing the service performance of the system. To implement a worker allocation policy correctly, we need to answer the following questions: how many workers should we move, and when? We present the optimal number of workers required and the switching time for the proposed three dynamic worker reallocation policies through simulation experiments. The number of workers required was determined by the difference between the current and target probability of success of an order in the system based on the state-dependent sojourn time distribution, and the performance of the system was measured by Next Scheduled Departure (NSD). We find that the policies with late switching times and higher target probability of success have a greater effect on customer satisfaction. Our results suggest that it is possible to improve service performance significantly, in some conditions, by moving the right number of workers to the right place at the right time.

InformationVol. 16(2)
Kookmin University (KR), Korea Military Academy (KR)
Kookmin University
Openalex Percentile: Top 97%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.