AN APPLICATION OF EFFECTIVE GENETIC ALGORITHMS FOR SOLVING HYBRID FLOW SHOP SCHEDULING PROBLEMS

dc.contributor.authorKahraman, Cengiz
dc.contributor.authorEngin, Orhan
dc.contributor.authorKaya, Ihsan
dc.contributor.authorYilmaz, Mustafa Kerim
dc.date.accessioned2020-03-26T17:26:23Z
dc.date.available2020-03-26T17:26:23Z
dc.date.issued2008
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThis paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the makespan value. In recent years, much attention is given to heuristic and search techniques. Genetic algorithms (GAs) are also known as efficient heuristic and search techniques. This paper proposes an efficient genetic algorithm for hybrid flow shop scheduling problems. The proposed algorithm is tested by Carlier and Neron's (2000) benchmark problem from the literature. The computational results indicate that the proposed efficient genetic algorithm approach is effective in terms of reduced total completion time or makespan (C-max) for HFS problems.en_US
dc.identifier.doi10.2991/ijcis.2008.1.2.4en_US
dc.identifier.endpage147en_US
dc.identifier.issn1875-6891en_US
dc.identifier.issn1875-6883en_US
dc.identifier.issue2en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage134en_US
dc.identifier.urihttps://dx.doi.org/10.2991/ijcis.2008.1.2.4
dc.identifier.urihttps://hdl.handle.net/20.500.12395/22194
dc.identifier.volume1en_US
dc.identifier.wosWOS:000264143700004en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherATLANTIS PRESSen_US
dc.relation.ispartofINTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMSen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectHybrid flow shop schedulingen_US
dc.subjectGenetic algorithmen_US
dc.subjectcompletion timeen_US
dc.titleAN APPLICATION OF EFFECTIVE GENETIC ALGORITHMS FOR SOLVING HYBRID FLOW SHOP SCHEDULING PROBLEMSen_US
dc.typeArticleen_US

Dosyalar