In: IEICE Transactions, Vol. E74, No. 10, October 1991, Special Issue on Petri Nets and Discrete Event Systems. 1991.
Abstract: The subject of the paper is to propose two approximation algorithms FMSPLA, FMDPLA 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.