基于着色Petri网实现A星算法的生产调度优化研究  

A Star Algorithm for Scheduling Optimization Based on Colored Petri Nets

作　　者：任上[1] 秦江涛[2] 

机构地区：[1]上海理工大学信息化办公室,上海200093 [2]上海理工大学管理学院,上海200093

出　　处：《上海理工大学学报》2013年第5期463-468,474,共7页Journal of University of Shanghai For Science and Technology

基　　金：国家自然科学基金资助项目(71071097)

摘　　要：基于着色Petri网对A星算法进行建模,研究生产调度优化问题.利用着色Petri网的理论优势,简化了大规模复杂工艺生产过程的调度模型过于复杂的问题.直接建立A星算法的着色Petri网模型,对于生产调度研究中的跨平台问题给出了一种解决方法.通过着色Petri网仿真模拟软件CPN Tools构建了基于着色Petri网的A星算法实例和生产调度实例.The scheduling process and A star algorithm were modeled based on colored Petri nets.The complexity of scheduling process resulting from mass scale and complicated procedures of manufacturing system was decreased by taking the advantage of colored Petri nets theory. Moreover,the A star algorithm was modeled based on colored Petri nets directly in order to solve the problem of doing production scheduling on some different software platforms. Apretical modelling example of scheduling and A star algorithm was conducted colored Petri nets by use of the modeling and simulation software CPN Tools.

关 键 词：着色PETRI网 生产调度 A星算法 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]