TY - CHAP A1 - Metlicka, Magdalena A1 - Davendra, Donald A1 - Herrmann, Frank A1 - Meier, Markus A1 - Amann, Matthias T1 - GPU accelerated NEH algorithm T2 - Proceedings of the 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS), Orlando, FL, 09.-12. Dec. 2014 N2 - This research aims to develop a CUDA accelerated NEH algorithm for the permutative flowshop scheduling problem with makespan criterion. NEH has been shown in the literature as the best constructive heuristic for this particular problem. The CUDA based NEH aims to speed up the processing time by utilising the GPU cores for parallel evaluation. In order to show the versatility and scalability of the CUDA based NEH, four new higher dimensional Taillard sets are generated. The experiments are conducted on the CPU and GPU and pairwise compared. Percentage relative difference and paired t-test both confirm that the GPU based NEH significantly improves on the execution time compared to the sequential CPU version for all the high dimensional problem instances. KW - Flow-shop-Problem KW - CUDA KW - Graphics processing units KW - Instruction sets KW - Kernel KW - Parallel processing KW - Synchronization KW - Algorithm design and analysis KW - Arrays KW - Parallelverarbeitung Y1 - 2014 U6 - https://doi.org/10.1109/CIPLS.2014.7007169 SP - 114 EP - 119 ER -