Distributed Fuzzy Permutation Flow Shop Scheduling Problem: A Bee Colony Algorithm

Abstract

The distributed permutation flow shop scheduling problem is a subclass of the permutation flow shop scheduling problem. Distributed scheduling adopts multi-factory with permutation flow shop scheduling environment. At the distributed permutation flow shop scheduling, due to the human factors, the processing times of the jobs on the machines are not known exactly. Thus, in this study, the processing time of the jobs on machines are considered as a triangular fuzzy number. Also, the due dates of the jobs are considered as trapezoidal fuzzy numbers at this research. To solve the distributed fuzzy permutation flow shop scheduling problem with multi-objective an artificial bee colony algorithm is proposed. To the best of our knowledge, this is the first study to solve the distributed fuzzy permutation flow shop scheduling with an artificial bee colony algorithm. The proposed artificial bee colony algorithm is first calibrated on the distributed permutation flow shop scheduling problem. The results showed that the proposed artificial bee colony algorithm is an efficient solution technique for solving distributed fuzzy permutation flow shop scheduling problems. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.