Answers are grounded in this paper and cite their sources.
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
No takes yet. Share an insight, caveat, or question.
Lawler et al. (1978) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: