Exact algorithm for task scheduling on N identical processors?
问题 I'm looking for exact algorithm which find the best solution on task schedule in N identical processors. The time of this algorithm is not important, the most important is one best solution (miminum time of all processors when the last task will be finished). In theory equation describing this algorithm is as follows: P||Cmax If anyone has an algorithm (especially in Java) or pseudocode I will be grathefull for help. I tried write my own exact algoritm but id doesn't work :(. In the code