Advances in Petri Nets 1988
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Analysis of Petri Nets by Ordering Relations in Reduced Unfoldings
Formal Methods in System Design
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A scheduling analysis in FMS using the transitive matrix
AIS'04 Proceedings of the 13th international conference on AI, Simulation, and Planning in High Autonomy Systems
Robotics and Computer-Integrated Manufacturing
Modeling a flexible manufacturing cell using stochastic Petri nets with fuzzy parameters
Expert Systems with Applications: An International Journal
Optimal number of pallets for reconfigurable cyclic manufacturing plants
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
| Hi-index | 0.00 |
We are interested in Flexible Manufacturing Systems (FMS) scheduling problem. Different methods have been explored to solve this problem and mainly to master its combinatorial complexity: NP-hard in the general case. This paper presents an analysis of the cyclic scheduling for the determination of the optimal cycle time and the minimization of the Work In Process (WIP). Especially, the product ratio-driven FMS cyclic scheduling problem using timed Petri nets (TPN) unfolding is described. In addition, it has been proved that the Basic Unit of Concurrency (BUC) is a set of the executed control flows based on the behavioral properties of the net. Using our method, one could divide original system into some subnets based on machine's operations using BUC and analyze the feasibility time in each schedule. Herein, our results showed the usefulness of transitive matrix to slice off some subnets from the original net, and explained in an example.