Markovian timed Petri nets for performance analysis of semiconductor manufacturing systems

Citation
Md. Jeng et al., Markovian timed Petri nets for performance analysis of semiconductor manufacturing systems, IEEE SYST B, 30(5), 2000, pp. 757-771
Citations number
12
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
ISSN journal
10834419 → ACNP
Volume
30
Issue
5
Year of publication
2000
Pages
757 - 771
Database
ISI
SICI code
1083-4419(200010)30:5<757:MTPNFP>2.0.ZU;2-D
Abstract
A subclass of generalized stochastic Petri Nets (GSPNs) with priorities, ca lled Markovian timed Petri nets, are proposed to model semiconductor manufa cturing systems that consider process priorities, routing priorities, resou rce re-entrance, and nonpreemptive operations, Uniformization technique is used to establish both lower and upper bounds of the performance of interes t. These bounds are computable using linear programming. Numerical experime nts have been conducted to evaluate the accuracy of the bounds using models adapted from real-world systems. The experiments show that the upper bound s are very close to the simulation results. Thus, performance measures can be accurately estimated using these bounds.