Tautenhahn, T.

batch schedule algorithm problem processing 1998 john wiley completion time programming algorithm state completion processing time number function programming scheduling machine job jj section polynomial objective j ∈ x np-hard lemma model batching machine solution processing times wiley 31–54 partition sched batching fj −1 jobs j 1 batches b 1 deadline polynomial algorithm value unary block batch bl non-full 2 jma 2 release dates j ∈ y objective function recursion latenes non-full batches proof batch bj b jobs time algorithm complexity spt-batch increase job release dates brucker instance release state variables makespan jobs jj order tardiness respect result indices light spt-batch schedule lateness lmax 3 m batches n − j unary np-hard ÿ rst batch spt-batch schedules space jj ∈ bj jobs jk batch b 1