A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem

Thumbnail
Date
2011
Author
Pan, Q.K.
Suganthan, P.N.
Liang, J.J.
Tasgetiren, M.F.
Metadata
Show full item record
Abstract
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
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-78650708894&doi=10.1016%2fj.eswa.2010.08.111&partnerID=40&md5=28d8584b58cb61259cb3bae4e211bc1f
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10629
Collections