An algorithm which schedules forests of n tasks on m identical processors in O ( n log m ) time, offline, is given. The schedules are optimal with respect to finish time and contain at most n - 2 preemptions, a bound which is realized for all n . Also given is a simpler algorithm which runs in O ( nm ) time on the same problem and can be adapted to give optimal finish time schedules on-line for independent tasks with release times.
No takes yet. Share an insight, caveat, or question.
Gonzalez et al. (1980) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: