A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem

dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Suganthan, P.N.
dc.contributor.author	Buyukdagli, O.
dc.date.accessioned	2021-01-25T20:50:37Z
dc.date.available	2021-01-25T20:50:37Z
dc.date.issued	2013
dc.identifier	10.1016/j.cor.2013.01.005
dc.identifier.issn	03050548
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84875960024&doi=10.1016%2fj.cor.2013.01.005&partnerID=40&md5=9fc07c21ebaa244a0c4d0eb18e218c6c
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10499
dc.description.abstract	This paper presents a variable iterated greedy algorithm (IG) with differential evolution (vIG-DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG algorithm, size d of jobs are removed from a sequence and re-inserted into
dc.language.iso	English
dc.publisher	Computers and Operations Research
dc.title	A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
dc.type	Article
dc.relation.firstpage	1729
dc.relation.lastpage	1743
dc.relation.volume	40
dc.relation.issue	7
dc.description.affiliations	Industrial Engineering Department, Yasar University, Izmir, Turkey; College of Computer Science, Liaocheng University, Liaocheng, Shandong, China; School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapo

Bu öğenin dosyaları:

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