Input
Algorithm
Round Robin
Shortest Remaining Time First (SRTF)
Arrival Times (space-separated)
Burst Times (space-separated)
Time Quantum (RR only)
Solve
Clear
Notes
• Processes named P1, P2, P3 ... in input order.
• Arrival & Burst lists must be same length.
• Quantum used only for Round Robin.
Gantt Chart
Visual timeline of CPU scheduling
CPU Utilization: —
P1
P2
P3
P4
Timeline (0 — 22)
Job
Arrival
Burst
Finish
Turnaround
Waiting
A
0
5
5
5
0
B
0
3
8
8
5
C
1
8
16
15
7
D
2
6
22
20
14