著者 前野 良太|
発行日 2009-03-25
出版物タイトル
資料タイプ 学位論文
JaLCDOI 10.18926/14083
フルテキストURL Mem_Fac_Eng_OU_41_1_44.pdf
著者 前野 良太| 小西 正躬| 今井 純|
抄録 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
発行日 2007-01
41巻
1号
開始ページ 44
終了ページ 51
ISSN 0475-0071
言語 English
論文のバージョン publisher
NAID 120002308128