1-2hit |
Takenobu TANIDA Toshimasa WATANABE Masahiro YAMAUCHI Kinji ONAGA
The subject of the paper is to propose two approximation algorithms FM_SPLA, FM_DPLA for priority-list scheduling in timed Petri nets. Their capability is compared with that of existing algorithms SPLA, DPLA through experimental results, where SPLA and DPLA have previously been proposed by the authors.
Toshimasa WATANABE Takenobu TANIDA Masahiro YAMAUCHI Kenji ONAGA
The subject of the paper is the minimum initial marking problem for scheduling in timed Petri net PN: given a vector X of nonnegative integers, a P-invariant Y of PN and a nonnegative integer π, find an initial marking M minimizing the value Ytr