A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
Tarih
2013Yazar
Tasgetiren, M.F.
Pan, Q.K.
Suganthan, P.N.
Buyukdagli, O.
Üst veri
Tüm öğe kaydını gösterÖzet
This paper presents a variable iterated greedy algorithm (IG) with differential evolution (vIG_DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG algorithm, size d of jobs are removed from a sequence and re-inserted into
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..