| |
Example 7.2
Consider there is one machine and four (4) jobs of the same type to be processed one after the other in the machine. Also consider the following information is available and remember all the jobs are there standing in the queue, so how would you process the jobs?
Job |
Servicing time |
A |
6 |
B |
5 |
C |
7 |
D |
4 |
Solution 7.2
In case when the assignment is simple we have the sequence as D-B-A-C, which would minimine the average waiting of the jobs. Please note that in case there are priorities/priority, then one should assign the weights pertaining to the deadline of each job.
Exponential Distribution
We denote the random variable X as Exponential, if,  , i.e.,  , considering  . It is a memory loss distribution, i.e.,
|
