An iterated local search algorithm for distributed assembly permutation flowshop problem

dc.contributor.author	Huang, Y.Y.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Hu, X.
dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Huang, J.P.
dc.contributor.editor
dc.date.accessioned	2021-01-25T20:47:56Z
dc.date.available	2021-01-25T20:47:56Z
dc.date.issued	2020
dc.identifier	10.23919/CCC50068.2020.9188683
dc.identifier.issn	19341768
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091398703&doi=10.23919%2fCCC50068.2020.9188683&partnerID=40&md5=af75feaa6c8e366e10d8000a8597366e
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/9619
dc.description.abstract	Nowadays, the distributed assembly permutation flowshop problem (DAPFSP) has important applications in practice. In this paper, we propose a group iterated local search (gILS) algorithm to solve the problem with total flowtime (TF) criterion. We use the h
dc.language.iso	English
dc.publisher	Chinese Control Conference, CCC
dc.title	An iterated local search algorithm for distributed assembly permutation flowshop problem
dc.type	Conference Paper
dc.relation.firstpage	1548
dc.relation.lastpage	1552
dc.relation.volume	2020-July
dc.description.affiliations	Shanghai University, School of Mechanical and Electrical Engineering and Automation, Shanghai, 200444, China; China Rural Technology Development Center, Peking, 100045, China; Yasar University, International Logistics Management Department, Izmir, Turkey

Files in this item

Files	Size	Format	View
There are no files associated with this item.