Congram, R.

algorithm dynasearch solution search problem iterated neighborhood tardiness descent tardiness scheduling problem value velde dynasearch algorithm sequence scheduling iterated dynasearch result instance section multi-start programming algorithm computation number iterated dynasearch algorithm search algorithms computation time dynasearch swap neighborhood programming dynasearch algorithm salesman problem search algorithm position journal solution value best-improve iteration performance congram crauwel combinatorial optimization problems swap neighborhood heuristic speedup winter computation times tardiness problem fi rst salesman velde 100- job instances table processing approach fi rst-improve order quality permutation rst-improve descent algorithm optimization study non-late descent algorithms tabu search algorithm research swap moves edd order polynomial time ni arpd mrpd solution values machine tabu search search heuristics iterated versions parameter speci fically wassenhove non-late jobs jobs i candidate value speci