Algorithm 1. Priority assignment algorithm.
| Priority(, ) |
| if ≤ then |
| return (H) |
| else if T1 < ≤ T2 then |
| if SBCAT = 1 then |
| return (H) |
| else if SBCAT = 2 then |
| return (M) |
| else if SBCAT = 3 then |
| return (L) |
| else if > T2 then |
| if SBCAT = 1 then |
| if QH is not full then |
| return (H) |
| else |
| return (M) |
| else if SBCAT = 2 then |
| if QM is not full then |
| return (M) |
| else |
| return (L) |
| else if SBCAT = 3 then |
| return (L) |