IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v47y2015i12p1329-1341.html
   My bibliography  Save this article

Analysis of dual tandem queues with a finite buffer capacity and non-overlapping service times and subject to breakdowns

Author

Listed:
  • Kan Wu
  • Ning Zhao

Abstract

Tandem queues with a finite buffer capacity are the common structures embedded in practical production systems. We study the properties of tandem queues with a finite buffer capacity and non-overlapping service times subject to time-based preemptive breakdowns. Different from prior aggregation and decomposition approaches, we view a tandem queue as an integrated system and develop an innovative approach to analyze the performance of a dual tandem queue through the insight from Friedman's reduction method. We show that the system capacity of a dual tandem queue with a finite buffer and breakdowns can be less than its bottleneck-sees-initial-arrivals system due to the existence of virtual interruptions. Furthermore, the virtual interruptions depend on job arrival rates in general. Approximate models are derived using priority queues and the concept of virtual interruptions.

Suggested Citation

  • Kan Wu & Ning Zhao, 2015. "Analysis of dual tandem queues with a finite buffer capacity and non-overlapping service times and subject to breakdowns," IISE Transactions, Taylor & Francis Journals, vol. 47(12), pages 1329-1341, December.
  • Handle: RePEc:taf:uiiexx:v:47:y:2015:i:12:p:1329-1341
    DOI: 10.1080/0740817X.2015.1055389
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2015.1055389
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2015.1055389?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.

    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:taf:uiiexx:v:47:y:2015:i:12:p:1329-1341. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.