Java如何实现作业调度
作者:暮色微凉
时间:2023-04-29
来源:互联网
浏览:0
Java实现作业调度要求Java实现SJF算法调度,要求测试数据可以随即输入或从文件中读入;必须要考虑到作业的到达时间;最终能够计算每一个作业的周转时间、带权周转时间,给代码加中文注释参考代码importjava.util.ArrayList;importjava.util.Comparator;importjava.util.List;importjava.util.Random;publicclasstest{staticclassJob{publicintjobId;publicintarriveT
Java实现作业调度
要求
Java实现SJF算法调度,要求测试数据可以随即输入或从文件中读入;
必须要考虑到作业的到达时间;
最终能够计算每一个作业的周转时间、带权周转时间,给代码加中文注释
参考代码
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.Random;
public class test {
static class Job {
public int jobId;
public int arriveTime;
public int needTime;
public int finishTime;
public int turnover;
public double weightTurnover;
public Job(int jobId, int arriveTime, int needTime) {
this.jobId = jobId;
this.arriveTime = arriveTime;
this.needTime = needTime;
}
}
public static void main(String[] args) {
List jobList = new ArrayList<>();
Random random = new Random();
int jobSize = 5;
int rangeArriveTime = 5;
int rangeNeedTime = 10;
for (int i = 0; i < jobSize; i++) {
Job job = new Job(i, random.nextInt(rangeArriveTime), random.nextInt(rangeNeedTime) + 1);
jobList.add(job);
}
jobList.sort(Comparator.comparingInt(o -> o.arriveTime));
int currentTime = 0;
int totalTurnover = 0;
double totalWeightTurnover = 0;
int completeJobNum = 0;
while (completeJobNum < jobList.size()) {
int shortestNeedTime = Integer.MAX_VALUE;
Job shortestNeedJob = null;
for (Job job : jobList) {
if (job.finishTime > 0) {
continue;
}
if (job.arriveTime <= currentTime && job.needTime < shortestNeedTime) {
shortestNeedTime = job.needTime;
shortestNeedJob = job;
}
}
currentTime += shortestNeedJob.needTime;
shortestNeedJob.finishTime = currentTime;
shortestNeedJob.turnover = shortestNeedJob.finishTime - shortestNeedJob.arriveTime;
shortestNeedJob.weightTurnover = (double) shortestNeedJob.turnover / shortestNeedJob.needTime;
totalTurnover += shortestNeedJob.turnover;
totalWeightTurnover += shortestNeedJob.weightTurnover;
completeJobNum++;
}
for (Job job : jobList) {
System.out.println("作业" + job.jobId + "的周转时间为" + job.turnover + ",带权周转时间为" + job.weightTurnover);
}
System.out.println("平均周转时间为" + (double) totalTurnover / jobList.size());
System.out.println("带权平均周转时间为" + totalWeightTurnover / jobList.size());
}
} 运行效果

作者最新文章
白描 PDF
2026-09-16 17:44
密码键盘
2026-09-16 17:43
3dmax快捷键失效了怎么办
2026-09-16 13:53
Xiaomi 18 Fold首销数据解读:较上代大折叠增长310%的原因与配置分析
2026-09-08 16:55
PDF文件太大怎么压缩?在线减小体积的操作步骤
2026-09-03 11:12
热门文章
更多
精品专题
更多
Mac软件
更多
WINDOWS
更多
Windows 10
Windows
Windows 10 是一款微软推出的经典操作系统,拥有硬件兼容性与多任务处理能力。它更偏向把系统状态查看和常用调节动作放在一起,适合需要持续观察和微调设备状态的场景。
极度公式
Windows/macOS/Linux
极度公式是一款跨平台专业LaTeX公式识别编辑软件,支持OCR公式识别和多平台编辑。和使用说明,避免使用,享受完整功能与稳定支持。做扫描整理、文字提取和表格转换时,它能把识别后的处理步骤接得更顺,资料录入这类场景会省下不少时间。
















