By Topic

A fast reliability-algorithm for the circular consecutive-weighted-k-out-of-n:F system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jen-Chun Chang ; Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Chen, R.-J. ; Hwang, F.K.

An O(T n) algorithm is presented for the circular consecutive-weighted-k-out-of-n:F system, where T⩽min[n,[(k-ω max)/ωmin]+1]; ωmax, ωmin are the maximum, minimum weights of all components. This algorithm is simpler and more efficient than the Wu and Chen O(min[n,k] n) algorithm. When all weights are unity, this algorithm is simpler than other O(k-n) published algorithms

Published in:

Reliability, IEEE Transactions on  (Volume:47 ,  Issue: 4 )