论文信息 - Bounds on Schedules for Independent Tasks with Similar Execution Times

Bounds on Schedules for Independent Tasks with Similar Execution Times

An open problem by Graham is solved. The problem considered is that of scheduling a set of n independent tasks nonpreemptively on m identical processors to minimize finish time. Let a.,o and ~o be the finish times of an optimal schedule and an arbitrary list schedule, respectively. The worst possible behavior of o~/w0 for tasks with similar execution times is investigated.

Francis Y. L. Chin | James O. Achugbue | F. Chin

[1] Ronald L. Graham,et al. Bounds on multiprocessing anomalies and related packing algorithms , 1972, AFIPS '72 (Spring).

[2] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[3] Mario J. Gonzalez. Deterministic Processor Scheduling , 1977, CSUR.

[4] Journal of the Association for Computing Machinery , 1961, Nature.

[5] Edward G. Coffman,et al. Computer and job-shop scheduling theory , 1976 .

[6] Glenn K. Manacher,et al. Production and Stabilization of Real-Time Task Schedules , 1967, JACM.