A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
From MaRDI portal
Publication:1306465
DOI10.1016/S0167-6377(98)00012-1zbMath0967.90050MaRDI QIDQ1306465
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
single-machine scheduling; polynomial approximation; pseudo-polynomial algorithm; minimum delays; precedence delays
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay., APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM
Cites Work