Potts, C.

batch algorithm problem dynasearch solution schedule search processing programming algorithm scheduling tardiness value number 1998 john wiley iterated neighborhood descent programming section state tardiness scheduling problem completion time completion processing time machine velde dynasearch algorithm result instance polynomial sequence function job jj objective iterated dynasearch j ∈ x np-hard solution value lemma model multi-start batching machine computation order iterated dynasearch algorithm search algorithms computation time processing times wiley 31–54 partition sched dynasearch swap neighborhood batching fj −1 dynasearch algorithm jobs j 1 polynomial time batches b 1 salesman problem deadline search algorithm polynomial algorithm position speci journal unary block best-improve iteration batch bl performance non-full congram crauwel 2 jma 2 combinatorial optimization problems swap neighborhood j ∈ y release dates objective function