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

Thumbnail
Date
2013
Author
Tasgetiren, M.F.
Pan, Q.K.
Suganthan, P.N.
Buyukdagli, O.
Metadata
Show full item record
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
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
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10499
Collections