IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v109y2025i4d10.1007_s11134-025-09952-3.html
   My bibliography  Save this article

NeuraliNQ: a neural network method for the transient performance analysis in non-Markovian Queues

Author

Listed:
  • Spyros Garyfallos

    (Universitat Politécnica de Catalunya
    Amazon, Amazon Web Services (AWS))

  • Yunan Liu

    (Amazon, Supply Chain Optimization Technology)

  • Pere Barlet-Ros

    (Universitat Politécnica de Catalunya)

  • Albert Cabellos-Aparicio

    (Universitat Politécnica de Catalunya)

Abstract

Many empirical studies have confirmed that service-time and patience-time distributions in service systems (e.g., call centers and health care) are far from exponentially distributed. Because non-Markovian queues are rarely amenable to analytic solutions, performance analysis often resorts to approximating methods such as heavy-traffic fluid limits or computer simulations. In this paper, we contribute to the literature on transient performance analysis of non-Markovian queues by developing a new neural networks method, dubbed Neural network in non-Markovian Queue (NeuraliNQ); we specifically focus on queues with customer abandonment. NeuraliNQ is an offline supervised learning method that uses synthetic training data to learn the system’s intrinsic characteristics. In real-time applications, NeuraliNQ can recurrently estimate the transient system waiting time performance in a finite time window. Our results confirm that NeuraliNQ is able to achieve the proper balance between efficiency and accuracy: on the one hand, it is four orders of magnitude computationally more efficient than Monte-Carlo simulations; on the other hand, it yields higher solution accuracy than standard approximation methods such as the heavy-traffic fluid model, especially when the system scale is not too large.

Suggested Citation

  • Spyros Garyfallos & Yunan Liu & Pere Barlet-Ros & Albert Cabellos-Aparicio, 2025. "NeuraliNQ: a neural network method for the transient performance analysis in non-Markovian Queues," Queueing Systems: Theory and Applications, Springer, vol. 109(4), pages 1-42, December.
  • Handle: RePEc:spr:queues:v:109:y:2025:i:4:d:10.1007_s11134-025-09952-3
    DOI: 10.1007/s11134-025-09952-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-025-09952-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11134-025-09952-3?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spr:queues:v:109:y:2025:i:4:d:10.1007_s11134-025-09952-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.