In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 340: Advances in Petri Nets 1988, pages 62-84. Springer-Verlag, 1988.
Abstract: Timed Petri Net schedules are introduced, and some of their properties are studied. It is proven that the set of schedules issued from a firable sequence of the underlying Petri net has a minimum element called the earliest schedule of the sequence. A polynomial algorithm is proposed to compute it.