Reduced Petri nets model of scheduling problem

Dan Yu; Bo Zhang; Chen Chen

doi:10.1117/12.217471

28 August 1995 Reduced Petri nets model of scheduling problems

Dan Yu, Bo Zhang, Chen Chen

Proceedings Volume 2620, International Conference on Intelligent Manufacturing; (1995) https://doi.org/10.1117/12.217471
Event: International Conference on Intelligent Manufacturing, 1995, Wuhan, China

Abstract

In order to model and solve scheduling problems, a new Petri Nets Model, Reduced Petri Nets (RePN), is introduced. Compared with previous Petri Nets models of scheduling problems, the RePN model not only has strong ability of analysis but also reduces the number of places and transitions in a great amount. So the reachable set of the RePN model is much smaller, which makes it more convenient to search the optimal or near-optimal solution of scheduling problems.

Citation Download Citation

Dan Yu, Bo Zhang, and Chen Chen "Reduced Petri nets model of scheduling problems", Proc. SPIE 2620, International Conference on Intelligent Manufacturing, (28 August 1995); https://doi.org/10.1117/12.217471

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available