Solving the Flexible Job Shop Problem on GPU

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.