Solving multi-objective fuzzy flexible job shop scheduling problem using MABC algorithm

A new artificial bee colony algorithm called modified artificial bee colony algorithm (MABC) is presented to solve the multi-objective fuzzy flexible job-shop scheduling problem (MFFJSP) in this paper. The objectives of MFFJSP are to minimize the maximum fuzzy completion time (fuzzy makespan), maximize the weighted agreement index and minimize the maximum fuzzy machine workload. The three-point satisfaction-degree model is adopted to calculate the agreement index and this model can indicate the degree of satisfaction between the due date and the processing time. An effective local search operator based on variable neighborhood search (VNS) and crossover operator are embedded in this algorithm for obtaining good searching performance. In order to make the novel algorithm valid, we texted it, five benchmark instances and a practical case for the sake of effectiveness. Then, the performance of the proposed MABC has been compared with other existing algorithms to prove the superiority of this algorithm. In the end, the Taguchi method is used to investigate the impact of three key parameters from the MABC.