十大题型算法全实现——（八）作业调度[5]

current_minute=(jobs[i]need_time+current_minute)%;

total_time+=jobs[i]wait_time;

}

cout<

}

//运算时间短的作业优先算法

void shorter()

{

int i,j,p;

int current_hour;

int current_minute;

int current_need_time;

int total_time=0;

//输出作业流

cout<

cout<

cout<<"------------------------------------------------------------------------"<

cout.setf(2);

cout<

current_hour=jobs[quantity-1].reach_hour;

current_minute=jobs[quantity-1].reach_minite;

for(i=0;i

current_need_time=30000;

for(j=0;j

if((jobs[j].visited==0)&&(jobs[j].need_time

p=j;

current_need_time=jobs[j].need_time;

}

}

jobs[p].start_time=current_hour*100+current_minute;

[1] [2] [3] [4] [5] [6] [7] [8] [9]