A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
1978
Journal of the ACM
It IS shown that certain problems of optimal preemptive scheduling of unrelated parallel processors can be formulated and solved as hnear programming problems As a by-product of the linear programming formulaUons of these problems, upper bounds are obtained on the number of preempuons required for optimal schedules In particular it is shown that no more than O(m 2) preemptions are necessary, m order to schedule n jobs on m unrelated processors so as to minimize makespan KEY WORDS AND PHRASES
doi:10.1145/322092.322101
fatcat:nz3o4uj6hbf6pnpwdlcqztoyvm