IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v57y2023i5p1209-1230.html
   My bibliography  Save this article

Server Routing-Scheduling Problem in Distributed Queueing System with Time-Varying Demand and Queue Length Control

Author

Listed:
  • Zerui Wu

    (Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai 200240, China)

  • Ran Liu

    (Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai 200240, China)

  • Ershun Pan

    (Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai 200240, China)

Abstract

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.

Suggested Citation

  • Zerui Wu & Ran Liu & Ershun Pan, 2023. "Server Routing-Scheduling Problem in Distributed Queueing System with Time-Varying Demand and Queue Length Control," Transportation Science, INFORMS, vol. 57(5), pages 1209-1230, September.
    • Handle: RePEc:inm:ortrsc:v:57:y:2023:i:5:p:1209-1230
    DOI: 10.1287/trsc.2022.0099
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2022.0099
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2022.0099?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:57:y:2023:i:5:p:1209-1230. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.