.png){kind=icon}
.png){kind=icon}
Return
Parallel tabu search algorithm for the hybrid flow shop problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2013.04.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The paper deals with the parallel variant of the scheduling algorithm dedicated to the hybrid flow shop problem. The problem derives from practice of automated manufacturing lines, e.g. for printed packages. The overall goal is to design a new algorithm which merges the performance of the best known sequential approach with the efficient exploitation of parallel calculation environments. In order to fulfill the above aim, there are two methods proposed in this paper: the original fast method of parallel calculation of the criterion function and the local neighborhood parallel search method embedded in the tabu search approach. The theoretical analysis, as well as the original implementation, with the use of vector processing instructions SSE2 supported by suitable data organization, are presented below. Numerical properties of the proposed algorithm are empirically verified on the multi-core processor. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Parallel metaheuristics
Scheduling
Hybrid flow shop
Tabu search
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W