Parallel cost function determination on GPU for the job shop scheduling problem

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, Wrocław Centre of Networking and Supercomputing, Wrocław, Poland;Institute of Computer Science, University of Wrocław, Wrocław, Poland
Venue:
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Year:
2011

Citing 4
Cited 0

A fast taboo search algorithm for the job shop problem

Management Science
Fast parallel heuristics for the job shop scheduling problem

Computers and Operations Research
Solving the flow shop problem by parallel programming

Journal of Parallel and Distributed Computing
Parallel Simulated Annealing for the Job Shop Scheduling Problem

ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of this paper is to propose a methodology of the effective cost function determination for the job shop scheduling problem in parallel computing environment. Parallel Random Access Machine (PRAM) model is applied for the theoretical analysis of algorithm efficiency. The methods need a fine-grained parallelization, therefore the approach proposed is especially devoted to parallel computing systems with fast shared memory. The methods proposed are tested with CUDA and OpenCL and ran on NVidia and ATI GPUs.