A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion

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:31Z
dc.date.available	2021-01-25T20:51:31Z
dc.date.issued	2010
dc.identifier	10.1109/CEC.2010.5586300
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-79959466769&doi=10.1109%2fCEC.2010.5586300&partnerID=40&md5=ed78bfaba09b324277ae538467793907
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10659
dc.description.abstract	Very recently, Jarboui et al. [1] (Computers & Operations Research 36 (2009) 2638-2646) and Tseng and Lin [2] (European Journal of Operational Research 198 (2009) 84-92) presented a novel estimation distribution algorithm (EDA) and a hybrid genetic local
dc.language.iso	English
dc.publisher	2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
dc.title	A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion
dc.type	Conference Paper
dc.description.affiliations	Department of Industrial Engineering, Yasar University, Izmir, Turkey; School of Computer Science, Liaocheng University, China; School of Electrical and Electronics Engineering, Nanyang Technological University, 639798, Singapore, Singapore; Department of

Files in this item

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