Simulation Lab › CPU Scheduling › FCFS
CPU Scheduling

FCFS Scheduling Simulation

First Come First Serve — processes execute in arrival order. Non-preemptive.
Add processes below to generate a live animated Gantt chart.

Non-Preemptive  Animated Gantt  Auto Statistics
About FCFS: Processes are executed in the order they arrive. The simplest scheduling algorithm — no starvation, but can cause the "convoy effect" where short processes wait behind long ones.
Key Formulas: Completion Time (CT) = start + burst Turnaround Time (TAT) = CT − arrival Waiting Time (WT) = TAT − burst
Process Configuration
Process Arrival Time Burst Time Priority Action