Please use this identifier to cite or link to this item:
|Title:||Hybrid heuristic shifting bottleneck procedure for parallel-machine job-shop scheduling using GPU|
Ram Mohana Reddy, Guddeti
|Citation:||Proceedings - 2015 5th International Conference on Communication Systems and Network Technologies, CSNT 2015, 2015, Vol., , pp.1318-1322|
|Abstract:||In this paper, we implement the Parallel-Machine Job Shop Scheduling Problem (JSSP) using the modified shifting bottleneck procedure along with the heuristic Tabu search algorithm. JSSP has several real-time applications such as product manufacturing units, real-world train scheduling problem etc., Since JSSP is an NP hard problem, an optimal solution may not exist hence with the help of heuristic algorithm we try to find the approximate solution. Experimental results demonstrate that the modified shifting bottleneck procedure (SBP) shows better results than the existing SBP. And also with the help of meta-heuristic algorithm, the JSSP for larger instances can be solved easily. Results also demonstrate that GPU based Tabu search is on an average 1.8 times faster than CPU based Tabu search. � 2015 IEEE.|
|Appears in Collections:||2. Conference Papers|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.