Optimal Priority Assignment with Heterogeneous Waiting Costs

Avraham Beja and Esther Sid
Additional contact information
Avraham Beja: Tel-Aviv University, Tel-Aviv, Israel
Esther Sid: Tel-Aviv University, Tel-Aviv, Israel

Operations Research, 1975, vol. 23, issue 1, 107-117

Abstract: For an M / G /1 queuing system, this paper assumes (l) that the discipline is administratively constrained to a “head-of-the-line” rule with n classes, and (2) that priorities are centrally assigned to customers according to their individual cost per unit time spent in the system, or their individual service-time requirements, or both (as the available information may be), but independently of the state of the queue. Then optimal priority-assignment rules for the various information structures are characterized. When n = 2, the higher priority may always be optimally assigned to all customers who are “no worse than average” and with sufficiently high load to “practically all” customers.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.1.107 (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:23:y:1975:i:1:p:107-117

Access Statistics for this article

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