Artificial Bee Colony Algorithm for Solving Multi-Objective Distributed Fuzzy Permutation Flow Shop Problem [2]
No Thumbnail Available
Date
2021
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
IOS Press BV
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
The distributed permutation flow shop scheduling (DPFSS) is a permutation flow shop scheduling problem including the multi-factory environment. The processing times of the jobs in a real life scheduling problem cannot be precisely know because of the human factor. In this study, the process times and due dates of the jobs are considered triangular and trapezoidal fuzzy numbers for DPFSS environment. An artificial bee colony (ABC) algorithm is developed to solve the multi-objective distributed fuzzy permutation flow shop (DFPFS) problem. First, the proposed ABC algorithm is calibrated with the well-known DPFSS instances in the literature. Then, the DPFSS instances are fuzzified and solved with the algorithm. According to the results, the proposed ABC algorithm performs well to solve the DFPFS problems. © 2022 - IOS Press. All rights reserved.
Description
Keywords
agreement index; artificial bee colony; Distributed fuzzy permutation flow-shop; fuzzy completion time; multi-objective, Fuzzy sets; Machine shop practice; Agreement index; Artificial bee colony; Artificial bees; Bee colony algorithms; Distributed fuzzy permutation flow-shop; Flow shop problems; Fuzzy completion time; Multi objective; Permutation flow-shop scheduling; Permutation flowshops; Optimization
Turkish CoHE Thesis Center URL
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
WoS Q
Q4
Scopus Q
Q2

OpenCitations Citation Count
19
Source
Journal of Intelligent and Fuzzy Systems
Volume
42
Issue
1
Start Page
439
End Page
449
PlumX Metrics
Citations
CrossRef : 17
Scopus : 4
Captures
Mendeley Readers : 6
Google Scholar™


