SJF (Shortest -Job-First) Scheduling

• Associate with each process the length of its next CPU burst.Use these lengths to schedule the process with the shortest.
• SJF is optimal - gives minimum average waiting time for a given set of processes

    -- The difficulty is knowing the length of the next CPU request.

      Criteria :- Burst Time

            Mode:-Non-Preemptive 
                        Pre-emptive