Iterative local search algorithm for no-wait flowshop scheduling problems to minimize makespan

被引：0
|
作者：
Wang, Chuyang [1 ]
Li, Xiaoping [2 ]
Wang, Qian [2 ]
机构：
[1] Southeast Univ, Sch Engn & Comp Sci, Nanjing 210096, Peoples R China
[2] Southeast Univ, Minist Educ, Key Lab Comp Network & Informat Integrat, Nanjing 210096, Peoples R China
来源：
PROCEEDINGS OF THE 2008 12TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS I AND II | 2008年
基金：
中国国家自然科学基金;
关键词：
local search; no-wait flowshop; makespan; dynamic programming;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, NP-hard no-wait flowshop scheduling problems with makespan minimization are considered. An iterative local search method is proposed which performs a randomized walk in the space of local optima until some stop criterion is satisfied A perturbation mechanism and a compound neighborhood operator (or move) are presented. The proposal is compared with the best algorithm so far. Experimental results show the proposed algorithm outperforms the existing one in effectiveness and in efficiency.
引用
收藏
页码：908 / +
页数：2
相关论文
共 50 条
12345