A (2 + ε)-approximation for scheduling parallel jobs in platforms

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider the problem of Scheduling parallel Jobs in heterogeneous Platforms: We are given a set J = {1,..., n} of n jobs, where a job j ∈ J is described by a pair (pj,qj) of a processing time p j ∈ ℚ>0 and the number of processors required qj ∈ ℕ. We are also given a set B of N heterogeneous platforms P1,...,PN, where each Pi contains mi processors for i ∈ {1,..., N}. The objective is to find a schedule for the jobs in the platforms minimizing the makespan. Unless P = NP there is no approximation algorithm with absolute ratio strictly better than 2 for the problem. We give a (2 + ε)-approximation for the problem improving the previously best known approximation ratio. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Dutot, P. F., Jansen, K., Robenek, C., & Trystram, D. (2013). A (2 + ε)-approximation for scheduling parallel jobs in platforms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8097 LNCS, pp. 78–89). https://doi.org/10.1007/978-3-642-40047-6_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free