There are 3 workers. There...

About this model

There are 3 workers. There is a central table with infinite flour. Two identical dough stations (Station A and Station B) each make dough in two steps: Step 1 (loading flour) takes 3.5 seconds, Step 2 (adding water) takes 2.5 seconds. Once started, both steps run automatically without worker supervision. To start Step 1, a worker must take flour from the table to an empty dough station, which takes exactly 1 second. To start Step 2, the worker just needs to be at the station (action time is 0 seconds). After a dough station finishes Step 2, the dough must be moved to one of two baking machines. Baking machine 1 takes 4.5 seconds, baking machine 2 takes 5.5 seconds. Baking does not require a worker. After baking, the pastry must be processed by a worker for 4 seconds (worker is fully occupied during these 4 seconds). Processing can be done by any worker, and multiple workers can process different pastries at the same time.

Please simulate this system and find the maximum throughput (processed pastries per second) and the optimal task assignment for the 3 workers. Show me the resource flow and worker duty cycles.

"There are 3 workers. There..." is a public Machinations diagram shared in the Community by 睿杰 王, with 23 components.

It was created in May 2026 and last edited in May 2026.

Open the diagram in the Machinations app and press Play to watch the resources move, adjust its values to test how the system responds, or remix it to make an editable copy in My diagrams.