CPU Scheduling Simulator

Simulate how an Operating System schedules processes. Enter process data, choose an algorithm (FCFS, SJF, Round Robin, Priority), and view completion time, turnaround time, waiting time, and a Gantt chart.

Input process data

1. Choose scheduling algorithm

Required: Process ID, Arrival Time (AT), Burst Time (BT).

2. Enter process data

Process	Arrival Time (AT)	Burst Time (BT)	Priority (1=highest)

Formulas & algorithms

Completion Time (CT) = Time when process finishes
Turnaround Time (TAT) = CT − Arrival Time
Waiting Time (WT) = TAT − Burst Time
FCFS — Executes in arrival order
SJF — Shortest burst time first (non-preemptive)
Round Robin — Fixed time slice (quantum), cycle through ready queue
Priority — Highest priority first (lower number = higher priority, non-preemptive)