A GES/TS algorithm for the job shop scheduling

A GES/TS algorithm for the job shop scheduling

0.00 Avg rating0 Votes
Article ID: iaor20122899
Volume: 62
Issue: 4
Start Page Number: 946
End Page Number: 952
Publication Date: May 2012
Journal: Computers & Industrial Engineering
Authors: ,
Keywords: scheduling, heuristics: tabu search, combinatorial optimization
Abstract:

The job shop scheduling problem is a difficult combinatorial optimization problem. This paper presents a hybrid algorithm which combines global equilibrium search, path relinking and tabu search to solve the job shop scheduling problem. The proposed algorithm used biased random sampling to have a better covering of the solution space. In addition, a new version of N6 neighborhood is applied in a tabu search framework. In order to evaluate the algorithm, comprehensive tests are applied to it using various standard benchmark sets. Computational results confirm the effectiveness of the algorithm and its high speed. Besides, 19 new upper bounds among the unsolved problems are found.

Reviews

Required fields are marked *. Your email address will not be published.