A General Variable Neighborhood Search for the No-Idle Flowshop Scheduling Problem with Makespan Criterion
Tarih
2019Yazar
Shen, L.S.
Tasgetiren, M.F.
Oztop, H.
Kandiller, L.
Gao, L.
Üst veri
Tüm öğe kaydını gösterÖzet
This paper proposes a novel general variable neighborhood search (GVNS) algorithm to solve the no-idle flowshop scheduling problem with the makespan criterion. The initial solution of the GVNS is generated using the FRB5 heuristic. In the outer loop, inse
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..