A general variable neighborhood search algorithm for the no-idle permutation flowshop scheduling problem

Thumbnail
Date
2013
Author
Tasgetiren, M.F.
Buyukdagli, O.
Pan, Q.K.
Suganthan, P.N.
Metadata
Show full item record
Abstract
In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner loop operates a variable neighbo
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84893309773&doi=10.1007%2f978-3-319-03753-0_3&partnerID=40&md5=2f97206c9613d611847dbfa726faa69b
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10472
Collections