Abstract

Abstract In this paper, we use Petri nets to analyse flexible manufacturing systems (FMS) to achieve the following objectives. The first objective is to derive a theorem for checking the buffer overflows in an FMS. The second objective is to schedule the earliest starting times for a sequence of operations in an FMS by the timed Petri net. The FMS may involve many part types, machines, pallets and so on. The third objective is to detect the deadlock phenomenon by a corrected algorithm of the P-invariant theory for Petri nets. This method will enable us to know whether there exists any deadlock in an FMS. The algorithm is implemented in the Turbo Pascal language. The fourth objective is to search for the optimal scheduling rule in an FMS. The search procedure is also implemented in the Turbo Pascal language¨ The optimal machine scheduling rule can result in a better throughput.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.