A comparative study of algorithms for the flowshop scheduling problem

A comparative study of algorithms for the flowshop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20032772
Country: Singapore
Volume: 19
Issue: 2
Start Page Number: 205
End Page Number: 222
Publication Date: Nov 2002
Journal: Asia-Pacific Journal of Operational Research
Authors: ,
Keywords: heuristics
Abstract:

In this paper, we propose three meta-heuristic algorithms for the permutation flowshop (PFS) and the general flowshop (GFS) problems. Two different neighborhood structures are used for these two types of flowshop problem. For the PFS problem, an insertion neighborhood structure is used, while for the GFS problem, a critical-path neighborhood structure is adopted. To evaluate the performance of the proposed algorithms, two sets of problem instances are tested against the algorithms for both types of flowshop problems. The computational results show that the proposed meta-heuristic algorithms with insertion neighborhood for the PFS problem perform slightly better than the corresponding algorithms with critical-path neighborhood for the GFS problem. But in terms of computation time, the GFS algorithms are faster than the corresponding PFS algorithms.

Reviews

Required fields are marked *. Your email address will not be published.