Job-shop scheduling heuristics with local neighbourhood search

This paper investigates the suitability and performance of local-neighbourhood-search-based heuristics for job-shop scheduling problems. A procedure is developed which provides an objective assessment in terms of average and worst-case performance in relation to the computational complexity of the problem and the speed of the tree search. Solution improvements models and stopping rules are suggested.