Description: Implement multi-channel conversion scheduling
Problem: (combination of job scheduling and process scheduling)
The job stream information is read from the specified text file (TXT file)
Job information:
The operation number is entered into the system time estimate the running time priority memory demand for the tape machine is the whole type
Job scheduling algorithm: 1. Service first; 2. Minimum work priority
Process scheduling algorithm: 1. Service first; 2. Priority based algorithm (static priority) (two choices)
Output: job sequence
Format: operation time interval
1 800-810 (/ * 8:00-8:10 * /)
2. 810-900
1. 900-930
Average turnaround time: total turnaround time/total amount of work
The turnaround time is the end time of the job minus the job entry system time
To Search:
File list (Check if you may need any files):
Download