Multiobjective Discrete Artificial Bee Colony Algorithm for Multiobjective Permutation Flow Shop Scheduling Problem With Sequence Dependent Setup Times

Abstract

The multiobjective permutation flow shop scheduling problem with sequence dependent setup times has been an object of investigations for decades. This widely studied problem from the scheduling theory links the sophisticated solution algorithms with the moderate real world applications. This paper presents a novel multiobjective discrete artificial bee colony algorithm based decomposition, called MODABC/D , to solve the sequence dependent setup times multiobjective permutation flowshop scheduling problem with the objective to minimize makespan and total flowtime. First, in order to make the standard artificial bee colony algorithm to solve the scheduling problem, a discrete artificial bee colony algorithm is proposed to solve the problem based on the perturbation operation. Then, a problem-specific solution builder heuristic is used to initialize the population to enhance the quality of the initial solution. Finally, a further local search method are comprised of a single local search procedures based on the insertion neighborhood structures to find the better solution for the nonimproved individual. The performance of the proposed algorithms is tested on the well-known benchmark suite of Taillard. The highly effective performance of the multiobjective discrete artificial bee colony algorithm-based decomposition is compared against the state of art algorithms from the existing literature in terms of both coverage value and hypervolume indicator.