Question: A computer server currently has a queue of 5 jobs, sequenced from A to E. A is the one that has been waiting the longest
A computer server currently has a queue of 5 jobs, sequenced from A to E. A is the one that has been waiting the longest and E is the one that was most recently received. The following table provides their processing times in milliseconds.
| A | B | C | D | E | ||||
| Time (milliseconds) | 5 | 78 | 50 | 2 | 15 | |||
Suppose the server is designed to minimize the average waiting time across jobs (i.e., time in the queue waiting to start processing). Ignore the amount of time these jobs have already been waiting. Suppose the server is immediately available to start working on one of the jobs and the server is aware of each jobs processing time. What is the minimum total time these five jobs will wait before beginning processing? (Note: Additional jobs may or may not arrive before the processing of these jobs is completed. For example, if A is processed first and B next, then As wait will be 0 and Bs wait will be 5 (the time to complete A) so the total time for these two jobs alone is 0 + 5 = 5.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
