关键词: 动态可重入柔性流水车间问题, 不相关并行机, 总加权完工时间, 混合DABC-GA算法

Abstract: To improve logistics balance of production lines and strengthen time connection between stages, thedynamic reentrant flexible flowshop problem with unrelated parallel machines on each stage is studied, which is an extension of scheduling theory on general reentrant flexible flowshop. The objective is to minimize the total weighted completion time. The job processing time at each stage is dependent on the machine assigned for processing the job. Since the above problem is NP-hard, an integer programming model is firstly formulated. Then, a cellular matrix coding scheme is designed and a hybrid DABC-GA algorithm is developed combining discrete artificial bee colony(DABC)algorithm and genetic algorithm (GA) to obtain near-optimal solutions. The employed bees use Gaussian mutation to search new honey sources; the onlooker bees apply GA for these honey sources to find better neighborhood solutions; the scout bees achieve new honey sources through reverse operation. Finally, to evaluate the hybrid algorithm, the proposed algorithm is compared with several meta-heuristic algorithms for different scale problems. The experimental results show the effectiveness of the proposed algorithm.

Key words: dynamic re-entrant flexible flowshop problem, unrelated parallel machine, total weighted completion time, hybrid DABC-GA algorithm