›› 2014, Vol. 27 ›› Issue (5): 179-.

• Articles • Previous Articles     Next Articles

Research on Multi-objective and Deadlock-free Ant Colony Optimization Scheduling Algorithm with Petri Nets

HUI Xiaolong,GAO Zhenxin   

  1. (1.Division of Communications,No.20 Institute of China Electronic Technology Group Corporation,Xi'an 710068,China;2.Systems Engineering Institute,Xi'an Jiaotong University,Xi'an 710068,China)
  • Online:2014-05-15 Published:2014-05-14


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.

Key words: Petri nets;ant colony algorithm;scheduling

CLC Number: 

  • TN301.6