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

1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Bozejko, W., Uchroński, M., & Wodecki, M. (2012). Parallel cost function determination on GPU for the job shop scheduling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7204 LNCS, pp. 1–10). https://doi.org/10.1007/978-3-642-31500-8_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free