Sequential construction of a circular consecutive-2 system
| dc.citation.epage | 235 | en_US |
| dc.citation.issue | 5 | en_US |
| dc.citation.spage | 231 | en_US |
| dc.citation.volume | 75 | en_US |
| dc.citation.woscount | 3 | |
| dc.contributor.author | Hwang, FK | en_US |
| dc.contributor.author | Pai, CK | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:44:44Z | |
| dc.date.available | 2014-12-08T15:44:44Z | |
| dc.date.issued | 2000-10-31 | en_US |
| dc.description.abstract | Derman, 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.identifier.doi | 10.1016/S0020-0190(00)00106-X | en_US |
| dc.identifier.issn | 0020-0190 | en_US |
| dc.identifier.journal | INFORMATION PROCESSING LETTERS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/S0020-0190(00)00106-X | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/30194 | |
| dc.identifier.wosnumber | WOS:000089550800007 | |
| dc.language.iso | en_US | en_US |
| dc.subject | algorithms | en_US |
| dc.subject | allocation | en_US |
| dc.subject | consecutive-3 system | en_US |
| dc.subject | reliability | en_US |
| dc.title | Sequential construction of a circular consecutive-2 system | en_US |
| dc.type | Article | en_US |