Hybrid heuristic shifting bottleneck procedure for parallel-machine job-shop scheduling using GPU

Simple item page
dc.contributor.authorVilasagarapu, S.
dc.contributor.authorGuddeti, G.
dc.date.accessioned2026-02-06T06:39:26Z
dc.date.issued2015
dc.description.abstractIn 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.
dc.identifier.citationProceedings - 2015 5th International Conference on Communication Systems and Network Technologies, CSNT 2015, 2015, Vol., , p. 1318-1322
dc.identifier.urihttps://doi.org/10.1109/CSNT.2015.36
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/32306
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectGPU
dc.subjectHeuristic
dc.subjectJob Shop Scheduling
dc.subjectMeta-heuristics
dc.subjectParallel-Machine
dc.subjectShifting Bottleneck Procedure
dc.titleHybrid heuristic shifting bottleneck procedure for parallel-machine job-shop scheduling using GPU

Files

Collections

Conference Papers