Description: first come first served
The first operation into the input shaft of the first execution, then the operation will have an executive at the end of time, then the running time of the operation, to meet the conditions of time homework enter wells, then according to the operation before the end of a run time calculation and the next job to enter the input shaft of the estimated time of operation the next time a running time:
Time = max (curendtime, nextstarttime); then the start time of the post operation is calculated,
Then, a running length is the end time of the job, and the turnaround time is the end time minus the time to enter the input well
To Search:
File list (Check if you may need any files):
算法调度实验
算法调度实验\bin
算法调度实验\bin\Debug
算法调度实验\bin\Debug\算法调度实验.exe
算法调度实验\main.cpp
算法调度实验\main.exe
算法调度实验\main.o
算法调度实验\obj
算法调度实验\obj\Debug
算法调度实验\obj\Debug\main.o
算法调度实验\算法调度实验.cbp
算法调度实验\算法调度实验.depend
算法调度实验\算法调度实验.layout
Download