IMPLEMENTATION - LONGEST JOB FIRST (LJF)

Concept

STEP 1 :

First, sort the processes in decreasing order of their Burst Time.

STEP 2 :

Choose the process having highest Burst Time among all the processes that have arrived till that time. Then process it for its burst time. Check if any other process arrives until this process completes execution.

STEP 3 :

Repeat the above both steps until all the processes are executed.

Invalid Input

PLAY

RESET

Average TAT : 0

Average WT : 0

Average RT : 0

Arrival Time :

Burst Time :

ADD

PID	AT	BT	ST	CT	RT	WT	TAT