Decomposition of Time Petri Nets for Solving Optimal FiringSequence Problem

この論文にアクセスする

この論文をさがす

抄録

Petri net model is a frequently-used versatile tool which can represent a widely discrete event system. However, when the scale of the system becomes large, the calculation time for solving optimal problem (optimal firing sequence problem) is markedly increased. In this paper, we propose an approximation method that achieves the efficiency improvement of the solution by decomposing the Petri net for solving the optimal firing sequence problem.A timed Petri Net is decomposed into several subnets in which the optimal firing sequence for each subnet is solved by Dijkstra's algorithm in polynomial computational complexity.The effectivity of the proposed method is verified by numerical experiments for the flowshop schedule problem.

収録刊行物

  • Memoirs of the Faculty of Engineering, Okayama University

    Memoirs of the Faculty of Engineering, Okayama University 41(1), 44-51, 2007-01

    Faculty of Engineering, Okayama University

各種コード

  • NII論文ID(NAID)
    120002308128
  • NII書誌ID(NCID)
    AA10699856
  • 本文言語コード
    ENG
  • 資料種別
    departmental bulletin paper
  • ISSN
    0475-0071
  • データ提供元
    IR 
ページトップへ