摘要

System reliability, especially for serial parallel systems, has attracted much attention in recent years. Redundancy allocation is a technique to increase the reliability of the serial parallel systems. Supplying redundant components depends on some restrictions such as available budget, weight, space, etc. This paper proposes a new model for redundancy allocation problems (RAPs) by considering discount policy. The proposed model attempts to maximize the reliability of a system by gathering various components where there are some limitations on budgeting. We present two models with different assumptions including all unit discount and incremental discount strategies. The resulted formulations are nonlinear integer models and categorized as NP-hard. Therefore, some heuristics and meta-heuristics are designed to solve the resulted models, efficiently.

  • 出版日期2014-2-1