Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion

dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Kizilay, D.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Suganthan, P.N.
dc.date.accessioned	2021-01-25T20:49:05Z
dc.date.available	2021-01-25T20:49:05Z
dc.date.issued	2017
dc.identifier	10.1016/j.cor.2016.07.002
dc.identifier.issn	03050548
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982854598&doi=10.1016%2fj.cor.2016.07.002&partnerID=40&md5=6e9d916fe7389f73455fc3b13352db0e
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10143
dc.description.abstract	Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling problem (BFSP) with the makespan cri
dc.language.iso	English
dc.publisher	Computers and Operations Research
dc.title	Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
dc.type	Article
dc.relation.firstpage	111
dc.relation.lastpage	126
dc.relation.volume	77
dc.description.affiliations	Industrial Engineering Department, Yasar University, Izmir, Turkey; Huazhong University of Science and Technology, Wuhan, China; School of Electronics, Nanyang Technological University, Singapore

Bu öğenin dosyaları:

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