Solving the flexible job shop problem on GPU

Authors:
Wojciech Bożejko;Mariusz Uchroński;Mieczysław Wodecki
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland and Wrocław Centre of Networking and Supercomputing, Wrocław, Poland;Institute of Computer Science, University of Wrocław, Wrocław, Poland
Venue:
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Year:
2012

Citing 5
Cited 0

Routing and scheduling in a flexible job shop by tabu search

Annals of Operations Research - Special issue on Tabu search
Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)

Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Parallel hybrid metaheuristics for the flexible job shop problem

Computers and Industrial Engineering
On the theoretical properties of swap multimoves

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.