论文信息 - A min‐sum 3/2‐approximation algorithm for scheduling unrelated parallel machines - 字舞流文

A min‐sum 3/2‐approximation algorithm for scheduling unrelated parallel machines

Fabián A. Chudak

[1] W. A. Horn. Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..

[2] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[3] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .

[4] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[5] David B. Shmoys,et al. Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..