Makespan minimization of a flowshop sequence-dependent group scheduling problem

Abstract

The flowshop sequence dependent group sched- uling problem with minimization of makespan as the objective (Fm|fmls, Splk, prmu|Cmax) is considered in this paper. It is assumed that several groups with different number of jobs are assigned to a flow shop cell that has m machines. The goal is to find the best sequence of processing the jobs in each group and the groups themselves with minimization of makespan as the objec- tive. A mathematical model for the research problem is developed in this paper. As the research problem is shown to be NP-hard, a hybrid ant colony optimization (HACO) algorithm is developed to solve the problem. A lower bounding technique based on relaxing a few constraints of the mathematical model developed for the original problem is proposed to evaluate the quality of the HACO algorithm. Three different problem structures, with two, three, and six machines, are used in the generation of the test problems to test the performance of the algorithm and the lower bounding technique developed. The results obtained from the HACO algorithm and those that have appeared in the published literature are also compared. The comparative results show that the HACO algorithm has a superior performance compared to the best available algorithm based on memetic algorithm with an average percentage deviation of around 1.0% from the lower bound.