-
Article type: Cover
2000 Volume 22 Issue 7 Pages
Cover1-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
2000 Volume 22 Issue 7 Pages
i-iii
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Article type: Index
2000 Volume 22 Issue 7 Pages
iv-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Article type: Index
2000 Volume 22 Issue 7 Pages
v-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Masao Mukaidono
Article type: Article
2000 Volume 22 Issue 7 Pages
581-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Seiichi Okada, Hiroshi Noguchi, Masamitsu Shibata
Article type: Article
2000 Volume 22 Issue 7 Pages
582-589
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Hideki Shimamoto
Article type: Article
2000 Volume 22 Issue 7 Pages
590-597
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Katsunori Nogami
Article type: Article
2000 Volume 22 Issue 7 Pages
598-606
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Yasuo Tanabe, Masahiro Yamashita
Article type: Article
2000 Volume 22 Issue 7 Pages
607-615
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Hisaji Fukuda
Article type: Article
2000 Volume 22 Issue 7 Pages
616-623
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Takeshi Natsume
Article type: Article
2000 Volume 22 Issue 7 Pages
624-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Takeshi Natsume
Article type: Article
2000 Volume 22 Issue 7 Pages
625-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Tadashige Fujikawa
Article type: Article
2000 Volume 22 Issue 7 Pages
626-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Kiyoshi Takahisa
Article type: Article
2000 Volume 22 Issue 7 Pages
627-628
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Mitsuo Gen
Article type: Article
2000 Volume 22 Issue 7 Pages
629-630
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Takeshi Hashimoto
Article type: Article
2000 Volume 22 Issue 7 Pages
631-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Kunihiko Ikeda
Article type: Article
2000 Volume 22 Issue 7 Pages
632-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
2000 Volume 22 Issue 7 Pages
633-635
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
2000 Volume 22 Issue 7 Pages
636-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
2000 Volume 22 Issue 7 Pages
637-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Article type: Appendix
2000 Volume 22 Issue 7 Pages
638-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
-
Taku Hanafusa, Hisashi Yamamoto
Article type: Article
2000 Volume 22 Issue 7 Pages
641-652
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS
A consecutive-k-out-of-n:F system is an ordered sequence of n components. This system fails if and only if at least k consecutive components fail. The optimal assignment problem in linear consecutive-k-out-of-n:F system is to obtain which assignment (optimal assignment)has the largest system reliability in all the assignments of components when all components don't have the same failure-probability necessarily. In this paper, a branch and bound algorithm is proposed for the optimal assignment prob-lem in linear consecutive-k-out-of-n:F system. This algorithm has the procedure with 1)searching only the assignment holding necessary conditions for optimal assignment and 2)ob-taining their system and subsystem reliabilities and 3)removing searches to no useful assign-ments. Some numerical examples will ahow that the proposed algorithm is useful with a personal computer.
View full abstract
-
Article type: Cover
2000 Volume 22 Issue 7 Pages
Cover2-
Published: September 25, 2000
Released on J-STAGE: February 26, 2018
JOURNAL
FREE ACCESS