A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops
Özet
The permutation flowshop scheduling problem is an NP-hard problem that has practical applications in production facilities and in other areas. An iterated greedy algorithm for solving the permutation flowshop scheduling problem with the objective of minim
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84975748561&doi=10.1016%2fj.cie.2016.06.012&partnerID=40&md5=b8b80df5e05997912a4a322371e00e24https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10188
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..