The simple nonpre-emptive scheduling algorithm that schedules according to arrival times of processes is known as
O Longest Job First (LJF) '
O Longest Remaining Time First (LRTF) '
O Round Robin Shortest Remaining Time First (SRTF)
O First Come First Serve (FCFS)
O Shortest Job First (SJF)
