IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v317y2022i1d10.1007_s10479-017-2611-3.html
   My bibliography  Save this article

A note on repair systems with exchangeable items and the longest queue mechanism

Author

Listed:
  • R. Ravid

    (ORT Braude College)

Abstract

A repair facility consisting of one repairman and two arrival streams of failed items, from bases 1 and 2 is considered. The arrival processes are independent Poisson processes, and the repair times are independent and identically exponentially distributed. The item types are exchangeable in the sense that a customer leaves the system with a fixed item, not necessarily the item he has brought. The rule according to which backorders are satisfied by repaired items is the longest queue rule: at the completion of a service (repair), the repaired item is delivered to the base that has the largest number of failed items. We obtain simple expressions for the marginal queue length distributions and for the probability mass function of the difference between the queue lengths. Finally we derive a recursive expression for the Laplace transform of the customer’s sojourn time in system, given the length of the queue at the arrival time point.

Suggested Citation

  • R. Ravid, 2022. "A note on repair systems with exchangeable items and the longest queue mechanism," Annals of Operations Research, Springer, vol. 317(1), pages 227-238, October.
    • Handle: RePEc:spr:annopr:v:317:y:2022:i:1:d:10.1007_s10479-017-2611-3
    DOI: 10.1007/s10479-017-2611-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2611-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/s10479-017-2611-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 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:annopr:v:317:y:2022:i:1:d:10.1007_s10479-017-2611-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.