摘要
提出了解决无等待流水线调度问题的变邻域搜索调度算法。采用基于自然数编码的工件序列表达问题的解,采用多重Insert移动邻域和多重Swap移动邻域作为变邻域搜索的两种邻域结构。多重移动有利于算法向包含较优解的区域搜索,因而有较高的求解质量和效率。仿真实验证明了变邻域搜索算法的有效性。
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.
出处
《中国机械工程》
EI
CAS
CSCD
北大核心
2006年第16期1741-1743,共3页
China Mechanical Engineering
基金
国家自然科学基金资助项目(50275078)
山东省自然科学基金资助项目(2004ZX14)
