Text
Server Routing-Scheduling Problem in Distributed Queueing System with Time-Varying Demand and Queue Length Control
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.
Barcode | Tipe Koleksi | Nomor Panggil | Lokasi | Status | |
---|---|---|---|---|---|
art147907 | null | Artikel | Gdg9-Lt3 | Tersedia namun tidak untuk dipinjamkan - No Loan |
Tidak tersedia versi lain