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

Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues

Author

Listed:
  • V.D. Dinopoulou
  • C. Melolidakis

Abstract

T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least Ki of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest Ki and allocates functioning components to subsystems in increasing order of the Ki's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the Ki's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001

Suggested Citation

  • V.D. Dinopoulou & C. Melolidakis, 2001. "Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(8), pages 732-746, December.
    • Handle: RePEc:wly:navres:v:48:y:2001:i:8:p:732-746
    DOI: 10.1002/nav.1045
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.1045
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.1045?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
    ---><---

    References listed on IDEAS

    as
    1. David M. Malon, 1990. "When is greedy module assembly optimal?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 847-854, December.
    2. F. K. Hwang, 1989. "Optimal Assignment of Components to a Two-Stage k -Out-of- n System," Mathematics of Operations Research, INFORMS, vol. 14(2), pages 376-382, May.
    3. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1972. "On optimal assembly of systems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 19(4), pages 569-574, December.
    4. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1974. "Assembly of systems having maximum reliability," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 21(1), pages 1-12, March.
    5. Ward Whitt, 1986. "Deciding Which Queue to Join: Some Counterexamples," Operations Research, INFORMS, vol. 34(1), pages 55-62, February.
    6. D. J. Houck, 1987. "Comparison of Policies for Routing Customers to Parallel Queueing Systems," Operations Research, INFORMS, vol. 35(2), pages 306-310, April.
    7. V. Rajendra Prasad & K. P. K. Nair & Y. P. Aneja, 1991. "Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems," Operations Research, INFORMS, vol. 39(3), pages 407-414, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiaoyan Zhu & Way Kuo, 2014. "Importance measures in reliability and mathematical programming," Annals of Operations Research, Springer, vol. 212(1), pages 241-267, January.
    2. Laurence A. Baxter & Farid Harche, 1992. "Note: On the greedy algorithm for optimal assembly," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(6), pages 833-837, October.
    3. Coit, David W. & Zio, Enrico, 2019. "The evolution of system reliability optimization," Reliability Engineering and System Safety, Elsevier, vol. 192(C).
    4. Michael Katehakis & Ingram Olkin & Sheldon Ross & Jian Yang, 2013. "On the life and work of Cyrus Derman," Annals of Operations Research, Springer, vol. 208(1), pages 5-26, September.
    5. P S Ansell & K D Glazebrook & C Kirkbride, 2003. "Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 379-389, April.
    6. Ivo J. B. F. Adan & Onno J. Boxma & Stella Kapodistria & Vidyadhar G. Kulkarni, 2016. "The shorter queue polling model," Annals of Operations Research, Springer, vol. 241(1), pages 167-200, June.
    7. Plinio S. Dester & Christine Fricker & Danielle Tibi, 2017. "Stationary analysis of the shortest queue problem," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 211-243, December.
    8. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    9. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    10. Wang, Dan & Si, Shubin & Cai, Zhiqiang & Zhao, Jiangbin, 2021. "Reliability optimization of linear consecutive-k-out-of-n: F systems driven by reconfigurable importance," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    11. Sarang Deo & Itai Gurvich, 2011. "Centralized vs. Decentralized Ambulance Diversion: A Network Perspective," Management Science, INFORMS, vol. 57(7), pages 1300-1319, July.
    12. M. V. Koutras & G. K. Papadopoulos & S. G. Papastavridis, 1994. "Note: Pairwise rearrangements in reliability structures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(5), pages 683-687, August.
    13. Athanasia Manou & Antonis Economou & Fikri Karaesmen, 2014. "Strategic Customers in a Transportation Station: When Is It Optimal to Wait?," Operations Research, INFORMS, vol. 62(4), pages 910-925, August.
    14. Benjaafar, Saifallah, 1995. "Performance bounds for the effectiveness of pooling in multi-processing systems," European Journal of Operational Research, Elsevier, vol. 87(2), pages 375-388, December.
    15. Ali K. Parlaktürk & Sunil Kumar, 2004. "Self-Interested Routing in Queueing Networks," Management Science, INFORMS, vol. 50(7), pages 949-966, July.
    16. Zhao, Jiangbin & Si, Shubin & Cai, Zhiqiang, 2019. "A multi-objective reliability optimization for reconfigurable systems considering components degradation," Reliability Engineering and System Safety, Elsevier, vol. 183(C), pages 104-115.
    17. Jori Selen & Ivo Adan & Stella Kapodistria & Johan Leeuwaarden, 2016. "Steady-state analysis of shortest expected delay routing," Queueing Systems: Theory and Applications, Springer, vol. 84(3), pages 309-354, December.
    18. Fernanda Campello & Armann Ingolfsson & Robert A. Shumsky, 2018. "Queueing Models of Case Managers," Management Science, INFORMS, vol. 64(1), pages 7-26, January.
    19. Yi Ouyang & Demosthenis Teneketzis, 2022. "Signaling for decentralized routing in a queueing network," Annals of Operations Research, Springer, vol. 317(2), pages 737-775, October.
    20. Rami Atar & Isaac Keslassy & Gal Mendelson, 2019. "Replicate to the shortest queues," Queueing Systems: Theory and Applications, Springer, vol. 92(1), pages 1-23, June.

    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:48:y:2001:i:8:p:732-746. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.