A recursive algorithm for the reliability of a circular connected-(r,s)-out-of-(m,n):F lattice system |
| |
| Affiliation: | 1. Department of Production Information System, Tokyo Metropolitan Institute of Technology, 6-6 Asahigaoka, Hino, Tokyo 191-0065, Japan;2. Department of Information Management Engineering, Yamagata College of Industry and Technology, 2-2-1 Matsuei, Yamagata 990-2473, Japan;1. School of E-Business and Logistics, Beijing Technology and Business University, Beijing 100048, China;2. School of Management & Economics, Beijing Institute of Technology, Beijing 100081, China;3. Department of Economics and Management, Nanjing University of Science and Technology, Nanjing 210094, China;1. Shenyang National Laboratory for Materials Science, Institute of Metal Research, Chinese Academy of Sciences, 72 Wenhua Road, Shenyang, 110016, PR China;2. Key Laboratory for Anisotropy and Texture of Materials, Ministry of Education, School of Materials Science and Engineering, Northeastern University, 3-11 Wenhua Road, Shenyang, 110819, PR China |
| |
| Abstract: | A circular connected-(r, s)-out-of-(m, n):F lattice system consists of m×n components arranged in a cylindrical grid. Each of m circles has n components, and this system fails if and only if there exists a grid of size r ×s which all components are failed. A circular connected-(r, s)-out-of-(m, n):F lattice system might be used in reliability models for ‘Feelers for measuring temperature on reaction chamber’ and ‘TFT Liquid Crystal Display system with 360° wide area’.In this study, we proposed a new recursive algorithm for obtaining the reliability of a circular connected-(r, s)-out-of-(m, n):F lattice system. We evaluated our proposed algorithms in terms of computing time and memory capacity. Furthermore, a numerical experiment comparing our proposed algorithm with Yamamoto and Miyakawa's algorithm [Yamamoto, H., & Miyakawa, M. (1996). Reliability of circular connected-(r, s)-out-of-(m, n):F lattice system. Journal of the Operations Research Society of Japan, 39(3), 389–406] showed that our proposed algorithm is more effective for systems with a large n. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
