A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays

Authors:
Petra Schuurman
Affiliations:
Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O.Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Operations Research Letters
Year:
1998

Citing 1
Cited 1

One-machine generalized precedence constrained scheduling problems

Operations Research Letters

Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate a single-machine scheduling problem with precedence delays that have a simple structure: the corresponding tree has k leaves and only k+2 nodes. The objective is to minimize the makespan. We present a pseudo-polynomial algorithm for this problem, and we also give a fully polynomial approximation scheme.