A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Suganthan, P.N.
dc.contributor.author	Chen, A.H.L.
dc.date.accessioned	2021-01-25T20:51:17Z
dc.date.available	2021-01-25T20:51:17Z
dc.date.issued	2011
dc.identifier	10.1016/j.ins.2011.04.018
dc.identifier.issn	00200255
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-79957526144&doi=10.1016%2fj.ins.2011.04.018&partnerID=40&md5=88bd48159bcb0b8bd89836053b3e14f1
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10617
dc.description.abstract	Obtaining an optimal solution for a permutation flowshop scheduling problem with the total flowtime criterion in a reasonable computational timeframe using traditional approaches and optimization tools has been a challenge. This paper presents a discrete
dc.language.iso	English
dc.publisher	Information Sciences
dc.title	A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
dc.type	Article
dc.relation.firstpage	3459
dc.relation.lastpage	3475
dc.relation.volume	181
dc.relation.issue	16
dc.description.affiliations	Department of Industrial Engineering, Yasar University, Bornova, Izmir, Turkey; College of Computer Science, Liaocheng University, Liaocheng, 252059, China; School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Sing

Files in this item

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