A new partial bound enumeration technique for solving reliability redundancy optimization

Microelectronics Reliability

Volumn 37, Issue 2, 1997, Pages 237-242

  Li, Jianping ^a   Jia, Xishen ^a  

^a MECHANICAL ENGINEERING COLLEGE   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; REDUNDANCY; RELIABILITY;

BOUND DYNAMIC PROGRAMMING; MISRA INTEGER PROGRAMMING; PARTIAL BOUND ENUMERATION TECHNIQUE;

ALGORITHMS;

EID: 0031075917     PISSN: 00262714     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0026-2714(96)00109-6     Document Type: Article

References (8)

1. Hamdy A. Taha, Integer programming: theory, application and computation, Academic Press, (1975).
2. E.L. Lawler and M.D.Bell, A method for solving discrete optimization problem, Operations Research, 14, 1098-1112 (1956).
3. K.B. Misra, and U. Sharma, An efficient Algorithm to solve integer-programming problems arising in system-reliability design, IEEE Trans. Reliability, R-40, 81-91 (1991).
4. K.B. Misra., An algorithm to solve integer programming problems: an efficient tool for reliability design, Microelectronics and Reliability, 31, 285-294 (1991).
5. J.P. Li, A bound dynamic programming for solving reliability redundancy optimization, Microelectronics and Reliability, (to appear).
6. J. P. Li, A Bound Heuristic Algorithm For Solving reliability redundancy optimization, Microelectronics and Reliability, (to appear).
7. D.H. Shi, "A new heuristic algorithm for constrained redundancy-optimization in complex systems", IEEE Trans. Reliability, R-36, 1987 Dec, pp621-623.
8. V.K. Srivastava and D.A. Fahim, k-out-of-m system availability with minimum-cost allocation of spares, IEEE Trans. Reliability, R-37, 287-292 (1988).