Event Graph

Timed formalisms: Event Graphs

Uɬ

arrival

End

loading.

Start

loading.

ta

(Bɬ

et

Mɬ)

(B++)

(Qɬ et Mɬ)

tl

Q++

Q --, B--, M --

Finish

processing

End

unloading

Start

unloading.

(Bɬ)

(B++, U --,

M ++, P ++)

(Uɬ)

tu

U++

B--

CONFLICT

ts

Conflicts : priority for the events

ts : time of service, a machine start processing as soon as it is loaded

Processing

Diapositiva precedente

Diapositiva successiva

Torna alla prima diaposiva

Visualizza versione grafica