상황
A manufacturing system schedules two types of jobs (A and B) using a shared pool of 3 machines. Each job type has a queue and processing time (A: exponential mean 1, B: mean 0.5 time units). Place invariants ensure the total number of machines is conserved.
이 도면에 담긴 내용
그 이면의 의사결정을 읽어 보세요.
01
Model job queues as places with initial tokens
02
Use timed transitions for processing times
03
Enforce machine availability with shared resource place
This pattern generalizes to any resource-constrained scheduling with distinct job classes and stochastic processing times.