IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v47y2000i5p399-421.html
   My bibliography  Save this article

Computational analysis of MMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline

Author

Listed:
  • Qi‐Ming HE
  • Attahiru Sule Alfa

Abstract

This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000

Suggested Citation

  • Qi‐Ming HE & Attahiru Sule Alfa, 2000. "Computational analysis of MMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(5), pages 399-421, August.
    • Handle: RePEc:wly:navres:v:47:y:2000:i:5:p:399-421
    DOI: 10.1002/1520-6750(200008)47:53.0.CO;2-9
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(200008)47:53.0.CO;2-9
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(200008)47:53.0.CO;2-9?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
    ---><---

    More about this item

    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:wly:navres:v:47:y:2000:i:5:p:399-421. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.