Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/952
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Küpeli, İ. | - |
dc.contributor.author | Sarucan, A. | - |
dc.contributor.author | Küpeli, A.S. | - |
dc.date.accessioned | 2021-12-13T10:32:13Z | - |
dc.date.available | 2021-12-13T10:32:13Z | - |
dc.date.issued | 2020 | - |
dc.identifier.issn | 2148-3736 | - |
dc.identifier.uri | https://doi.org/10.31202/ecjse.670424 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/952 | - |
dc.description.abstract | In this study, distributed permutation flow type scheduling problems, whose purpose function is minimization of maximum completion time, are discussed. The difference of this problem from the classical flow-type scheduling problem is that jobs are distributed across multiple factories. Artificial bee colony algorithm, based on the foraging behavior of bees in the nature, was used to solve the problem. The NEH (Nawaz Enscore Ham) intuition has been used to produce the initial solutions of the algorithm. In the phases of the algorithm (worker, observer and explorer bee phase), the displacement method is used for neighboring solutions. In this method, different jobs were obtained by changing the positions of two randomly selected jobs. The success of the algorithm on the problem has been measured in the literature using Taillard's small and large test problems. The algorithm has been compared to 14 intuitive and has presented the best results. © 2020, TUBITAK. All rights reserved. | en_US |
dc.language.iso | tr | en_US |
dc.publisher | TUBITAK | en_US |
dc.relation.ispartof | El-Cezeri Journal of Science and Engineering | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Artificial bee colony algorithm | en_US |
dc.subject | Distributed permutation flow shop scheduling | en_US |
dc.subject | NEH heuristic | en_US |
dc.title | Solution of the distributed permutated flow shop scheduling problems and artificial bee colony algorithm | en_US |
dc.title.alternative | Dağıtık permütasyon akış tipi çizelgeleme problemlerinin yapay arı koloni algoritması ile çözümü | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.31202/ecjse.670424 | - |
dc.identifier.scopus | 2-s2.0-85095933389 | en_US |
dc.department | Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Endüstri Mühendisliği Bölümü | en_US |
dc.identifier.volume | 7 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.startpage | 549 | en_US |
dc.identifier.endpage | 562 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.authorscopusid | 57219895059 | - |
dc.authorscopusid | 54405086400 | - |
dc.authorscopusid | 57219894841 | - |
dc.identifier.trdizinid | 465479 | en_US |
dc.identifier.scopusquality | - | - |
item.languageiso639-1 | tr | - |
item.fulltext | With Fulltext | - |
item.cerifentitytype | Publications | - |
item.openairetype | Article | - |
item.grantfulltext | open | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.dept | 02.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 TR Dizin İndeksli Yayınlar Koleksiyonu / TR Dizin Indexed Publications Collections |
Files in This Item:
File | Size | Format | |
---|---|---|---|
10.31202-ecjse.670424-1128142.pdf | 823.53 kB | Adobe PDF | View/Open |
CORE Recommender
SCOPUSTM
Citations
2
checked on Apr 20, 2024
Page view(s)
100
checked on Apr 22, 2024
Download(s)
38
checked on Apr 22, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.