An improved artificial bee colony algorithm for solving open shop scheduling problem with two sequence-dependent setup times

Abstract

In the literature on open shop scheduling problems, only few studies have considered the scheduling problem with sequence-dependent setup time and transportation time, and the latter can be considered as another kind of setup time. In order to be closer to real industry scenes, the open shop scheduling problem with two sequence-dependent setup times is investigated. Firstly, the mixed integer linear programming model is established. Then, an improved artificial bee colony algorithm is introduced and compared with other existing algorithms, namely genetic algorithm, particle swarm optimization, ant colony optimization, and cuckoo search algorithm. Two experiments have been conducted and the computational results show that the proposed artificial bee colony algorithm can achieve the best results in large-scale problems.