Technical Note—On Rothkopf and Smith's Statement Regarding Optimal Priority Assignment

Eugene Veklerov
Additional contact information
Eugene Veklerov: Lawrence Berkeley Laboratory, Berkeley, California

Operations Research, 1989, vol. 37, issue 3, 498-500

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 (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.3.498 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:37:y:1989:i:3:p:498-500

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().