Abstract
Steady-state performance evaluation of some repetitive automated manufacturing
systems modelled by means of stochastic or deterministic timed Petri
nets is considered. Basically, concepts and techniques developed
by the authors in other works are applied to repetitive manufacturing
systems in this paper. Linear programming problems defined on the
incidence matrix of the underlying Petri nets are used to compute
tight upper and lower bounds for the performance measures of job-shop
systems and decision-free kanban systems in polynomial time on the
net structure. The results can be extended to other models in which
some decisions are allowed, such as producer-consumer systems with
mutual exclusion. Exact performance measures for a class of systems
containing sequential processes can be computed in polynomial time.
Users
Please
log in to take part in the discussion (add own reviews or comments).