摘要
蚁群算法已被广泛应用于解决调度问题,针对资源受限的项目调度问题,死锁和多目标问题是重要的课题研究。文中针对具有死锁资源受限的多目标调度问题,采用Petri网模型,研究其蚁群调度算法,以紧急项目的完成时间和所有项目的完成时间最短为优化目标,并通过仿真实验验证了文中算法的有效性和实用性。
The ant colony algorithm has been widely used to solve scheduling problems. Deadlocks and multi- objective problems are important researches for Resource Constrained Project Scheduling Problem （RCPSP）. This paper studies the RCPSP with deadlocks and multi-objective problems. Petri net model is established to study the ant colony scheduling algorithm. Optimization goal is the shortest time of finishing emergency project and all projects. Simulation results show the effectiveness and usefulness of the algorithm.
出处
《电子科技》
2014年第5期179-181,共3页
Electronic Science and Technology
关键词
PETRI网
蚁群算法
调度
Petri nets
ant colony algorithm
scheduling
