Start-up demonstration tests with sparse connection

Based on the concept of sparse connection, three start-up demonstration tests with sparse connection are introduced which are called CSTF with sparse d1, TSCF with sparse d2 and CSCF with sparse d3 and d4. The traditional start-up demonstration tests such as CSTF, TSCF and CSCF are special cases of these new tests. Furthermore, the new tests exhibit obvious improvement in test efficiency. In this paper, by using the finite Markov chain imbedding approach, several probabilistic indexes are given for these new start-up demonstration tests based on the assumption that the tests are i.i.d. case. The analyses are also extended to independent and non-identical and Markov dependent cases. In addition, procedures are provided in order to determine the optimal parameters needed in a demonstration test for selecting the products to meet the reliability requirement. Three comparison analyses are finally presented in order to illustrate the high efficiency of these new start-up demonstration tests and the effectiveness of this method.

[1]  Lirong Cui,et al.  On the Accelerated Scan Finite Markov Chain Imbedding Approach , 2009, IEEE Transactions on Reliability.

[2]  Donald E. K. Martin,et al.  Application of auxiliary Markov chains to start-up demonstration tests , 2008, Eur. J. Oper. Res..

[3]  Gerald J. Hahn,et al.  Evaluation of a Start-Up Demonstration Test , 1983 .

[4]  Narayanaswamy Balakrishnan,et al.  Start-Up Demonstration Tests with Rejection of Units upon Observing d Failures , 2000 .

[5]  Athanasios C. Rakitzis,et al.  Start-Up Demonstration Tests Based on Run and Scan Statistics , 2009 .

[6]  William S. Griffith,et al.  The analysis and comparison of start-up demonstration tests , 2008, Eur. J. Oper. Res..

[7]  William S. Griffith,et al.  Start-Up Demonstration Tests Based on Consecutive Successes and Total Failures , 2005 .

[8]  Serkan Eryilmaz,et al.  Start-Up Demonstration Test Based on Total Successes and Total Failures With Dependent Start-Ups , 2012, IEEE Transactions on Reliability.

[9]  Donald E. K. Martin,et al.  Markovian start-up demonstration tests with rejection of units upon observing d , 2004, Eur. J. Oper. Res..

[10]  Xian Zhao.  On generalized start-up demonstration tests , 2014, Ann. Oper. Res..

[11]  James C. Fu,et al.  On Reliability of a Large Consecutive-k-out-of-n:F System with (k - 1)-step Markov Dependence , 1987, IEEE Transactions on Reliability.

[12]  Markos V. Koutras,et al.  Distribution Theory of Runs: A Markov Chain Approach , 1994 .

[13]  Lirong Cui,et al.  Reliability for Sparsely Connected Consecutive-$k$ Systems , 2007, IEEE Transactions on Reliability.

[14]  Sotiris Bersimis,et al.  A compound control chart for monitoring and controlling high quality processes , 2014, Eur. J. Oper. Res..

[15]  Amos E. Gera.  A start-up demonstration procedure involving dependent tests , 2013 .

[16]  Amos E. Gera,et al.  A New Start-Up Demonstration Test , 2010, IEEE Transactions on Reliability.

[17]  Amos E. Gera.  A Start-Up Demonstration Test Involving Distant Failures , 2013 .

[18]  Xian Zhao.  Start-Up Demonstration Tests for Products with Start-Up Delay , 2013 .

[19]  Amos E. Gera,et al.  A General Model for Start-Up Demonstration Tests , 2011, IEEE Transactions on Reliability.

[20]  Lirong Cui,et al.  Developments and Applications of the Finite Markov Chain Imbedding Approach in Reliability , 2010, IEEE Transactions on Reliability.

[21]  Narayanaswamy Balakrishnan,et al.  Statistical inference from start-up demonstration test data , 1993 .