Scheduling independent tasks on uniform processors
SIAM Journal on Computing
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
On the exact upper bound for the MULTIFIT processor scheduling algorithm
Annals of Operations Research
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Journal of the ACM (JACM)
Algorithms for Scheduling Tasks on Unrelated Processors
Journal of the ACM (JACM)
On load-balanced semi-matchings for weighted bipartite graphs
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
On the load-balanced demand points assignment problem in large-scale wireless LANs
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
An optimal rounding gives a better approximation for scheduling unrelated machines
Operations Research Letters
| Hi-index | 0.00 |
We consider the problem of scheduling of n independent jobs on m unrelated machines to minimize the max(t1, t2, ..., tm), ti being the completion time of machine i. In [1] was suggested a polynomial 2- approximation algorithm for this problem. It was also proved that there can exist no polynomial 1:5-approximation algorithm unless P = NP. Here we improve this earlier performance bound 2 to 2- 1/m. In [1] is also proved a general rounding theorem, which allows to construct in polynomial time 1-job approximations to the optimum, i.e. schedules with an absolute bound equal to the largest job processing time. We also improve this result and obtain (1 - 1/m)-job approximation to optimal.