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

DOI10.1016/S0167-6377(98)00012-1zbMath0967.90050OpenAlexW2150736907MaRDI QIDQ1306465

Petra Schuurman

Publication date: 3 September 2001

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00012-1

zbMATH Keywords

single-machine schedulingpolynomial approximationpseudo-polynomial algorithmminimum delaysprecedence delays

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM ⋮ Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.

Cites Work

• One-machine generalized precedence constrained scheduling problems

This page was built for publication: A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays