A Crossbreed Discrete Artificial Bee Colony for Permutation Flow Shop Scheduling Problem to Minimize Total Earliness and Tardiness

Abstract

This paper considers the permutation flow shop scheduling problem to minimize total earliness and tardiness. We initiated a metaheuristic algorithm, namely a crossbreed discrete artificial bee colony. We modifications to the essential artificial bee colony and propose two versions of the crossbreed discrete artificial bee colony. Taguchi experimental design is used to test the performance of this. Several computational experiments using Vallada’s benchmark instances have been carried out to prove the performance of the proposed algorithms. The statistical test results show that the proposed algorithms have the largest negative mean of BRE’s value, each of -0.1959 for CDABC_ver1 and -0.1954 for CDABC_ver2. It means that the proposed algorithms perform significantly better than other algorithms. The results of the Kruskal Wallis H test show that the proposed algorithm has better performance than some dispatching rules and heuristic algorithms. Furthermore, the proposed algorithms can deliver better results in less time than mathematical model solution.