Decomposition of Time Petri Nets for Solving Optimal FiringSequence Problem

Access this Article

Search this Article

Abstract

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.

Journal

  • 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

Codes

  • NII Article ID (NAID)
    120002308128
  • NII NACSIS-CAT ID (NCID)
    AA10699856
  • Text Lang
    ENG
  • Article Type
    departmental bulletin paper
  • ISSN
    0475-0071
  • Data Source
    IR 
Page Top