Flexible job shop problem – parallel tabu search algorithm for multi-GPU
2012 ◽
Vol 22
(4)
◽
pp. 389-397
◽
Keyword(s):
Job Shop
◽
In the paper we propose a new framework for the distributed tabu search algorithm designed to be executed with the use of a multi-GPU cluster, in which cluster of nodes are equipped with multicore GPU computing units. The proposed methodology is designed specially to solve difficult discrete optimization problems, such as a flexible job shop scheduling problem, which we introduce as a case study used to analyze the efficiency of the designed synchronous algorithm.
2010 ◽
Vol 59
(4)
◽
pp. 647-662
◽
2011 ◽
Vol 49
(23)
◽
pp. 6963-6980
◽
2010 ◽
Vol 52
(5-8)
◽
pp. 683-697
◽
2015 ◽
Vol 12
(2)
◽
pp. 703-717
◽