Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/53967
DC FieldValue
dc.titleA comparative study of algorithms for the flowshop scheduling problem
dc.contributor.authorLiu, S.
dc.contributor.authorOng, H.L.
dc.date.accessioned2014-06-16T09:24:35Z
dc.date.available2014-06-16T09:24:35Z
dc.date.issued2002-11
dc.identifier.citationLiu, 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.
dc.identifier.issn02175959
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/53967
dc.description.abstractIn 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.
dc.sourceScopus
dc.subjectGeneral flowshop
dc.subjectMachine scheduling
dc.subjectMakespan
dc.subjectMeta-heuristic
dc.subjectNeighborhood structure
dc.subjectPermutation flowshop
dc.typeArticle
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.sourcetitleAsia-Pacific Journal of Operational Research
dc.description.volume19
dc.description.issue2
dc.description.page205-222
dc.description.codenAPJRE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

71
checked on May 23, 2019

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.