The strategies and parameters of tabu search for job-shop scheduling |
| |
Authors: | Faruk Geyik Ismail Hakki Cedimoglu |
| |
Affiliation: | (1) Industrial Engineering Department, University of Gaziantep, 27310 Gaziantep, Turkey;(2) Industrial Engineering Department, Sakarya University, 54040 Esentepe—Adapazari, Turkey |
| |
Abstract: | This paper presents a tabu search approach for the job-shop scheduling problem. Although the problem is NP-hard, satisfactory solutions have been obtained recently by tabu search. However, tabu search has a problem-specific and parametric structure. Therefore, in the paper, we focussed on the tabu search strategies and parameters such as initial solution, neighborhood structure, tabu list, aspiration criterion, elite solutions list, intensification, diversification and the number of iteration. In order to compare some neighborhood strategies and tabu list length methods, a computational study is done on the benchmark problems. |
| |
Keywords: | Tabu search neighborhood tabu list job-shop scheduling |
本文献已被 SpringerLink 等数据库收录! |
|