关键词: 流水车间成组调度, 总流程时间, 缓冲, 微分算法, 禁忌搜索

Abstract: Aiming at the flow shop group scheduling problem,a mathematical model for minimizing total flow time was established by adding the relevant sequence constraints of setup time and limited buffer,and a Hybrid Differential Evolution(HDE)algorithm which combined Differential Evolution(DE)with Tabu Search(TS)was proposed.DE algorithm was applied to determine the parts sequences within groups,while TS was used for finding the optimal sequence of parts groups.To improve the speed and accuracy of proposed algorithm,an initial optimized solution was generated by a construction algorithm,and the optimal parameter for HDE algorithm was determined through numerical experiments.Experimental results verified the effectiveness and feasibility of proposed algorithm.

Key words: flow shop group scheduling, total flow time, buffer, differential evolution algorithm, tabu search