A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling

  • Susana Fernandes
  • Helena R. Lourenço
Conference paper

DOI: 10.1007/978-3-540-71615-0_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4446)
Cite this paper as:
Fernandes S., Lourenço H.R. (2007) A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling. In: Cotta C., van Hemert J. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2007. Lecture Notes in Computer Science, vol 4446. Springer, Berlin, Heidelberg

Abstract

This paper presents a simple algorithm for the job shop scheduling problem that combines the local search heuristic GRASP with a branch-and-bound exact method of integer programming. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Susana Fernandes
    • 1
  • Helena R. Lourenço
    • 2
  1. 1.Universidade do Algarve, FaroPortugal
  2. 2.Universitat Pompeu Fabra, BarcelonaSpain

Personalised recommendations