Multiprocessor Task Scheduling in Multistage Hybrid Flow-Shops: A Parallel Greedy Algorithm Approach

Basit Öğe Kaydı
dc.contributor.authorKahraman, Cengiz
dc.contributor.authorEngin, Orhan
dc.contributor.authorKaya, İhsan
dc.contributor.authorÖztürk, R. Elif
dc.date.accessioned2020-03-26T18:04:43Z
dc.date.available2020-03-26T18:04:43Z
dc.date.issued2010
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractHybrid flow shop scheduling problems have a special structure combining some elements of both the flow shop and the parallel machine scheduling problems. Multiprocessor task scheduling problem can be stated as finding a schedule for a general task graph to execute on a multiprocessor system so that the schedule length can be minimized. Hybrid Flow Shop Scheduling with Multiprocessor Task (HFSMT) problem is known to be NP-hard. In this study we present an effective parallel greedy algorithm to solve HFSMT problem. Parallel greedy algorithm (PGA) is applied by two phases iteratively, called destruction and construction. Four constructive heuristic methods are proposed to solve HFSMT problems. A preliminary test is performed to set the best values of control parameters, namely population size, subgroups number, and iteration number. The best values of control parameters and operators are determined by a full factorial experimental design using our PGA program. Computational results are compared with the earlier works of Oguz et al. [1,3], and Oguz [2]. The results indicate that the proposed parallel greedy algorithm approach is very effective in terms of reduced total completion time or makespan (C-max) for the attempted problems.en_US
dc.identifier.citationKahraman, C., Engin, O., Kaya, İ., Öztürk, R. E., (2010). Multiprocessor Task Scheduling in Multistage Hybrid Flow-Shops: A Parallel Greedy Algorithm Approach. Applied Soft Computing, 10(4), 1293-1300. DOI: 10.1016/j.asoc.2010.03.008
dc.identifier.doi10.1016/j.asoc.2010.03.008en_US
dc.identifier.endpage1300en_US
dc.identifier.issn1568-4946en_US
dc.identifier.issn1872-9681en_US
dc.identifier.issue4en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage1293en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.asoc.2010.03.008
dc.identifier.urihttps://hdl.handle.net/20.500.12395/25093
dc.identifier.volume10en_US
dc.identifier.wosWOS:000281591100031en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorEngin, Orhan
dc.institutionauthorKaya, İhsan
dc.institutionauthorÖztürk, R. Elif
dc.language.isoenen_US
dc.publisherELSEVIERen_US
dc.relation.ispartofApplied Soft Computingen_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 Shopen_US
dc.subjectMultiprocessor Tasks Scheduling Problemsen_US
dc.subjectParallel Greedy Algorithmen_US
dc.titleMultiprocessor Task Scheduling in Multistage Hybrid Flow-Shops: A Parallel Greedy Algorithm Approachen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
5093.pdf
Boyut:
235.07 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale Dosyası
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Endüstri Mühendisliği Bölümü/Makale Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu