Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

Chakrabarti, 1996, Improved scheduling algorithms for minsum criteria, 1099

Gonzalez, 1997, Bounds for LPT schedules on uniform processors, SIAM J. Comput., 6, 155, 10.1137/0206013

Graham, 1966, Bounds for certain multiprocessing anomalies, Bell Syst. Tech. J., 45, 1563, 10.1002/j.1538-7305.1966.tb01709.x

Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math., 5, 287, 10.1016/S0167-5060(08)70356-X

Hall, 1997, Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms, Math. Oper. Res., 22, 513, 10.1287/moor.22.3.513

Hall, 1996, Scheduling to minimize average completion time: off-line and on-line algorithms

Hochbaum, 1988, A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach, SIAM J. Comput., 17, 539, 10.1137/0217033

Jaffe, 1980, Efficient scheduling of tasks without full use of processor resources, Theoret. Comput. Sci., 12, 1, 10.1016/0304-3975(80)90002-X

Lenstra, 1978, Complexity of scheduling under precedence constraints, Oper. Res., 26, 22, 10.1287/opre.26.1.22

Lin, 1992, ϵ-approximation with minimum packing constraint violation

Liu, 1974, Bounds on scheduling algorithms for heterogeneous computing systems, 349

A. S. Schulz, Scheduling and Polytopes, Technische Universität Berlin, Berlin, Germany, 1996

Shmoys, 1993, An approximation algorithm for the generalized assignment problem, Math. Programming, 62, 461, 10.1007/BF01585178

Shmoys, 1995, Scheduling parallel machines on-line, SIAM J. Comput., 24, 1313, 10.1137/S0097539793248317