Bottles pass through a filler, capper and labeler. Finite accumulation lanes fill and empty. A completed bottle blocks a machine when its downstream lane is full; an empty upstream lane starves the next machine.
• A 3D laboratory scene with: Liquid filler and feed tank; Rotary capper; Label reel and applicator; Two accumulation lanes; Machine-state tower. • Controls: Filling time (1-8 s/bottle); Capping time (1-8 s/bottle); Labeling time (1-8 s/bottle); Each lane capacity (1-8 bottles); Capper outage from 12 to 22 s. • Live readouts: Dispatched bottles; Observed throughput; Nominal bottleneck capacity; Bottles in line; Filler blocked time; Labeler starved time. • Guided experiments: Slow capper; Move the constraint; Temporary outage.
• Nominal capacity=min(60/a,60/b,60/c) bottles/min • Finite buffers store waiting bottles; completed machines block if no slot is free • Flow accounting: admitted = output + machines occupied + buffer contents • Observed rate=60×departures/elapsed seconds.
Three serial deterministic servers with unlimited input and output, finite intermediate buffers and blocking after service. Fixed 0.02-second integration; process times are integer seconds. The optional capper outage pauses processing for ten seconds. Startup and interruption effects make short-run output differ from nominal capacity.
No, it may be starved. Upstream limitations can leave a fast downstream resource waiting.
No. Buffers absorb interruptions but do not change service times.
The first lane fills, the filler blocks and the labeler often starves.
Three serial deterministic servers with unlimited input and output, finite intermediate buffers and blocking after service. Fixed 0.02-second integration; process times are integer seconds. The optional capper outage pauses processing for ten seconds. Startup and interruption effects make short-run output differ from nominal capacity.