Full metadata record
DC FieldValueLanguage
dc.contributor.authorHwang, FKen_US
dc.contributor.authorPai, CKen_US
dc.date.accessioned2014-12-08T15:44:44Z-
dc.date.available2014-12-08T15:44:44Z-
dc.date.issued2000-10-31en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0020-0190(00)00106-Xen_US
dc.identifier.urihttp://hdl.handle.net/11536/30194-
dc.description.abstractDerman, Lieberman and Ross solved the problem of sequentially assigning n components with different reliabilities to a consecutive-2 linear system to maximize the system reliability. Furthermore, they show that the optimal assignment is invariant, i.e., it depends only on the ranking of the component reliabilities, but not their values. We study the same problem for the consecutive-2 circular system and prove that an invariant optimal assignment does not exist. But we reduce the number of candidates of an optimal assignment from n! to [n/2] - 2. We also find the first-order invariant optimal assignment. (C) 2000 Elsevier Science B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectalgorithmsen_US
dc.subjectallocationen_US
dc.subjectconsecutive-3 systemen_US
dc.subjectreliabilityen_US
dc.titleSequential construction of a circular consecutive-2 systemen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0020-0190(00)00106-Xen_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.citation.volume75en_US
dc.citation.issue5en_US
dc.citation.spage231en_US
dc.citation.epage235en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000089550800007-
dc.citation.woscount3-
Appears in Collections:Articles


Files in This Item:

  1. 000089550800007.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.