Share Email Print

Proceedings Paper

Reduced Petri nets model of scheduling problem
Author(s): Dan Yu; Bo Zhang; Chen Chen
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 28 August 1995
PDF: 6 pages
Proc. SPIE 2620, International Conference on Intelligent Manufacturing, (28 August 1995); doi: 10.1117/12.217471
Show Author Affiliations
Dan Yu, Tsinghua Univ. (China)
Bo Zhang, Tsinghua Univ. (China)
Chen Chen, Tsinghua Univ. (China)

Published in SPIE Proceedings Vol. 2620:
International Conference on Intelligent Manufacturing
Shuzi Yang; Ji Zhou; Cheng-Gang Li, Editor(s)

© SPIE. Terms of Use
Back to Top