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-25T20:51:10Z
dc.date.available	2021-01-25T20:51:10Z
dc.date.issued	2011
dc.identifier	10.1007/978-3-642-25944-9_11
dc.identifier.issn	03029743
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84862933509&doi=10.1007%2f978-3-642-25944-9_11&partnerID=40&md5=d49bc2ada18f0930bda511db9934e6de
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10596
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.language.iso	English
dc.publisher	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.title	A DE based variable iterated greedy algorithm for the no-idle permutation flowshop scheduling problem with total flowtime criterion
dc.type	Conference Paper
dc.relation.firstpage	83
dc.relation.lastpage	90
dc.relation.volume	6839 LNAI
dc.description.affiliations	Industrial Engineering Department, Yasar University, Izmir, Turkey; School of Computer Science, Liaocheng University, China; Department of Automation, Tsinghua University, Beijing 100084, China; Department of Finance, Nanya Institute of Technology, 320, T

Bu öğenin dosyaları:

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