IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v21y2014i2p123-142.html
   My bibliography  Save this article

Bi-level control of degraded machining system with two unreliable servers, multiple standbys, startup and vacation

Author

Listed:
  • Kamlesh Kumar
  • Madhu Jain

Abstract

This investigation deals with bi-level (N, L) switch over policy for multi-component machine repair system with two unreliable repairmen and multiple types of standbys. The repairman (R1) turns on when N-failed units are accumulated in the system and starts repair of failed units by taking a startup rate. As soon as there is no failed unit in the system, the repairmen (R1) goes for a vacation and returns back when he finds the number of failed units in the system greater than or equal to the threshold value N. The second repairman (R2) turns on when there are L (>N) failed units in the system and leaves for a vacation if the number of failed units are less than L. The repairmen can also breakdown while repairing the failed units. The life time and repair time of operating/standbys units, unreliable servers, and startup time of the servers are assumed to be exponentially distributed. The transient state probabilities of the system states are obtained by using Runge-Kutta's method. Expressions for various performance indices viz. throughput, average number of failed units in the system and reliability of the system etc. are established. In order to examine the effects of various parameters, the sensitivity analysis is carried out by taking numerical illustration.

Suggested Citation

  • Kamlesh Kumar & Madhu Jain, 2014. "Bi-level control of degraded machining system with two unreliable servers, multiple standbys, startup and vacation," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 21(2), pages 123-142.
    • Handle: RePEc:ids:ijores:v:21:y:2014:i:2:p:123-142
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=64540
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Na & Zhang, Yue & Teng, De & Kong, Nan, 2021. "Pareto optimization for control agreement in patient referral coordination," Omega, Elsevier, vol. 101(C).
    2. G. Ayyappan & S. Karpagam, 2018. "An M [ X ] / G ( a , b )/1 Queueing System with Breakdown and Repair, Stand-By Server, Multiple Vacation and Control Policy on Request for Re-Service," Mathematics, MDPI, vol. 6(6), pages 1-18, June.

    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:ids:ijores:v:21:y:2014:i:2:p:123-142. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.