A recorded time in a station can include both waiting and processing. An event timeline makes that distinction explicit before any averages are compared.
Name the three event timestamps
Queueing descriptions distinguish time in a waiting area from time in the entire system. For a job that visits one service operation, define its arrival a, service start s and departure d. Queue waiting is s − a, service is d − s, and total residence is d − a. Primary reference: MIT Markov processes and queues lecture.
Name the proposed events precisely. Arrival at a conveyor entrance differs from queue admission. If transfer follows service, include it in the boundary or record it separately; the departure event determines that choice.
Reconcile one fictional job
Consider a hypothetical job arriving at minute 0, starting service at minute 4 and departing at minute 7. Waiting is 4 minutes, service is 3 minutes and total residence is 7 minutes. Adding the 3-minute service again to the 7-minute total would count the same interval twice.
Conversely, describing the 4-minute wait as the job’s total station time omits processing. Write the arithmetic beside the timeline rather than choosing a quantity solely because a dashboard calls it cycle time. The example defines one uninterrupted visit; it does not silently combine repeated visits or parallel tasks.
Choose the comparison quantity
For a proposed scheduling comparison, keep an individual-job event ledger and derive each duration from the same event pair in both scenarios. Report waiting and total residence in separate columns so a reduced queue delay is not confused with a faster service operation.
Then inspect unusual jobs individually: a canceled request, interrupted operation or job still inside at the observation endpoint needs an explicit treatment. No averaging rule here establishes actual production time or an acceptance threshold. The purpose is to make the meaning of a reported duration reviewable.
Customer Questions
Does total residence include service?
Yes, for a boundary containing the queue and that service operation.
What is waiting in the 0, 4, 7-minute example?
Four minutes; the remaining three minutes are service.
Can a repeated visit use the same simple timeline?
Each visit must be identified, or the larger boundary must explicitly include the repeated route.
Primary References
These references support the technical principles discussed in this guide. The worked examples and review questions are educational.
Discuss Your Machine Requirement
Share your product, container, required output and the evidence needed for your technical review.
Request a Technical Review