A comment on scheduling on uniform machines under chain-type precedence constraints

Authors:
Gerhard J. Woeginger
Affiliations:
Institut für Mathematik B, TU Graz, Steyrergasse 30, A-8010 Graz, Austria
Venue:
Operations Research Letters
Year:
2000

Citing 3
Cited 3

Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
Scheduling Parallel Machines On-line

SIAM Journal on Computing
Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Optimal and online preemptive scheduling on uniformly related machines

Journal of Scheduling
Scheduling of uniform parallel machines with s-precedence constraints

Mathematical and Computer Modelling: An International Journal
Algorithms with limited number of preemptions for scheduling on parallel machines

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recent paper, Chekuri and Bender (Proceedings of IPCO'98, pp. 383-393) derive (among other results) a polynomial-time 6-approximation algorithm for makespan minimization on uniform parallel machines subject to chain-type precedence constraints. In this short note, we combine some straightforward observations and thereby derive an extremely simple 2-approximation algorithm for this problem.