A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling
- 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
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.
Unable to display preview. Download preview PDF.