EXACT AND APPROXIMATE ALGORITHMS FOR SCHEDULING NONIDENTICAL PROCESSORS

[1] SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J]. COMMUNICATIONS OF THE ACM, 1974, 17 (07) : 382 - 387

[2] BRUNO J, 1974, ALGORITHMS MINIMIZIN, P504

[3] COFFMAN EG, 1974, ALGORITHMS MINIMIZIN

[4] Conway R, 1967, THEORY SCHEDULING

[5] BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) : 416 - &

[6] COMPUTING PARTITIONS WITH APPLICATIONS TO KNAPSACK PROBLEM [J]. JOURNAL OF THE ACM, 1974, 21 (02) : 277 - 292

[7] IBARRA OH, 1974, 7413 U MINN COMP SCI

[8] Karp Richard M., 1972, COMPLEXITY COMPUTER, P85

[9] Knuth D. E., 1973, ART COMPUTER PROGRAM

[10] CHARACTERIZATION AND THEORETICAL COMPARISON OF BRANCH-AND-BOUND ALGORITHMS FOR PERMUTATION PROBLEMS [J]. JOURNAL OF THE ACM, 1974, 21 (01) : 140 - 156

[1] SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J]. COMMUNICATIONS OF THE ACM, 1974, 17 (07) : 382 - 387

[2] BRUNO J, 1974, ALGORITHMS MINIMIZIN, P504

[3] COFFMAN EG, 1974, ALGORITHMS MINIMIZIN

[4] Conway R, 1967, THEORY SCHEDULING

[5] BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) : 416 - &

[6] COMPUTING PARTITIONS WITH APPLICATIONS TO KNAPSACK PROBLEM [J]. JOURNAL OF THE ACM, 1974, 21 (02) : 277 - 292

[7] IBARRA OH, 1974, 7413 U MINN COMP SCI

[8] Karp Richard M., 1972, COMPLEXITY COMPUTER, P85

[9] Knuth D. E., 1973, ART COMPUTER PROGRAM

[10] CHARACTERIZATION AND THEORETICAL COMPARISON OF BRANCH-AND-BOUND ALGORITHMS FOR PERMUTATION PROBLEMS [J]. JOURNAL OF THE ACM, 1974, 21 (01) : 140 - 156