Title of article
Optimization models for complex recovery block schemes
Author/Authors
Oded Berman، نويسنده , , U. Dinesh Kumar، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1999
Pages
20
From page
525
To page
544
Abstract
In this paper we consider three complex recovery block schemes: (1) nested recovery block; (2) modified recovery block; and (3) nested consensus recovery block. For all the three models: (1) we derive simple expressions for calculating the system reliability; (2) we investigate how to arrange the versions in a nested recovery block and in a nested consensus recovery block; and (3) we develop optimization models where the objective is to optimize the reliability satisfying a budget constraint. The paper also includes efficient branch and bound procedures to solve the optimization problems. Two numerical example problems are solved to illustrate the branch and bound technique.
Keywords
Software reliability , Branch and Bound , N-version programming , Fault-tolerant software , Complex recovery blocks , Optimization
Journal title
Computers and Operations Research
Serial Year
1999
Journal title
Computers and Operations Research
Record number
927017
Link To Document