A populated local search with differential evolution for blocking flowshop scheduling problem

Thumbnail
Date
2015
Author
Tasgetiren, M.F.
Pan, Q.K.
Kizilay, D.
Suer, G.
Metadata
Show full item record
Abstract
This paper presents a populated local search algorithm through a differential evolution algorithm for solving the blocking flowshop scheduling problem under makespan criterion. Iterated greedy and iterated local search algorithms are simple but extremely
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84963620165&doi=10.1109%2fCEC.2015.7257235&partnerID=40&md5=136193f92f812371a20a5bb3286a347b
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10263
Collections