关键词: 变邻域搜索, 机器人制造单元调度问题, 模拟退火算法

Abstract: Two-machine robotic cell scheduling problem with sequence-dependent setup times which is NP-hard is researched, variable neighborhood search is designed in the field. In order to speed up the convergence, minimization of blocking time close part method which produces initial solution is designed. Parameters of proposed algorithm are analysed for finding better solution. The presented algorithm is compared to SA by solving randomly generated stances, the results show that the algorithm is more effectively.

Key words: variable neighborhood search, robotic cell scheduling problem, simulated annealing algorithm