Please use this identifier to cite or link to this item:
|Title:||A comparative study of algorithms for the flowshop scheduling problem||Authors:||Liu, S.
|Issue Date:||Nov-2002||Citation:||Liu, S.,Ong, H.L. (2002-11). A comparative study of algorithms for the flowshop scheduling problem. Asia-Pacific Journal of Operational Research 19 (2) : 205-222. ScholarBank@NUS Repository.||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.||Source Title:||Asia-Pacific Journal of Operational Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/53967||ISSN:||02175959|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.