Multi-GPU Tabu Search Metaheuristic for the Flexible Job Shop Scheduling Problem

  • Bożejko W
  • Uchroński M
  • Wodecki M
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a new framework of the distributed tabu search metaheuristic designed to be executed using a multi-GPU cluster, i.e. cluster of nodes equipped with GPU computing units. The methodology is designed to solve difficult discrete optimization problems, such as a job shop scheduling problem, which we introduce to solve as a case study for the framework designed.

Cite

CITATION STYLE

APA

Bożejko, W., Uchroński, M., & Wodecki, M. (2014). Multi-GPU Tabu Search Metaheuristic for the Flexible Job Shop Scheduling Problem (pp. 43–60). https://doi.org/10.1007/978-3-319-01436-4_3

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