The problem to be addressed is one of scheduling multiprocessor tasks,
some of which require more than one processor at a time. We extend th
is model by introducing a uniform k-processor system consisting of k-t
uples of processors having the same speeds. A low order polynomial-tim
e preemptive scheduling algorithms is proposed when schedule length is
the performance measure.