Parallel hybrid metaheuristics for the flexible job shop problem
Wroclaw University of Technology, Institute of Computer Engineering, Control and Robotics, Janiszewskiego 11-17, 50-372 Wroclaw, Poland
Computers & Industrial Engineering, Volume 59, Issue 2, September 2010, Pages 323-333 (10 May 2010)
@article{bozejko2010parallel,
title={Parallel hybrid metaheuristics for the flexible job shop problem},
author={Bozejko, W. and Uchronski, M. and Wodecki, M.},
journal={Computers & Industrial Engineering},
issn={0360-8352},
year={2010},
publisher={Elsevier}
}
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 2 heuristics. 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.
November 19, 2010 by hgpu
