SJF Scheduling Algorithm   Non - Preemptive

Shortest Job First (SJF) is an algorithm in which the process having the smallest execution time is chosen for the next execution. This scheduling method can be preemptive or non-preemptive.
It significantly reduces the average waiting time for other processes awaiting execution. The full form of SJF is Shortest Job First

- This page demonstrates the Shortest Job First Non-Preemptive (SJF) scheduling algorithm using JavaScript.

- Do's and Dont's

• Do not enter special characters or symbols
• Enter required input specified
• Burst times must not be zero

---

Number of Processes:

Process Information

Name	Arrival Time	Burst Time

Schedule

---

Gantt Chart

Process	Start Time	End Time

---

Results Table

Process	Arrival Time	Burst Time	Completion Time	Turnaround Time	Waiting Time
Average Waiting Time:
Average Turnaround Time: