A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

dc.contributor.author	Pan, Q.K.
dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Suganthan, P.N.
dc.contributor.author	Chua, T.J.
dc.date.accessioned	2021-01-25T20:51:19Z
dc.date.available	2021-01-25T20:51:19Z
dc.date.issued	2011
dc.identifier	10.1016/j.ins.2009.12.025
dc.identifier.issn	00200255
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-79953031480&doi=10.1016%2fj.ins.2009.12.025&partnerID=40&md5=65233916187814bf0934eb604486e52b
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10625
dc.description.abstract	In this paper, a discrete artificial bee colony (DABC) algorithm is proposed to solve the lot-streaming flow shop scheduling problem with the criterion of total weighted earliness and tardiness penalties under both the idling and no-idling cases. Unlike t
dc.language.iso	English
dc.publisher	Information Sciences
dc.title	A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
dc.type	Article
dc.relation.firstpage	2455
dc.relation.lastpage	2468
dc.relation.volume	181
dc.relation.issue	12
dc.description.affiliations	College of Computer Science, Liaocheng University, Liaocheng 252059, China; Department of Industrial Engineering, Yasar University, Bornova, Izmir, Turkey; School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798

Bu öğenin dosyaları:

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