Stable priority purchasing in queues

DOI10.1016/0167-6377(86)90030-1zbMath0603.60088OpenAlexW2064319038MaRDI QIDQ1082722

Refael Hassin, Amihai Glazer

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90030-1

zbMATH Keywords

priority queuespriority purchasing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (16)

Non zero-sum stochastic games in admission, service and routing control in queueing systems ⋮ A rescheduling and cost allocation mechanism for delayed arrivals ⋮ Charging more for priority via two-part Tariff for accumulating priorities ⋮ Zero-sum Markov games and worst-case optimal control of queueing systems ⋮ An optimal mechanism charging for priority in a queue ⋮ The disadvantage of the Cμ‐rule when customers are strategic ⋮ The effect of customer awareness on priority queues ⋮ The impact of line-sitting on a two-server queueing system ⋮ STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES ⋮ When Fixed Price Meets Priority Auctions: Competing Firms with Different Pricing and Service Rules ⋮ On threshold routing in a service system with highest-bidder-first and FIFO services ⋮ Strategic bidding in an accumulating priority queue: equilibrium analysis ⋮ Strategic arrivals to queues offering priority service ⋮ Strategic bidding in a discrete accumulating priority queue ⋮ Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities ⋮ Stable strategies for processor sharing systems

Cites Work

• Priority Pricing
• Stable pricing policies in service systems
• Optimum Bribing for Queue Position
• Purchasing Priorities in Queues

This page was built for publication: Stable priority purchasing in queues