• 论文 •    

生产时间可变间歇过程的Petri网模型及其调度

廖伟志,古天龙,蔡国永   

  1. 1.西安电子科技大学 电子工程学院,陕西西安710071;2.广西师范学院 信息技术系,广西南宁530001;3.桂林电子科技大学 计算机与控制学院,广西桂林541004
  • 出版日期:2009-01-15 发布日期:2009-01-25

Pteri net model and its scheduling of batch process with variable cycle time

LIAO Wei-zhi, GU Tian-long,, CAI Guo-yong   

  1. 1.School of Electronic Engineering, Xidian University, Xian 710071,China;2.Department of Information Technology, Guangxi Teachers Education University, Nanning 530001,China;3.School of Computer & Control, Guilin University of Electronic Technology, Guilin 541004, China
  • Online:2009-01-15 Published:2009-01-25

摘要: 讨论了生产时间可变的多产品间歇过程的最优调度问题,给出了间歇过程在复杂中间的无限存储策略、有限存储策略、无中间存储策略和混杂存储策略下p-时间Petri网模型的描述方法,进而给出了基于可行调度集和修正分枝界定的间歇过程最短生产时间的最优调度算法。该算法利用一间歇过程最短生产时间不大于另一间歇过程最短生产时间的条件,有效地限制了对解空间的搜索,进而改善了算法的计算性能。仿真算例表明了所述方法的有效性。

关键词: 离散事件系统, 间歇过程, 调度, Petri网, 仿真

Abstract: Optimal scheduling problem of batch process with variable cycle time was discussed. A p-time Petri net model description approach for batch process with complicated intermediate storage policies (such as:unlimited intermediate storage, finite intermediate storage, no intermediate storage, and mixed intermediate storage) was presented. Then, an algorithm for short-term scheduling of batch process based on a feasible scheduling set and a modified branch & bound was developed. In this method, by applying the condition that the minimal makespan of one batch was not longer than the minimal makespan of the other batch, thereby the explicit enumeration of search was avoided so that the algorithm performance was improved. Effectiveness of the proposed approach and algorithm were demonstrated by simulation.

Key words: discrete event systems, batch process, scheduling, Petri nets, simulation

中图分类号: