On the Approximability of Average Completion Time Scheduling under Precedence Constraints

Authors:
Gerhard J. Woeginger
Affiliations:
-
Venue:
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Year:
2001

Citing 5
Cited 1

Formulating the single machine sequencing problem with release dates as a mixed integer program

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine

Discrete Applied Mathematics
Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler

SIAM Journal on Discrete Mathematics
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine

Operations Research Letters

Partially-Ordered Knapsack and Applications to Scheduling

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with arbitrary job weights, the special case of the problem where all job weights are one, and several other special cases of the problem all have the same approximability threshold with respect to polynomial time approximation algorithms. Moreover, for the special case of interval order precedence constraints and for the special case of convex bipartite precedence constraints, we give a polynomial time approximation algorithm with worst case performance guarantee arbitrarily close to the golden ratio 2/1 (1 + √5) ≅ 1:61803.