A discrete artificial bee colony algorithm for the assignment and parallel machine scheduling problem in DYO paint company

This paper presents a discrete artificial bee colony algorithm to solve the assignment and parallel machine scheduling problem in DYO paint company. The aim of this paper is to develop some algorithms to be employed in the DYO paint company by using their real-life data in the future. Currently, in the DYO paint company; there exist three types of filling machines groups. These are automatic, semiautomatic and manual machine groups, where there are several numbers of identical machines. The problem is to first assign the filling production orders (jobs) to machine groups. Then, filling production orders assigned to each machine group should be scheduled on identical parallel machines to minimize the sum of makespan and the total weighted tardiness. We also develop a traditional genetic algorithm to solve the same problem. The computational results show that the DABC algorithm outperforms the GA on set of benchmark problems we have generated.