P2|rj;pmtn;pj=p|Σ Cj

The special case for a fixed number of m=2 machines was solved by Herrbach and Leung in time O(n log n). It is a greedy algorithm with small backtrack. It can easily be transformed into an online algorithm with constant lookahead.

We implemented it with the fixed values nb jobs=10, nb machines=2, equal processing time=60. You can change the release times by dragging the scrollbars.

Are you seeing something?