Fault-tolerant scheduling on parallel systems with non-memoryless failure distributions
If failure rates are decreasing, we prove that makespan and reliability are antagonistic. As there is no single optimal solution, we design an algorithm for computing the approximation set of the Pareto front. If failure rates are increasing, both makespan and reliability can be optimized at the same time. We prove that the scheduling problem can be solved optimally for several common failure distributions, such as Weibull.
scheduling reliability fault tolerance multi-objective optimization