操作系统-（短作业优先算法）

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


//Wait——等待(堵塞),Run——运行,Finish——完成
public class 短作业优先算法 {
	public static Job ans[];
	public static int time,num;
	public static List<Job> list;
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		System.out.println("请输入有多少个作业：");
		num = input.nextInt();
		ans =new Job[num];
		System.out.println("请依次输入"+num+"个作业的作业名、到达时间、服务时间");
		for (int i = 0; i <num; i++) {
			String name = input.next();
			int arriveTime = input.nextInt();
			int serviceTime = input.nextInt();
			time+=serviceTime;
			char state = 'W';
			Job job = new Job(name, arriveTime, serviceTime, state);
			ans[i] = job;
		}
		input.close();
		sort(ans);
		list = new ArrayList<>();
		for (int i = 0; i < time; i++) {
			double revolveTime =0;
			double weightRevolveTime = 0;
			Job temp =Priority(i);
			if (temp.arriveTime!=-1) {//如果说当前返回的值并不是等于-1说明是存在的
				//i = i+temp;
				temp.state = 'F';//状态变化
				revolveTime = (i+temp.serviceTime-temp.arriveTime);
				weightRevolveTime = (Math.round(revolveTime/temp.serviceTime*100.0))/100.0;
				System.out.println("作业"+(temp.name)+"从第"+(i)+"个时间单位开始执行，执行到第"+(i+temp.serviceTime)+"个时间单位，状态从W转变成R再转变成"+(temp.state)
						+",周转时间为"+revolveTime+",带权周转时间为"+weightRevolveTime);
				i=i+temp.serviceTime-1;
				int count = getname(temp.name);
				if (count != -1) {
					ans[count].name = "NUll";
					ans[count].arriveTime = -1;
					ans[count].serviceTime = -1;
					ans[count].state = temp.state;
					
				}else {
					//如果等于-1的时候说明里面已经没有需要的值了
					break;
				}
			}
		}
	}
	public static int getname(String string) {
		for (int i = 0; i < ans.length; i++) {
			if (ans[i].name.equals(string)) {
				return i;
			}
		}
		return -1;
	}
	
	public static Job Priority(int start){
		List<Job> tempJob = new ArrayList<>();
		for (int i = 0; i < num; i++) {//传递进入一个时间，返回在此时间内执行时间最短的作业的对象
			if (ans[i].arriveTime <= start && ans[i].arriveTime!=-1 ) {
				String cat = ans[i].name;
				tempJob.add(ans[i]);
			}
		}//将小于这个值的所有Job都加入到list中
		if (tempJob.isEmpty()) {
			return new Job("NULL", -1, -1, 'a');
		}
		int min = 10000;
		Job job = new Job("NUll", -1, -1, 'a') ;
		for (int i = 0; i < tempJob.size(); i++) {
			if(tempJob.get(i).serviceTime < min) {
				job = tempJob.get(i);
				min = tempJob.get(i).serviceTime;
			}
		}//返回最短的时间
		return job;
	}

	public static void sort(Job ans[]) {//对进入的所有作业根据到达时间进行排序
		for(int i =0 ; i<ans.length-1 ; i++) { 
			for(int j=0 ; j<ans.length-1-i ; j++) {  
				if(ans[j].arriveTime>ans[j+1].arriveTime) {
					Job temporacy = ans[j];
					ans[j]=ans[j+1];      
					ans[j+1]=temporacy;
				}
			}    
		}
//		for (int i = 0; i < ans.length; i++) {
//			System.out.println(ans[i].name+" "+ans[i].arriveTime+" "+ans[i].serviceTime);
//		}
	}
}
class Job{
	/*
	 * name 表示作业名
	 * arriveTime表示进入时间
	 * serviceTime表示服务时间
	 * state 表示该作业当时所处的状态
	 */
	String name;
	int arriveTime;
	int serviceTime;
	char state;
	public Job(String name,int arriveTime,int serviceTime,char state) {
		super();
		this.name = name;
		this.arriveTime= arriveTime;
		this.serviceTime=serviceTime;
		this.state=state;
	}
}