Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.13091/544
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEngin, Orhan-
dc.contributor.authorGüçlü, Abdullah-
dc.date.accessioned2021-12-13T10:26:54Z-
dc.date.available2021-12-13T10:26:54Z-
dc.date.issued2018-
dc.identifier.issn1568-4946-
dc.identifier.issn1872-9681-
dc.identifier.urihttps://doi.org/10.1016/j.asoc.2018.08.002-
dc.identifier.urihttps://hdl.handle.net/20.500.13091/544-
dc.description.abstractThis paper proposes an effective new hybrid ant colony algorithm based on crossover and mutation mechanism for no-wait flow shop scheduling with the criterion to minimize the maximum completion time. The no-wait flow shop is known as a typical NP-hard combinational optimization problem. The hybrid ant colony algorithm is applied to the 192 benchmark instances from literature in order to minimize makespan. The performance of the proposed Hybrid Ant Colony algorithm is compared to the Adaptive Learning Approach and Genetic Heuristic algorithm which are used in previous studies to solve the same set of benchmark problems. The computational experiments show that the proposed Hybrid Ant Colony algorithm provides better results relative to the other algorithms. (C) 2018 Elsevier B.V. All rights reserved.en_US
dc.language.isoenen_US
dc.publisherELSEVIER SCIENCE BVen_US
dc.relation.ispartofAPPLIED SOFT COMPUTINGen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectSchedulingen_US
dc.subjectNo-Wait Flow Shopen_US
dc.subjectHybrid Ant Colony Algorithmen_US
dc.subjectMakespanen_US
dc.subjectParticle Swarm Optimizationen_US
dc.subjectIterated Greedy Algorithmen_US
dc.subjectTotal Completion-Timeen_US
dc.subjectMakespan Criterionen_US
dc.subjectGenetic Algorithmsen_US
dc.subjectMinimize Makespanen_US
dc.subjectSetup Timesen_US
dc.subjectIn-Processen_US
dc.subjectFlowshopsen_US
dc.subjectSearchen_US
dc.titleA new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problemsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.asoc.2018.08.002-
dc.identifier.scopus2-s2.0-85052452159en_US
dc.departmentFakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Endüstri Mühendisliği Bölümüen_US
dc.authoridEngin, Orhan/0000-0002-7250-0317-
dc.authorwosidEngin, Orhan/AAG-6283-2019-
dc.identifier.volume72en_US
dc.identifier.startpage166en_US
dc.identifier.endpage176en_US
dc.identifier.wosWOS:000448813100013en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.authorscopusid55948252100-
dc.authorscopusid57203622904-
item.openairetypeArticle-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.grantfulltextembargo_20300101-
item.fulltextWith Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.dept02.09. Department of Industrial Engineering-
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections
Files in This Item:
File SizeFormat 
1-s2.0-S1568494618304502-main.pdf
  Until 2030-01-01
1.4 MBAdobe PDFView/Open    Request a copy
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

109
checked on Mar 23, 2024

WEB OF SCIENCETM
Citations

112
checked on Mar 23, 2024

Page view(s)

156
checked on Mar 25, 2024

Download(s)

6
checked on Mar 25, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.