الگوریتم زمان‌بندی SJF در جاوا (Short Job First)

public class Process {
	int pid; // Process ID
	int bt; // Burst Time
	int art; // Arrival Time
	int completion_time;
	int waiting_time;
	int tat;//turn around time
	boolean is_finished = false;
	boolean addTowaiting = false;
	public Process(int pid, int bt, int art) {
		this.pid = pid;
		this.bt = bt;
		this.art = art;
	}
}

public class SJF {
	public static void main(String[] args) {
		ArrayList<Process> p = new ArrayList<>();
		p.add(new Process(1, 6, 1));
		p.add(new Process(2, 8, 1));
		p.add(new Process(3, 7, 2));
		p.add(new Process(4, 3, 3));
		SJF(p);
		CalWaitingTime(p);
		CalTurnAroundTime(p);
		display(p);
	}
	private static void CalTurnAroundTime(ArrayList<Process> p) {
		for (int i = 0; i < p.size(); i++) {
			p.get(i).tat = p.get(i).waiting_time + p.get(i).bt;
		}
	}
	public static void display(ArrayList<Process> p) {
		System.out.println
("Processes " + " Burst time " + " Waiting time " +
		" Turn around time" + " Completion Time " +" Arrival Time");
		for (int i = 0; i < p.size(); i++) {
			System.out.println
(" " + p.get(i).pid + "\t\t" +
		p.get(i).bt + "\t\t " + p.get(i).waiting_time + "\t\t "
					+ p.get(i).tat + "\t\t" + p.get(i).completion_time
					+ "\t\t" + p.get(i).art );
		}
	}
	public static void SJF(ArrayList<Process> AllProcess) {
		ArrayList<Process> waitingProcess = new ArrayList<>();
		int time = 0;
		int complete_process = 0;
		while (AllProcess.size() != complete_process) {
			CheckArrivalTime(AllProcess, waitingProcess, time);
			if (waitingProcess.size() <= 0) {
				time++;
				continue;
			}
			Sort(waitingProcess);
			Process shortestProcess = waitingProcess.get(0);
			time += shortestProcess.bt;
			shortestProcess.completion_time = time;
			shortestProcess.is_finished = true;
			waitingProcess.remove(0);
			complete_process++;
		}
	}
	public static void CalWaitingTime(ArrayList<Process> p) {
		for (int i = 0; i < p.size(); i++) {
			Process p1 = p.get(i);
			p1.waiting_time = p1.completion_time - p1.bt - p1.art;
			if (p1.waiting_time < 0) {
				p1.waiting_time = 0;
			}
		}
	}
	public static void Sort(ArrayList<Process> waitingProcess) {
		for (int i = 0; i < waitingProcess.size(); i++) {
			for (int j = 0; j < waitingProcess.size() - 1; j++) {
				Process p1 = waitingProcess.get(j);
				Process p2 = waitingProcess.get(j + 1);
				if (p2.bt < p1.bt) {
					Collections.swap(waitingProcess, j, j + 1);
				}
			}
		}
	}
	public static void CheckArrivalTime
(ArrayList<Process> Process,
			ArrayList<Process> waitingProcess, int time) {
		for (int i = 0; i < Process.size(); i++) {
			Process p = Process.get(i);
			if (p.art <= time && !p.addTowaiting) {
				p.addTowaiting = true;
				waitingProcess.add(p);
			}
		}
	}
}