A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.
KeywordsJob-Shop Scheduling Hybrid Metaheuristic Optimised Search Heuristics GRASP Exact Methods
Unable to display preview. Download preview PDF.