Chapter

Recent Advances in Evolutionary Computation for Combinatorial Optimization

Volume 153 of the series Studies in Computational Intelligence pp 203-218

A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem

  • Susana FernandesAffiliated withUniversidade do Algarve
  • , Helena R. LourençoAffiliated withUnivertitat Pompeu Fabra

* Final gross prices may vary according to local VAT.

Get Access

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 Methods