Abstract
We study the scheduling of n independent jobs on m parallel identical processors. Using dynamic programming, the paper presents an algorithm to determine the optimal schedule for medium size problems with quite general cost functions. The application of the algorithm is illustrated by numerical examples.