Generate all permutations of processor-task distribution?

could someone help me with function which check all permutations of task scheduling problem? I have array with task where index is id开发者_如何转开发entity of task and value is task time and array with N processor. I need a functions which generates all possibilites of schedule this taks on that processors.

Since you're looking for an exact algorithm, take a look at the branch and bound algorithm. But since it can take ages anyway, why not simply try every possible combination one by one (brute force)?