Self-scheduling agent fleet

Workers pull their own work

Six workers, one shared queue, no dispatcher. Each worker independently pulls the next task and locks it with an atomic claim — exactly one worker wins each bead, and the losers simply move on.

Share as GIF

Six bead-workers, one shared queue. Each worker independently runs the same loop — SELECT → CLAIM → BUILD → DISPATCH → EXECUTE → OUTCOME — pulling beads from the bead-queue with atomic claims: exactly one worker wins each bead, losers move on to the next. Success closes a bead, failure re-queues it, timeout defers it. No dispatcher, no coordinator — just the loop, running unattended. The workers aren't uniform, either — each one drives a different agent harness (Claude Code, Codex, Goose, Pi) and model through the same adapter contract: prompt in, exit code out.

A deterministic simulation — the same run every load.