Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths.

S. Thomas McCormick Scott R. Smallwood Frits C. R. Spieksma

Published in: SODA (1997)

Keyphrases

small number
computational cost
computationally efficient
combinatorial optimization
data structure
optimization problems
computationally expensive
computational complexity
worst case
theoretical analysis
benchmark datasets
orders of magnitude