求解混合Flow shop调度问题的简化禁忌搜索方案

A Tabu Approach to Hybrid Flowshop Scheduling

针对 HFS系统的最小化 Makespan调度问题 ,提出一种禁忌算法和优先级规则相结合的方案 :采用改进的 RA算法对第 1级工件进行排序 ,并用禁忌搜索对其进行优化 ;采用 FAM算法给工件分配设备 ,其他级工件的排序采用最大剩余时间优先级规则 .和其他 HFS的局部搜索算法相比 ,该方案大大缩减了搜索空间 .仿真结果表明 ,该方法能够较好地解决 HFS调度问题 .

This paper proposed a scheduling approach of Tabu algorithm to minimize makespan problem in hybrid Flowshop(HFS), in which an improved RA heuristic algorithm is used to get a sequence of jobs in the first stage and Tabu search theory to optimize it, the first available machine(FAM) rule and minimizing remain processing time dispatching rule(MRPT) are used for allocating devices and dispatching jobs in the other stages respectively. Compared with other approach of Tabu search for HFS, the prosposed approach can reduce solution space remarkably. The simulation result shows that the approach can get a good schedule for HFS.