Share Email Print
cover

Proceedings Paper

Scheduling multirobot operations in manufacturing by truncated Petri nets
Author(s): Qin Chen; J. Y.S. Luh
Format Member Price Non-Member Price
PDF $14.40 $18.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

Scheduling of operational sequences in manufacturing processes is one of the important problems in automation. Methods of applying Petri nets to model and analyze the problem with constraints on precedence relations, multiple resources allocation, etc. have been available in literature. Searching for an optimum schedule can be implemented by combining the branch-and-bound technique with the execution of the timed Petri net. The process usually produces a large Petri net which is practically not manageable. This disadvantage, however, can be handled by a truncation technique which divides the original large Petri net into several smaller size subnets. The complexity involved in the analysis of each subnet individually is greatly reduced. However, when the locally optimum schedules of the resulting subnets are combined together, it may not yield an overall optimum schedule for the original Petri net. To circumvent this problem, algorithms are developed based on the concepts of Petri net execution and modified branch-and-bound process. The developed technique is applied to a multi-robot task scheduling problem of the manufacturing work cell.

Paper Details

Date Published: 28 August 1995
PDF: 8 pages
Proc. SPIE 2620, International Conference on Intelligent Manufacturing, (28 August 1995); doi: 10.1117/12.217477
Show Author Affiliations
Qin Chen, KLA Instruments Corp. (United States)
J. Y.S. Luh, Clemson Univ. (United States)


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