Approximability of Average Completion Time Scheduling on Unrelated Machines

Authors:
René A. Sitters
Affiliations:
Technische Universiteit Eindhoven,
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 11
Cited 1

Maximum bounded 3-dimensional matching is MAX SNP-complete

Information Processing Letters
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Convex quadratic and semidefinite programming relaxations in scheduling

Journal of the ACM (JACM)
Scheduling Unrelated Machines by Randomized Rounding

SIAM Journal on Discrete Mathematics
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Non-Approximability Results for Scheduling Problems with Minsum Criteria

INFORMS Journal on Computing
A (2 + ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective

Journal of Algorithms
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

SIAM Journal on Computing
Designing PTASs for MIN-SUM scheduling problems

Discrete Applied Mathematics - Special issue: Efficient algorithms
Complexity of preemptive minsum scheduling on unrelated parallel machines

Journal of Algorithms

Minimizing Average Flow Time on Unrelated Machines

Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that minimizing the sum of completion times on unrelated machines is APX-hard if preemption of jobs is allowed. Additionally, we show that randomized rounding of a convex quadratic program gives a non-preemptive schedule for which the sum of weighted completion times is less than 1.81 times the optimal preemptive sum. This factor is 2.78 if release dates are involved. We sketch how the ratios can be reduced further.