このエントリーをはてなブックマークに追加
ID 14083
Eprint ID
14083
FullText URL
Author
Maeno, Ryota
Konishi, Masami
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.
Published Date
2007-01
Publication Title
Memoirs of the Faculty of Engineering, Okayama University
Volume
volume41
Issue
issue1
Publisher
Faculty of Engineering, Okayama University
Publisher Alternative
岡山大学工学部
Start Page
44
End Page
51
ISSN
0475-0071
NCID
AA10699856
Content Type
Departmental Bulletin Paper
language
英語
File Version
publisher
Refereed
False
Eprints Journal Name
mfe