C Program for Shortest Job First (SJF) Scheduling Algorithm

By | August 4, 2014
Here you will get C program for shortest job first (sjf) scheduling algorithm.
In shortest job first scheduling algorithm, the processor selects the waiting process with the smallest execution time to execute next.

Below I have shared the C program for this algorithm.



C Program for Shortest Job First (SJF) Scheduling Algorithm

13 thoughts on “C Program for Shortest Job First (SJF) Scheduling Algorithm

  1. Mandy

    The last line of the output displays the execution time.
    Please provide a code for that.
    Revert asap.
    Thank you 🙂

  2. deepak

    Plz remove code from the text box.
    It’s very annoying and difficult to read from that.

    1. Puru Goyal

      Hi! What help you need with online saloon management system!
      Please contact

  3. Nur

    I need your help the coding of Identical Parallel Machine in Minimizing Makespan P||Cmax of Longest Processing Time (LPT), Shortest Processing Time (SPT) and First Come First Served (FCFS).

  4. kalyani

    what if the process arrives at different time ex
    process arrival time service time
    1 0 3
    2 2 3
    3 3 5
    4 4 2
    5 8 3

  5. Aayush Goyal

    This method does not mention the arrival time of the processes , which is the need of the hour! Please update the concept , otherwise it will be a loss for the whole coding fraternity!


Leave a Reply

Your email address will not be published. Required fields are marked *