引用本文:李鑫,黎良,何舟.基于时延 Petri网与代价函数的柔性制造系统优化调度[J].控制理论与应用,2026,43(2):413~422.[点击复制]
LI Xin,LI Liang,HE Zhou.Optimal scheduling of flexible manufacturing systems based on timed Petri nets and cost function[J].Control Theory & Applications,2026,43(2):413~422.[点击复制]
基于时延 Petri网与代价函数的柔性制造系统优化调度
Optimal scheduling of flexible manufacturing systems based on timed Petri nets and cost function
摘要点击 135  全文点击 20  投稿时间：2024-04-07  修订日期：2025-04-12
查看全文  查看/发表评论  下载PDF阅读器   HTML
DOI编号  10.7641/CTA.2024.40211
  2026,43(2):413-422
中文关键词  离散事件系统  调度  Petri网  可达图
英文关键词  discrete event systems  scheduling  Petri nets  reachability graph
基金项目  国家自然科学基金项目(62303359, 62373234)资助.
作者单位E-mail
李鑫 武汉科技大学 信息科学与工程学院 Taylorvic@126.com 
黎良* 武汉科技大学 信息科学与工程学院 liangli@wust.edu.cn 
何舟 陕西科技大学 电气与控制工程学院  
中文摘要
      针对柔性制造系统最小完工时间的调度问题, 本文提出一种基于时延Petri网和代价函数的调度算法. 首先, 对现有基于时延Petri网的调度算法进行分析, 引入一种考虑当前标识和后继标识到目标标识的变迁发射向量的代 价函数; 其次, 通过遍历部分可达图的标识代价函数值选取下一步发射的变迁, 并利用回溯法避免系统的死锁标识 和不满足系统规格的标识; 从而, 获得时延Petri网系统的逻辑变迁序列. 通过将逻辑变迁序列转为时延变迁序列, 找 到最小时间的变迁序列; 进而, 获得系统最小完工时间的调度方案; 最后, 利用实例验证本文方法的可行性和有效 性.
英文摘要
      To solve the problem of scheduling for the minimum completion time of tasks in a flexible manufacturing system, this paper proposes a scheduling algorithm based on timed Petri nets (TdPN) and cost function. Firstly, by analyzing the existing TdPN-based scheduling algorithms, we introduce a novel cost function taking into account the transition firing vectors from the current marking and subsequent markings to the target one. Then, through traversing the cost functions of markings in the partial reachable graph, the firing of next transition is selected. Meanwhile, the employment of backtracking method prevents deadlock markings and those markings that do not meet the system specifications, thereby obtaining logical transition sequences of the TdPN system. By transforming the logical transition sequences into timed ones, the minimum time transition sequences are computed, and then the scheduling scheme for the minimum completion time of the system can be obtained. Finally, the feasibility and effectiveness of the approach presented in this paper are validated through practical instances.