A Variable Iterated Local Search Algorithm for Energy-Efficient No-idle Flowshop Scheduling Problem
Tarih
2019Yazar
Tasgetiren, M.F.
Oztop, H.F.
Gao, L.
Pan, Q.K.
Li, X.
Üst veri
Tüm öğe kaydını gösterÖzet
No-idle permutation flowshop scheduling problem (NIPFSP) is a well-known NP-hard problem, in which each machine must perform the jobs consecutively without any idle time. Even though various algorithms have been proposed for this problem, energy efficienc
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85082757929&doi=10.1016%2fj.promfg.2020.01.351&partnerID=40&md5=71868871a6a589b3f9625eedcc2446bbhttps://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/9864
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..