Skip to main content

Parallel Cost Function Determination on GPU for the Job Shop Scheduling Problem

  • Conference paper
  • 1703 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7204)

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.

Keywords

  • Operation Execution
  • Disjunctive Graph
  • Parallel Random Access Machine
  • Crew PRAMs
  • OpenCL Implementation

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bożejko, W.: A new class of parallel scheduling algorithms. Monographs series. Wroclaw University of Technology Publishing House (2010)

    Google Scholar 

  2. Bożejko, W., Pempera, J., Smutnicki, C.: Parallel Simulated Annealing for the Job Shop Scheduling Problem. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2009, Part I. LNCS, vol. 5544, pp. 631–640. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  3. Bożejko, W.: Solving the flow shop problem by parallel programming. Journal of Parallel and Distributed Computing 69, 470–481 (2009)

    CrossRef  Google Scholar 

  4. Lawrence, S.: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Graduate school of industrial administration. Carnegie Mellon University, Pittsburgh (1984)

    Google Scholar 

  5. Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the job shop problem. Management Science 42, 797–813 (1996)

    CrossRef  MATH  Google Scholar 

  6. Steinhöfel, K., Albrecht, A., Wong, C.K.: Fast parallel heuristics for the job shop scheduling problem. Computers & Operations Research 29, 151–169 (2002)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Taillard, E.D.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)

    CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bożejko, W., Uchroński, M., Wodecki, M. (2012). Parallel Cost Function Determination on GPU for the Job Shop Scheduling Problem. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2011. Lecture Notes in Computer Science, vol 7204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31500-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31500-8_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31499-5

  • Online ISBN: 978-3-642-31500-8

  • eBook Packages: Computer ScienceComputer Science (R0)