Name
Abstract | ||
|---|---|---|
We consider a system with m modules as components. These modules are composed of parts of finitely many types, and the number of parts of each type that is needed in each of the modules is given, e.g., module i requires n(ui) parts of type u. Parts of the same type may have different reliabilities, but they are functionally interchangeable. A module works if and only if all of its parts work, i.e., the internal composition of the modules has series structure. An assembly of the modules consists of an assignment of each of the SIGMA(u)SIGMA(i)n(ui) parts to the modules such that each module meets its specification by getting the required number of parts of each type. Such an assembly is called monotone if the best parts of each type go to one module, the next best parts of each type go to a second module, and so on, until finally the last module gets the worst parts of each type. We prove that for coherent systems, there always exists a monotone assembly which maximizes the reliability of the system. Furthermore, we obtain sufficient conditions under which every optimal assembly is monotone. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1287/opre.42.4.709 | Operations Research |
Field | DocType | Volume |
Discrete mathematics,Mathematical optimization,Algebra,If and only if,Mathematics,Monotone polygon,Goto | Journal | 42 |
Issue | ISSN | Citations |
4 | 0030-364X | 7 |
PageRank | References | Authors |
1.98 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frank K. Hwang | 1 | 34 | 17.60 |
| U. G. Rothblum | 2 | 54 | 17.31 |