Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem

From MaRDI portal
Publication:2489308


DOI10.1016/j.cor.2005.07.016zbMath1086.90066MaRDI QIDQ2489308

Jean-Paul Watson, L. Darrell Whitley, Adele E. Howe

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.016


90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming


Related Items


Uses Software


Cites Work