Job-shop scheduling heuristics with local neighbourhood search
- 1 November 1979
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 17 (6) , 507-526
- https://doi.org/10.1080/00207547908919634
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- Theoretical comparisons of search strategies in branch-and-bound algorithmsInternational Journal of Parallel Programming, 1976
- An Implicit Enumeration Algorithm for the Machine Sequencing ProblemManagement Science, 1971
- A Generalized Machine-Scheduling AlgorithmJournal of the Operational Research Society, 1970