摘要
针对置换流水车间调度问题,提出了一种基于模拟植物生长的调度算法。该算法利用置换流水车间调度的有向图表示,提出了可交换节点集概念,并将其融入模拟植物生长算法中,解决置换流水车间调度问题。采用所提算法对置换流水车间调度问题的基准数据进行测试,并比对标准遗传算法,结果表明算法的有效性。
This paper proposed a new effective hybrid algorithm which based on plant growth simulation algorithm for permutation flow shop scheduling with the criterion to minimize the maximum completion time （ makespan） . In the algorithm,developed a directed graph which based on the characteristic of flow shop scheduling problem representation,proposed and incorporated and an efficient exchangeable node set into plant growth simulation algorithm. Simulation results based on well known benchmarks and compare with standard genetic algorithm demonstrate the effectiveness of the proposed bionic algorithm.
出处
《计算机应用研究》
CSCD
北大核心
2010年第10期3670-3672,共3页
Application Research of Computers
基金
高等学校博士点基金资助项目(20093120110008)
上海市重点学科建设资助(S30504)
关键词
置换流水车间调度
智能优化算法
模拟植物生长算法
最大完工时间
permutation flow shop scheduling
intelligent optimization algorithms
plant growth simulation algorithm
makespan
