Estimation of Distribution Algorithms for No-Wait Flow Shop Problem

摘要：

No-wait flow shop scheduling (NWFS) problem is an important area in production scheduling, we applied estimation of distribution algorithms, to solve the NWFS problem. To compute the makespan fast, we prove a characteristic of NWFS, then proposed a algorithm with a On) computation complexity depend on the characteristic. A modified insert move local search method which can weaken the negative effect generated by greedy is combined with estimation of distribution algorithms to gain a reduction of the makespan, which accelerate the search close to good solution. The effectiveness of the algorithm is proved by the experiment.

关键词： Flow Shop Scheduling No-Wait Makespan criterion Estimation of Distribution Algorithms local search

作者: Wu Mu-lin Zheng Jin-hua Liu Wen-pan Zou Juan

作者单位: Institute of Information Engineering, Xiangtan University Xiangtan, China

会议类型: 国际会议

会议名称: 2011 Seventh International Conference on Natural Computation(第七届自然计算国际会议 ICNC 2011)

会议地点: 上海

会议语种:英文

页码: 2082-2085

在线出版日期: 2011-07-26（万方平台首次上网日期，不代表论文的发表时间）