A variable block insertion heuristic for permutation flowshops with makespan criterion

dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Kizilay, D.
dc.contributor.author	Velez-Gallego, M.C.
dc.date.accessioned	2021-01-25T20:48:50Z
dc.date.available	2021-01-25T20:48:50Z
dc.date.issued	2017
dc.identifier	10.1109/CEC.2017.7969382
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027862282&doi=10.1109%2fCEC.2017.7969382&partnerID=40&md5=eee52e494115a6c18fe98bfd83b63b60
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10069
dc.description.abstract	This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size being equal to one. It removes a
dc.language.iso	English
dc.publisher	2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings
dc.title	A variable block insertion heuristic for permutation flowshops with makespan criterion
dc.type	Conference Paper
dc.relation.firstpage	726
dc.relation.lastpage	733
dc.description.affiliations	International Logistics Management Department, Yasar University, Izmir, Turkey; State Key Laboratory, Huazhong University of Science and Technology, Wuhan, China; Industrial Engineering Department, Yasar University, Izmir, Turkey; Production Engineering D

Files in this item

Files	Size	Format	View
There are no files associated with this item.