论文信息 - A comment on scheduling on uniform machines under chain-type precedence constraints

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

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.

Gerhard J. Woeginger

[1] Michael A. Bender,et al. An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines , 1998, IPCO.

[2] Fabián A. Chudak,et al. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.

[3] David P. Williamson,et al. Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4] Oscar H. Ibarra,et al. Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

[5] Eugene L. Lawler,et al. Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[6] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[7] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .