.png){kind=icon}
.png){kind=icon}
Return
Server Routing-Scheduling Problem in Distributed Queueing System with Time-Varying Demand and Queue Length Control
.png){kind=icon}
PRE
AI
DOI：10.1287/trsc.2022.0099.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study a server routing-scheduling problem in a distributed queueing system, where the system consists of multiple queues at different locations. In a distributed queueing system, servers are shared among multiple queues, and they travel between queues in response to stochastic and time-varying demands. Although server traveling can improve service levels and shorten queue lengths, server routing and scheduling is complicated. We propose a dynamic programming model to solve this special routing-scheduling problem with time-varying demand, stochastic travel time, and queue-length constraints. In order to tackle large-scale practical instances, we design a dynamic programming-based rollout heuristic algorithm. Experiments on large-scale airports and scenic spots show that our approach reduces the total working periods of servers/employees without violating queue-length constraints. Furthermore, we demonstrate that our algorithm outperforms existing benchmark methods and the practical schedules of a scenic spot.
Keywords:
server routing-scheduling
queueing system
time-varying
queue length
Journal
IF:
4.8
Papers:
1.9K
Citations:
8.4K