An optimal rounding gives a better approximation for scheduling unrelated machines

Authors:
Evgeny V. Shchepin;Nodari Vakhania
Affiliations:
Steklov Mathematical Institute 117966, Gubkina 8, Moscow, Russia;Science Faculty, State University of Morelos, Av. Universidad 1001, Cuernavaca 62210, Morelos, Mexico and Institute of Computational Mathematics, Akuri 8, Tbilisi 93, GA, USA
Venue:
Operations Research Letters
Year:
2005

Citing 7
Cited 20

A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

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
Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Algorithms for Scheduling Tasks on Unrelated Processors

Journal of the ACM (JACM)
Task Distributions on Multiprocessor Systems

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines

Theoretical Computer Science
Graph balancing: a special case of scheduling unrelated parallel machines

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A note on “An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs”

Information Processing Letters
Efficient Load Balancing on a Cluster for Large Scale Online Video Surveillance

ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
A note on graph balancing problems with restrictions

Information Processing Letters
Size-reduction heuristics for the unrelated parallel machines scheduling problem

Computers and Operations Research
Fast approximation algorithms for job scheduling with processing set restrictions

Theoretical Computer Science
Scheduling jobs with equal processing times subject to machine eligibility constraints

Journal of Scheduling
Santa Claus schedules jobs on unrelated machines

Proceedings of the forty-third annual ACM symposium on Theory of computing
Online scheduling of two job types on a set of multipurpose machines with unit processing times

Computers and Operations Research
Scheduling unit length jobs on parallel machines with lookahead information

Journal of Scheduling
Approximation algorithms for unrelated machine scheduling with an energy budget

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
On the configuration-LP for scheduling on unrelated machines

ESA'11 Proceedings of the 19th European conference on Algorithms
Scheduling unrelated parallel machines computational results

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Local search performance guarantees for restricted related parallel machine scheduling

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Fair cost-sharing methods for scheduling jobs on parallel machines

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
A hierarchical solution approach for a multicommodity distribution problem under a special cost structure

Computers and Operations Research
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times

Journal of Intelligent Manufacturing
The 2-valued case of makespan minimization with assignment constraints

Information Processing Letters
Matching with sizes (or scheduling with processing set restrictions)

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A polynomial-time algorithm is suggested for non-preemptive scheduling of n-independent jobs on m-unrelated machines to minimize the makespan. The algorithm has a worst-case performance ratio of 2-1/m. This is better than the earlier known best performance bound 2. Our approach gives the best possible approximation ratio that can be achieved using the rounding approach.