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

dc.contributor.author	Pan, Q.K.
dc.contributor.author	Suganthan, P.N.
dc.contributor.author	Liang, J.J.
dc.contributor.author	Tasgetiren, M.F.
dc.date.accessioned	2021-01-25T20:51:21Z
dc.date.available	2021-01-25T20:51:21Z
dc.date.issued	2011
dc.identifier	10.1016/j.eswa.2010.08.111
dc.identifier.issn	09574174
dc.identifier.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
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10629
dc.description.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
dc.language.iso	English
dc.publisher	Expert Systems with Applications
dc.title	A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem
dc.type	Article
dc.relation.firstpage	3252
dc.relation.lastpage	3259
dc.relation.volume	38
dc.relation.issue	4
dc.description.affiliations	College of Computer Science, Liaocheng University, Liaocheng 252059, China; School of Electrical and Electronic Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore; School of Electrical Engineering, Zhengzhou Univers

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.