A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion

dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Suganthan, P.N.
dc.contributor.author	Oner, A.
dc.date.accessioned	2021-01-25T20:50:39Z
dc.date.available	2021-01-25T20:50:39Z
dc.date.issued	2013
dc.identifier	10.1016/j.apm.2013.02.011
dc.identifier.issn	0307904X
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84878203450&doi=10.1016%2fj.apm.2013.02.011&partnerID=40&md5=d8eb430efdfdda70d99731834758fdcb
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10505
dc.description.abstract	In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant of the well-known permutation flows
dc.language.iso	English
dc.publisher	Applied Mathematical Modelling
dc.title	A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
dc.type	Article
dc.relation.firstpage	6758
dc.relation.lastpage	6779
dc.relation.volume	37
dc.relation.issue	10-11
dc.description.affiliations	Industrial Engineering Department, Yasar University, Bornova, Izmir, Turkey; College of Computer Science, Liaocheng University, China; School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapore

Files in this item

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