| 基于启发式规则和蚁群算法的车间作业调度方法 |
| |
| 引用本文： | 温蕴,孙亚.基于启发式规则和蚁群算法的车间作业调度方法[J].计算机应用与软件,2009,26(6):187-188,194. |
| |
| 作者姓名： | 温蕴 孙亚 |
| |
| 作者单位： | 浙江丽水广播电视大学理工教研室,浙江,丽水,323000 |
| |
| 摘 要： | 车间作业调度问题是一个典型的NP-hard问题,也是一个前沿性的研究课题,已受到学术界和工业界的广泛关注。提出了一种基于启发式规则和蚁群算法的车间作业调度方法。该方法首先采用蚁群算法得到车间作业调度问题的一组可行解,然后采用一些启发式规则进一步优化这些可行解。通过将启发式规则有效地融入到蚁群算法中,使得该混合方法的优化效率得到极大的改进。仿真实例表明,方法是可行的、正确的和有效的。
|
| 关 键 词： | 车间作业调度问题 蚁群算法 启发式规则 |
AN APPROACH FOR JOB SHOP SCHEDULING BASED ON HEURISTIC RULE AND ANT COLONY ALGORITHM |
| |
| Wen Yun,Sun Ya.AN APPROACH FOR JOB SHOP SCHEDULING BASED ON HEURISTIC RULE AND ANT COLONY ALGORITHM[J].Computer Applications and Software,2009,26(6):187-188,194. |
| |
| Authors: | Wen Yun Sun Ya |
| |
| Affiliation: | Lishui Radio and Television University;Lishui 323000;Zhejiang;China |
| |
| Abstract: | Job shop Scheduling Problem(JSSP) is a typical NP-hard problem and a front-subject researched by many scholars,which has been paid close attention to by both academia and industry.A scheduling approach based on heuristic rule and ant colony algorithm for solving JSSP is proposed.This proposed approach achieves a set of feasible solutions of JSSP using ant colony algorithm firstly,and then refines these feasible solutions using some heuristic rules.The optimized performance of this approach has been improved... |
| |
| Keywords: | Job shop scheduling problem Ant colony algorithm Heuristic rule |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
