A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem
MetadataShow full item record
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
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..