IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v25y2025i1d10.1007_s12351-024-00877-y.html
   My bibliography  Save this article

Modeling and simulation of first-come, first-served queueing system with impatient multiclass customers

Author

Listed:
  • Vinay Kumar

    (Indian Institute of Technology Madras)

  • Neelesh Shankar Upadhye

    (Indian Institute of Technology Madras)

Abstract

This article examines a first-come, first-served queueing system serving impatient customers from c distinct classes. Each customer class is characterized by independent patience and service time distributions. The study focuses on two specific queueing systems: $$M/G/1+M$$ M / G / 1 + M and $$M/M/m+M$$ M / M / m + M . Steady-state analyses for $$M/G/1 + M$$ M / G / 1 + M and $$M/M/m + M$$ M / M / m + M are derived, and a case where all customer classes share the same mean service time is explored. Performance measures in the steady state are derived for both systems. Numerical analysis for the $$M/M/m + M$$ M / M / m + M system is conducted using the proposed characterizations. The actual and simulated $$M/M/m + M$$ M / M / m + M systems are then compared using steady-state metrics, including the proportion of served customers in each class, the mean waiting times for customers in each class, and the system throughput derived analytically. The numerical results highlight the effectiveness of this queueing model in addressing a range of real-world applications.

Suggested Citation

  • Vinay Kumar & Neelesh Shankar Upadhye, 2025. "Modeling and simulation of first-come, first-served queueing system with impatient multiclass customers," Operational Research, Springer, vol. 25(1), pages 1-37, March.
    • Handle: RePEc:spr:operea:v:25:y:2025:i:1:d:10.1007_s12351-024-00877-y
    DOI: 10.1007/s12351-024-00877-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-024-00877-y
    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/s12351-024-00877-y?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 search for a different version of it.

    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:operea:v:25:y:2025:i:1:d:10.1007_s12351-024-00877-y. 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.