基于改进的RA算法的混合Flowshop调度问题的求解

A New Approach of Improved RA Algorithm for Hybrid Flowshop Scheduling

针对混合Flowshop系统的最小化Makespan调度问题,提出基于改进的RA斜度指标的启发式算法来对工件进行排序,采用FAM算法来分配设备并给出其最优值的下界检验该算法。仿真结果表明该方法优于目前最好的启发式算法能较好地解决混合Flowshop的调度问题。

This paper proposes a scheduling approach of improved RA heuristic to Minimize makespan problem in hybrid Flowshop, in which improved RA heuristic algorithm is used to get a sequence of jobs and the first available machine (FAM) rule is designed for allocating devices for jobs. A lower bound is proposed to check this algorithm's deviation of the optimum makespan. The simulation result shows that the algorithm can get a good schedule for hybrid Flowshop.