A General Variable Neighborhood Search for the NoIdle 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
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85080969217&doi=10.1109%2fSSCI44817.2019.9002931&partnerID=40&md5=0772c60cd4eafa488091df70a1e1f0dchttps://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/9752
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..