Minimum–Maximum regret redundancy allocation with the choice of redundancy strategy and multiple choice of component type under uncertainty

Comparative analysis of standby systems with unreliable server and switching failure

“…Hsu et al [4] then investigated the profit analysis of the machine repair problem with switching failure and reboot delay, where they used the probabilistic global search Lausanne (PGSL) method to derive the joint optimal parameter values to maximize the profit and satisfy the availability constraint. Furthermore, Sadjadi and Soltani [12] explained the redundancy allocation problems in series-parallel systems with the choice of redundancy strategy where the components' time to failure follows an Erlang distribution. The switching from the cold standby components to the active components is imperfect.…”

Robust counterpart optimization for the redundancy allocation problem in series-parallel systems with component mixing under uncertainty

“…Regarding regret-based methods, Feizollahi and Modarres [32], Soltani et al [33] and Sadjadi and Soltani [44] considered series-parallel systems with respectively active, cold standby and a choice of redundancy strategies considering interval uncertainty for reliability of components and used the Min-Max regret criterion as a robustness measure to deal with interval uncertainty.…”

Solving the redundancy allocation problem with multiple strategy choices using a new simplified particle swarm optimization

“…The results show that using the mixed strategies would obtain higher reliabilities than considering the active strategy only. In a new study, Sadjadi and Soltani [30] introduced the Min-Max regret criterion to formulate the imprecise scale parameters of each component. The parameters are also described as intervals with known lower and upper bounds.…”