A scheduling analysis in FMS using the transitive matrix

Authors:
Jong-Kun Lee
Affiliations:
LIS/Computer Engineering Dept, Changwon national University, Changwon, Kyungnam, Korea
Venue:
AIS'04 Proceedings of the 13th international conference on AI, Simulation, and Planning in High Autonomy Systems
Year:
2004

Citing 1
Cited 1

Timed Petri net schedules

Advances in Petri Nets 1988

Scheduling analysis of FMS: an unfolding timed Petri nets approach

Mathematics and Computers in Simulation - Special issue: Computational engineering in systems applications (CESA 2003)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The analysis of the scheduling problem in FMS using the transitive matrix has been studied. Since the control flows in the Petri nets are based on the token flows, the basic unit of concurrency (short BUC) could be defined to be a set of the executed control flows in the net. In addition, original system could be divided into some subnets such as BUC of the machine's operations and analyzed the feasibility time in each schedule. The usefulness of transitive matrix to slice off some subnets from the original net, and the explanation in an example will be discussed.