| Article ID: | iaor1989346 |
| Country: | United States |
| Volume: | 37 |
| Issue: | 3 |
| Start Page Number: | 498 |
| End Page Number: | 502 |
| Publication Date: | May 1989 |
| Journal: | Operations Research |
| Authors: | Veklerov Eugene |
A limitation is established to the equivalence of solutions to problems of sequencing a finite number of jobs, and assigning priorities in a queue. It is shown that for exponential delay costs, the optimal priority assignment in a nonpreemptive multiclass queue is not described by an index rule that is independent of the arrival rates.