首页 | 官方网站   微博 | 高级检索  
     

解决无等待流水线调度问题的变邻域搜索算法
引用本文:潘全科,朱剑英.解决无等待流水线调度问题的变邻域搜索算法[J].中国机械工程,2006,17(16):1741-1743.
作者姓名:潘全科  朱剑英
作者单位:1. 聊城大学,聊城,252059
2. 南京航空航天大学,南京,210016
基金项目:国家自然科学基金;山东省自然科学基金
摘    要:提出了解决无等待流水线调度问题的变邻域搜索调度算法。采用基于自然数编码的工件序列表达问题的解,采用多重Insert移动邻域和多重Swap移动邻域作为变邻域搜索的两种邻域结构。多重移动有利于算法向包含较优解的区域搜索,因而有较高的求解质量和效率。仿真实验证明了变邻域搜索算法的有效性。

关 键 词:无等待流水线调度问题  生产周期  变邻域搜索算法  多重移动
文章编号:1004-132X(2006)16-1741-03
收稿时间:2005-09-02
修稿时间:2005-09-02

A Variable Neighborhood Search for No-wait Flow Shop Scheduling
Pan Quanke,Zhu Jianying.A Variable Neighborhood Search for No-wait Flow Shop Scheduling[J].China Mechanical Engineering,2006,17(16):1741-1743.
Authors:Pan Quanke  Zhu Jianying
Affiliation:1. Liaocheng University, Liaocheng, Shandong, 252059; 2. Nanjing University of Aeronautics and Astronautics, Nanjing, 210016
Abstract:A variable neighborhood search algorithm was presented to solve the no-wait flow shop problem with makespan criterion. In the algorithm, the natural encoding scheme based on job permutation was employed. Multimoves were used that consisted in performing several moves simultaneously in a single iteration of algorithm and allowed us to accelerate the convergence to good solutions. Computational results based on the well known benchmark suites in the literature show that the proposed algorithm is effective and efficient on finding optimum or near-optimal solutions, and produces either competitive or better results than that of the taboo search algorithm of Grabowski and Pempera for the makespan criterion.
Keywords:no- wait flow shop scheduling  makespan  variable neighborhood search  multimove
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号