Parallel hybrid metaheuristics for the flexible job shop problem

  • Authors:

  • Wojciech Boejko;Mariusz Uchroński;Mieczysław Wodecki

  • Affiliations:

  • Wrocław University of Technology, Institute of Computer Engineering, Control and Robotics, Janiszewskiego 11-17, 50-372 Wrocław, Poland;Wrocław University of Technology, Institute of Computer Engineering, Control and Robotics, Janiszewskiego 11-17, 50-372 Wrocław, Poland;University of Wrocław, Institute of Computer Science, Joliot-Curie 15, 50-383 Wrocław, Poland

  • Venue:
  • Computers and Industrial Engineering
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A parallel approach to flexible job shop scheduling problem is presented in this paper. We propose two double-level parallel metaheuristic algorithms based on the new method of the neighborhood determination. Algorithms proposed here include two major modules: the machine selection module refer to executed sequentially, and the operation scheduling module executed in parallel. On each level a metaheuristic algorithm is used, therefore we call this method meta^2heuristics. We carry out a computational experiment using Graphics Processing Units (GPU). It was possible to obtain the new best known solutions for the benchmark instances from the literature.