A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem
Tarih
2011Yazar
Pan, Q.K.
Suganthan, P.N.
Liang, J.J.
Tasgetiren, M.F.
Üst veri
Tüm öğe kaydını gösterÖzet
In this paper, a local-best harmony search (HS) algorithm with dynamic sub-harmony memories (HM), namely DLHS algorithm, is proposed to minimize the total weighted earliness and tardiness penalties for a lot-streaming flow shop scheduling problem with equ
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..