Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
