| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1135102 | Computers & Industrial Engineering | 2012 | 7 Pages |
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.
► The algorithm combines global equilibrium search, path relinking and tabu search. ► Three different neighborhood structures are used. ► 19 New upper bounds are found for well known benchmark problems. ► The upper bounds found for Taillard problems are available at his website.
