A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion

dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Wang, L.
dc.contributor.author	Chen, A.H.L.
dc.date.accessioned	2021-01-25T19:35:50Z
dc.date.available	2021-01-25T19:35:50Z
dc.date.issued	2012
dc.identifier.issn	0302-9743
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/8222
dc.description.abstract	In this paper, we present a variable iterated greedy (vIGP_DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the differential evolution algorithm
dc.description.sponsorship	TUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [110M622]
dc.language.iso	English
dc.publisher	SPRINGER-VERLAG BERLIN
dc.title	A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion
dc.type	Proceedings Paper
dc.relation.firstpage	83
dc.relation.lastpage	+
dc.relation.volume	6839
dc.description.woscategory	Computer Science, Artificial Intelligence
dc.description.wosresearcharea	Computer Science
dc.identifier.wosid	WOS:000306498200011
dc.identifier.ctitle	7th International Conference on Intelligent Computing (ICIC)
dc.identifier.cdate	AUG 11-14, 2011

Files in this item

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