摘要
提出一种根据搜索进展自适应设定门槛值和邻域搜索次数的改进TA算法．对无优先级双目标FlowShop问题进行求解，并与现有启发式算法进行了比较．计算比较结果表明：所提算法可以求得稳定、高质量的解．
An adaptive version of TA algorithm called ATA algorithm is proposed to solve flow shop scheduling problem with multiple criteria in this paper. The ATA algorithm can determine thethreshold value and the number of neighborhood search adaptively according to recent search performance. When compare with the existing heuristic algorithm in computing the flow shop scheduling problem with bicriteria of makespan and total flow time, the proposed algorithm is found to perform better.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2000年第5期62-65,共4页
Systems Engineering-Theory & Practice
