ID | 14083 |
JaLCDOI | |
Sort Key | 5
|
フルテキストURL | |
著者 |
前野 良太
Dept. of Electrical and Electronic Engineering The Graduate School of Natural Science and Technology Okayama University
小西 正躬
Dept. of Electrical and Electronic Engineering The Graduate School of Natural Science and Technology Okayama University
今井 純
Dept. of Electrical and Electronic Engineering The Graduate School of Natural Science and Technology Okayama University
Kaken ID
researchmap
|
抄録 | 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号
|
出版者 | Faculty of Engineering, Okayama University
|
出版者(別表記) | 岡山大学工学部
|
開始ページ | 44
|
終了ページ | 51
|
ISSN | 0475-0071
|
NCID | AA10699856
|
資料タイプ |
紀要論文
|
OAI-PMH Set |
岡山大学
|
言語 |
英語
|
論文のバージョン | publisher
|
NAID | |
Eprints Journal Name | mfe
|