Event Graph
Timed formalisms: Event Graphs
A workcenter has K identical machines with a single worker. Arriving parts
are loaded on a machine by the worker. If all machines are busy the parts
wait in a queue. The parts must also wait until the worker is free. Once
loaded machines process a part. When completed, the part must be
B : worker status {0,1} (1 if idle, 0 if busy)
M , 0 <= M<= K, available machines,
U : parts waiting for unloading,
P : total number of part processed,
ta : time between part arrival,
ts : part processing time.