Veldman, B.

problem partition schedule completion time processing processor instance completion sense np-hard proof number 3- partition length scheduling precedence constraints processing time complexity theorem scheduling multiprocessor tasks task jj release dates partition tasks multiprocessor biprocessor makespan threshold precedence unit processing times biprocessor task reduction constraint release processing time b integer collection completion times task l even-odd partition subset answer 259-272 processing time p m partition tasks element task k 1 lccj addition blazewicz programming value execution polynomial time processing times section algorithm allocation lenstra block-constraint variable p 2 ichain biprocessor tasks abc-schedule schedule 0 task p polynomial rinnooy kan decision integer programming formulation even-odd decision variant processing time pj element aj n partition tasks np-complete mathematics formulation np-hardnes approach version