先来先服务算法与短作业优先

1、package a3;public class fcfs int finishtime;int arivetime;int starttime;int zhouzhuan;float weightzhouzhuan;public void fun()int a=4,3,5,2,4;int d=0,1,2,3,4,;for(int i=0;i5;i+)arivetime=di;starttime=finishtime;finishtime+=ai;zhouzhuan=finishtime-arivetime;weightzhouzhuan=(float)zhouzhuan/ai;system.o

2、ut.println(到达时间：+arivetime+ +开始时间：+starttime+ +服务时间：+ai+ +完成时间：+finishtime+ +周转时间：+zhouzhuan+ +带全周转时间：+weightzhouzhuan);package a3;import java.util.arrays;public class sjf int starttime;int arivetime;int zhouzhuan;int finishtime;int a=4,3,5,2,4;public int fun()int b=new int5;for(int i=1;i5;i+)bi-1=a

3、i;arrays.sort(b);system.out.println();return b;public void fun1()int c=new int5;c=this.fun();finishtime=a0;int d=0,3,1,4,2;int zhouzhuan= finishtime-arivetime;float weightzhouzhuan=(float)zhouzhuan/a0;system.out.println(到达时间：+ arivetime+ +开始时间：+starttime+ +服务时间：+a0+ +完成时间：+finishtime+ +周转时间：+zhouzhu

4、an+ +带全周转时间：+weightzhouzhuan);for(int k=1;k5;k+)starttime=finishtime;arivetime=dk;finishtime+=ck;zhouzhuan=finishtime-arivetime;weightzhouzhuan=(float)zhouzhuan/ck;system.out.println(到达时间：+ arivetime+ +开始时间：+starttime+ +服务时间：+ck+ +完成时间：+finishtime+ +周转时间：+zhouzhuan+ +带全周转时间：+weightzhouzhuan);package

5、 a3;import java.util.scanner;public class test public static void main(string args) /int d=0,1,2,3,4,;/system.out.println(*);/system.out.println(请显示各进程到达时间:);/for(int i=0;i5;i+)/system.out.print(di+ );/system.out.println();system.out.println(*);system.out.println(请选择调度算法(0-1)：);system.out.println(0.先来先服务调度:);system.out.println(1.短进程优先调度:);system.out.println(*);scanner scanner=new scanner(system.in);int i=scanner.nextint();switch(i)case 0:system.out.println(*);system.out.println(对作业先来先服务调度:);system.out.println(*);fcfs fs=new fcfs();fs.fun();break;case 1:system.out.pr