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-25T19:36:18Z
dc.date.available	2021-01-25T19:36:18Z
dc.date.issued	2010
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/8298
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.description.sponsorship	National Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [60874075, 70871065, 60905039]; Science Research and Development of Provincial Department of Public Education of Shandong [J09LG29]
dc.language.iso	English
dc.publisher	IEEE
dc.title	A Discrete Artificial Bee Colony Algorithm for the Permutation Flow Shop Scheduling Problem with Total Flowtime Criterion
dc.type	Proceedings Paper
dc.description.woscategory	Engineering, Electrical & Electronic; Mathematical & Computational Biology
dc.description.wosresearcharea	Engineering; Mathematical & Computational Biology
dc.identifier.wosid	WOS:000287375803007
dc.identifier.ctitle	2010 IEEE World Congress on Computational Intelligence
dc.identifier.cdate	JUL 18-23, 2010

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.