Please use this identifier to cite or link to this item:
Title: Solution of the distributed permutated flow shop scheduling problems and artificial bee colony algorithm
Other Titles: Dağıtık permütasyon akış tipi çizelgeleme problemlerinin yapay arı koloni algoritması ile çözümü
Authors: Küpeli, İ.
Sarucan, A.
Küpeli, A.S.
Keywords: Artificial bee colony algorithm
Distributed permutation flow shop scheduling
NEH heuristic
Issue Date: 2020
Publisher: TUBITAK
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.
ISSN: 2148-3736
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 SizeFormat 
10.31202-ecjse.670424-1128142.pdf823.53 kBAdobe PDFView/Open
Show full item record

CORE Recommender


checked on Feb 4, 2023

Page view(s)

checked on Feb 6, 2023


checked on Feb 6, 2023

Google ScholarTM



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