ABSTRACT
We design a 1.75-approximation algorithm for a special case of scheduling parallel machines to minimize the makespan, namely the case where each job can be assigned to at most two machines with the same processing time on either machine. (This is a special case of so-called restricted assignment, where the set of eligible machines can be arbitrary for each job.) We also show that even for this special case it is NP-hart to compute better than 1.5 approximation.
This is the first improvement of the approximation ratio 2 of Lenstra, Shmoys, and Tardos [Approximation algorithms for scheduling unrelated parallel machines, Math. Program. 46:259--271, 1990], for any special case with unbounded number of machines. Our lower bound yields the same ratio as their bound which works for restricted assignment, and which is still the state-of-the-art lower bound even for the most general case.
Index Terms
Graph balancing: a special case of scheduling unrelated parallel machines
Recommendations
Approximation algorithms for the graph balancing problem with two speeds and two job lengths
Consider a set of n jobs and m uniform parallel machines, where each job has a length $$p_j \in {\mathbb {Q}}^+$$pj Q+ and each machine has a speed $$s_i \in {\mathbb {Q}}^+$$si Q+. The goal of the graph balancing problem with speeds is to schedule each ...
Stochastic load balancing on unrelated machines
SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete AlgorithmsWe consider the problem of makespan minimization: i.e., scheduling jobs on machines to minimize the maximum load. For the deterministic case, good approximations are known even when the machines are unrelated. However, the problem is not well-understood ...
Online load balancing on related machines
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingIn this paper, we consider the problem of assigning jobs online to machines with non-uniform speeds (also called related machines) so to optimize a given norm of the machine loads. A long line of work, starting with the seminal work of Graham in the ...
Comments