Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

Authors:
Leah Epstein;Jiri Sgall
Affiliations:
School of Computer Science, The Interdisciplinary Center, Herzliya, Israel;Mathematical Institute, AS CR, Zitná 25, CZ-11567 Praha 1, Czech Republic
Venue:
Algorithmica
Year:
2004

Citing 0
Cited 21

Heuristics for work distribution of a homogeneous parallel dynamic programming scheme on heterogeneous systems

Parallel Computing - Heterogeneous computing
Allocating indivisible goods

ACM SIGecom Exchanges
Online scheduling with machine cost and rejection

Discrete Applied Mathematics
Better bounds for online load balancing on unrelated machines

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Tighter approximation bounds for LPT scheduling in two special cases

Journal of Discrete Algorithms
Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Semi-online machine covering for two uniform machines

Theoretical Computer Science
A deterministic truthful PTAS for scheduling related machines

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Energy efficient scheduling via partial shutdown

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Scheduling with bully selfish jobs

FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Max-min online allocations with a reordering buffer

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A truthful constant approximation for maximizing the minimum load on related machines

WINE'10 Proceedings of the 6th international conference on Internet and network economics
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables

SIAM Journal on Discrete Mathematics
Optimal semi-online algorithm for scheduling with rejection on two uniform machines

Journal of Combinatorial Optimization
Truthful Approximation Schemes for Single-Parameter Agents

SIAM Journal on Computing
A note on semi-online machine covering

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Approximation algorithms for scheduling and packing problems

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximations and auctions for scheduling batches on related machines

Operations Research Letters
A framework for the application of metaheuristics to tasks-to-processors assignation problems

The Journal of Supercomputing
Semi-online scheduling on two identical machines with rejection

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the machine completion times, including minimizing the lp norm of the vector of completion times. This generalizes and simplifies many previous results in this area.