Approximation algorithms for the graph balancing problem with two speeds and two job lengths

摘要

Consider a set of n jobs and in uniform parallel machines, where each job has a length p(j )is an element of Q(+) and each machine has a speed s(i) is an element of Q(+). The goal of the graph balancing problem with speeds is to schedule each job j non-preemptively on one of a subset M-j of at most 2 machines so that the makespan is minimized. This is a NP-hard special case of the makespan minimization problem on unrelated parallel machines, where for the latter a longstanding open problem is to find an approximation algorithm with approximation ratio better than 2. Our main contribution is an approximation algorithm for the graph balancing problem with two speeds and two job lengths with approximation ratio (root 65+7)/8 approximate to 1.88278. In addition, we consider when every M-j has no cardinality constraints, this is the restricted assignment problem in the uniform parallel machine setting. We present a simple (2 - alpha/beta)-approximation algorithm in this case when every job has one of two job lengths p(j) is an element of {alpha, beta} where alpha < beta.