Technical Note—On Rothkopf and Smith's Statement Regarding Optimal Priority Assignment
Operations Research · 1989 · Volume 37 · Issue 3
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.
Keywords
queues, optimization: optimization in queueing systems, queues: nonstationary priority queues
Enable JavaScript for citation tools and additional paper interactions.