A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem

  • Susana Fernandes
  • Helena R. Lourenço
Part of the Studies in Computational Intelligence book series (SCI, volume 153)

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Susana Fernandes
    • 1
  • Helena R. Lourenço
    • 2
  1. 1.Universidade do AlgarveFaroPortugal
  2. 2.Univertitat Pompeu FabraBarcelonaSpain

Personalised recommendations