Priority-List Scheduling in Timed Petri Nets

Takenobu TANIDA; Toshimasa WATANABE; Masahiro YAMAUCHI; Kinji ONAGA

Copy

Takenobu TANIDA, Toshimasa WATANABE, Masahiro YAMAUCHI, Kinji ONAGA, "Priority-List Scheduling in Timed Petri Nets" in IEICE TRANSACTIONS on Fundamentals, vol. E75-A, no. 10, pp. 1394-1406, October 1992, doi: .
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e75-a_10_1394/_p

Copy

@ARTICLE{e75-a_10_1394,
author={Takenobu TANIDA, Toshimasa WATANABE, Masahiro YAMAUCHI, Kinji ONAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Priority-List Scheduling in Timed Petri Nets},
year={1992},
volume={E75-A},
number={10},
pages={1394-1406},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - Priority-List Scheduling in Timed Petri Nets
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1394
EP - 1406
AU - Takenobu TANIDA
AU - Toshimasa WATANABE
AU - Masahiro YAMAUCHI
AU - Kinji ONAGA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1992
AB - 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.
ER -