An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems
We model the hybrid flow shop problem under the criterion of makespan minimization. The problem is tracked by using an improved discrete artificial bee colony algorithm. An orthogonal test is employed to get a receipt for turning the adjustable parameters. Comparison results demonstrate the superiority of the proposed algorithm.
artificial bee colony hybrid flow shop problem orthogonal test scheduling mathematical model