Scheduling unrelated machines with costs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
IEEE Transactions on Parallel and Distributed Systems
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scheduling Problems with Two Competing Agents
Operations Research
Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
Energy-Efficient algorithms for flow time minimization
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Journal of Parallel and Distributed Computing
Reliability and performance optimization of pipelined real-time systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-objective analysis, namely simultaneous optimization of the makespan and the reliability. We show that this problem can not be approximated by a single schedule. A similar problem has already been studied leading to a $\big$-approximation algorithm (i.e.for any fixed value of the makespan, the obtained solution is optimal on the reliability and no more than twice the given makespan). We provide an algorithm which has a much lower complexity. This solution is finally used to derive a (2 + 茂戮驴, 1)-approximation of the Pareto set of the problem, for any 茂戮驴 0.