Nowicki, Eugeniusz; Smutnicki, Czeslaw - In: Management Science 42 (1996) 6, pp. 797-813
A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented. The algorithm is based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions....