A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
Chapter
Summary
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.
Keywords
Job-Shop Scheduling Hybrid Metaheuristic Optimised Search Heuristics GRASP Exact MethodsPreview
Unable to display preview. Download preview PDF.
Copyright information
© Springer-Verlag Berlin Heidelberg 2008