On optimal right-of-way policies at a single-server station when insertion of idle times is permitted

Isaac Meilijson and Uri Yechiali

Stochastic Processes and their Applications, 1977, vol. 6, issue 1, 25-32

Abstract: A general stream of n types of customers arrives at a Single Server station where service is non-preemptive, the server may undergo Poisson breakdowns and insertion of idle times is allowed. If [xi](k) and c(k) are, respectively, the expected service time and sojourn cost per unit time of a type k customer (1[less-than-or-equals, slant]k[less-than-or-equals, slant]n), call k "V.I.P." type if [xi](k)/c(k) = min1[less-than-or-equals, slant]i[less-than-or-equals, slant]n[[xi](i)/sbc(i)]. We show that any right-of-way service policy can be improved by a policy that grants V.I.P. customers priority over all others, and never inserts idle time when a V.I.P. customer is present. We further show that if the arrival stream is Poisson, the so-called "c[mu]" priority rule (applied with no delays) is optimal in the class of all service policies, and not just among those of a priority nature.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(77)90014-X
Full text for ScienceDirect subscribers only

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:eee:spapps:v:6:y:1977:i:1:p:25-32

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().