Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization

dc.contributor.author	Oztop, H.
dc.contributor.author	Tursel Eliiyi, D.
dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Pan, Q.K.
dc.date.accessioned	2021-01-25T20:48:32Z
dc.date.available	2021-01-25T20:48:32Z
dc.date.issued	2018
dc.identifier	10.1145/3205455.3205500
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050630493&doi=10.1145%2f3205455.3205500&partnerID=40&md5=0a6be08edc1f62f5d045261dc7a88e86
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/9961
dc.description.abstract	1 The hybrid flosshop scheduling problem (HFSP) has been extensively studied in the literature, due to its complexity and real-life applicability. Various exact and heuristic algorithms have been developed for the HFSP, and most consider makespan as the o
dc.language.iso	English
dc.publisher	GECCO 2018 - Proceedings of the 2018 Genetic and Evolutionary Computation Conference
dc.title	Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization
dc.type	Conference Paper
dc.relation.firstpage	379
dc.relation.lastpage	385
dc.description.affiliations	Department of Industrial Engineering, Yasar University, İzmir, Turkey; Department of International Logistics Management, Yasar University, İzmir, Turkey; State Key Laboratory, Huazhong University of Science and Technology, Wuhan, China

Bu öğenin dosyaları:

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