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

Erlang loss systems with shortest idle server first service discipline: Maintenance considerations

Author

Listed:
  • Mahboubeh Madadi
  • Mohammadhossein Heydari
  • Lisa Maillart
  • Richard Cassady
  • Shengfan Zhang

Abstract

We consider a variation of an Erlang loss system in which jobs are routed to servers according to the Shortest Idle Server First service discipline. Specifically, we consider a system in which idle servers are arranged in a stack; servers are returned to the top of the stack upon service completion; and arriving jobs are assigned to the server currently at the top of the stack. When busy, servers accumulate age and incur an age-dependent operating cost. For such systems, we (i) formulate a continuous-time Markov chain model to characterize the system’s transient behavior, and (ii) develop maintenance policies consisting of two possible actions: server group replacement and stack inversion. The stack inversion may be performed at any time prior to group replacement to achieve a more evenly distributed utilization among servers. We develop an optimization model to determine the optimal inversion and replacement times so as to minimize the long-run expected cost rate. Because the model is nonlinear and non-convex, we develop a set of algorithms to solve for the optimal replacement and inversion time. Lastly, we establish a lower bound for the inversion cost threshold below which it is optimal to invert the stack of servers before their replacement.

Suggested Citation

  • Mahboubeh Madadi & Mohammadhossein Heydari & Lisa Maillart & Richard Cassady & Shengfan Zhang, 2023. "Erlang loss systems with shortest idle server first service discipline: Maintenance considerations," IISE Transactions, Taylor & Francis Journals, vol. 55(10), pages 1008-1021, October.
    • Handle: RePEc:taf:uiiexx:v:55:y:2023:i:10:p:1008-1021
    DOI: 10.1080/24725854.2022.2149906
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2022.2149906
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2022.2149906?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:55:y:2023:i:10:p:1008-1021. 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.