Abstract
In this work we examine a model of flexible job shop problem in which for a given operation there is a possibility of a choice of the machine on which this operation will be carried out. This problem is a generalization of the classic job shop problem. We present a tabu search algorithm in which "a golf neighborhood" was applied. Because it is a huge neighborhood, the concurrent programming tools based on GPU platform were thus used to its searching. The computational results indicate that by acceleration of computations with the utilization of GPU one obtains very good values of a speedup. Computational experiments executed on benchmark instances show the efficiency of this approach. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Bozejko, W., Uchroński, M., & Wodecki, M. (2012). Solving the flexible job shop problem on GPU. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7268 LNAI, pp. 387–394). Springer Verlag. https://doi.org/10.1007/978-3-642-29350-4_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
