Sequential testing policies for complex systems under precedence constraints
暂无分享,去创建一个
Roel Leus | Wenchao Wei | Kris Coolen | R. Leus | Wenchao Wei | K. Coolen | Wenchao Wei
[1] Tonguç Ünlüyurt,et al. Sequential testing of complex systems: a review , 2004, Discret. Appl. Math..
[2] Donald E. Knuth,et al. The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .
[3] Steve Y. Chiu,et al. Optimal Sequential Inspections of Reliability Systems Subject to Parallel-chain Precedence Constraints , 1999, Discret. Appl. Math..
[4] Robert Sedgewick,et al. Algorithms in C - parts 1-4: fundamentals, data structures, sorting, searching (3. ed.) , 1997 .
[5] Erik Demeulemeester,et al. RanGen: A Random Network Generator for Activity-on-the-Node Networks , 2003, J. Sched..
[6] Thomas A. Standish. Data structures, algorithms, and software principles in C , 1994 .
[7] Salam Nassif Salloum. Optimal testing algorithms for symmetric coherent systems. , 1979 .
[8] Marc Lambrecht,et al. Scheduling Markovian PERT networks to maximize the net present value , 2010, Oper. Res. Lett..
[9] Bülent Çatay,et al. TestAnt: An ant colony system approach to sequential testing under precedence constraints , 2011, Expert Syst. Appl..
[10] A. A. Mastor,et al. An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques , 1970 .
[11] Tad Hogg,et al. Refining the Phase Transition in Combinatorial Search , 1996, Artif. Intell..
[12] Rémi Monasson,et al. Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.
[13] M. V. Wilkes,et al. The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .
[14] Melvin A. Breuer,et al. Fast optimal diagnosis procedures for k-out-of-n:G systems , 1997 .
[15] Richard Butterworth. Some Reliability Fault-Testing Models , 1972, Oper. Res..
[16] Endre Boros,et al. Diagnosing double regular systems , 1999, Annals of Mathematics and Artificial Intelligence.
[17] W. Kent Fuchs,et al. Optimal Diagnosis Procedures for k-out-of-n Structures , 1990, IEEE Trans. Computers.
[18] Roel Leus,et al. R&D project scheduling when activities may fail , 2007 .
[19] Piotr Jedrzejowicz. Minimizing the Average Cost of Testing Coherent Systems: Complexity and Approximate Algorithms , 1983, IEEE Transactions on Reliability.
[20] L. A. Cox,et al. Heuristic least-cost computation of discrete classification functions with uncertain argument values , 1990 .
[21] Clyde L. Monma,et al. Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..
[22] M. R. Garey,et al. Optimal task sequencing with precedence constraints , 1973, Discrete Mathematics.
[23] B. Catay,et al. An ant colony algorithm for the sequential testing problem under precedence constraints , 2008, 2008 IEEE International Conference on Service Operations and Logistics, and Informatics.
[24] Yosi Ben-Dov. Optimal Testing Procedures for Special Structures of Coherent Systems , 1981 .
[25] Thomas A. Standish. Data structures, algorithms, and software principles , 1994 .