Process Scheduling Visualizer

Build a CPU timeline and compare completion, turnaround, waiting and response times.

AlgorithmNon-preemptive; arrival then input order breaks ties Time quantumWhole time units, 1–100; schedules are capped at 600 slices

Processes — one per line: name, arrival, burst1–12 unique names; arrival 0–10,000; burst 1–10,000. Equal arrival times use input order.

A single-CPU teaching model with no context-switch overhead. SJF is non-preemptive; Round Robin appends newly arriving work before the interrupted process rejoins the queue.

Copyable schedule