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

When is greedy module assembly optimal?

Author

Listed:
  • David M. Malon

Abstract

Many coherent systems are configurations of identically structured modules, each consisting of a number of different components. The objective is to assemble the modules out of a collection of available components, and to install the modules in the system in a way that maximizes reliability. The greedy assembly rule builds one module out of the best available components, another out of the best remaining components, and so on. This article shows that greedy assembly is optimal whenever the modules have a series structure, no matter what the structure of the system in which the modules will be used might be, provided that the modules, once assembled, are installed in the system in an optimal way. The article also demonstrates that series modules are unique in this regard.

Suggested Citation

  • David M. Malon, 1990. "When is greedy module assembly optimal?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 847-854, December.
    • Handle: RePEc:wly:navres:v:37:y:1990:i:6:p:847-854
    DOI: 10.1002/1520-6750(199012)37:63.0.CO;2-Y
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199012)37:63.0.CO;2-Y
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199012)37:63.0.CO;2-Y?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. Emad El‐Neweihi & Frank Proschan & Jayaram Sethuraman, 1987. "Optimal assembly of systems using schur functions and majorization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 705-712, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.
    2. Xiaoyan Zhu & Way Kuo, 2014. "Importance measures in reliability and mathematical programming," Annals of Operations Research, Springer, vol. 212(1), pages 241-267, January.
    3. 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.
    4. Frank K. Hwang & Uriel G. Rothblum, 1995. "Some comments on the optimal assembly problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(5), pages 757-771, August.
    5. Stathis Chadjiconstantinidis & Markos V. Koutras, 1999. "Measures of component importance for markov chain imbeddable reliability structures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 613-639, September.
    6. 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.

    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.

    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:37:y:1990:i:6:p:847-854. 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.