scholarly journals A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem

2012 ◽  
Vol 19 (6) ◽  
pp. 1921-1935 ◽  
Author(s):  
X. Li ◽  
M. Yin
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Bee Colony ◽  
Permutation Flow Shop Scheduling ◽  
Permutation Flow Shop ◽  
Mutation Strategies

Artificial bee colony algorithm for solving multi-objective distributed fuzzy permutation flow shop problem

2021 ◽  
pp. 1-11
Author(s):  
M. Emin Baysal ◽  
Ahmet Sarucan ◽  
Kadir Büyüközkan ◽  
Orhan Engin
Keyword(s):  
Artificial Bee Colony ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Abc Algorithm ◽  
Shop Scheduling ◽  
Multi Objective ◽  
Bee Colony ◽  
Permutation Flow Shop Scheduling ◽  
Permutation Flow Shop

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.

Sign in / Sign up

Export Citation Format

Share Document