Writing maximum gap constraints for part routing in manufacturing systems modelled as Petri nets
Davide Giglio, R. Minciardi · Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228) · 2003
Considers the problem of part routing within a manufacturing system, represented as a timed Petri net. On the basis of such a model, it is possible to write the constraints affecting the system behaviour. A scheme is proposed in which token assignment (i.e., part routing) decisions must fulfill maximum gap constraints, which limit the set of allowed routing decision sequences.