Relative priority policies for minimizing the cost of queueing systems with service discrimination
type: Item
instance of: scholarly article
title: Relative priority policies for minimizing the cost of queueing systems with service discrimination
zbMATH Open document ID: 1205.90093
author: Wei Sun
author: Pengfei Guo
author: Nai-Shuo Tian
author: Shiyong Li
published in: Applied Mathematical Modelling
publication date: 2010-04-24T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K30
zbMATH DE Number: 5701206
zbMATH Keywords: queueing system
zbMATH Keywords: relative priority
zbMATH Keywords: cost function
zbMATH Keywords: service discrimination
zbMATH Keywords: nonlinear constraint optimization
zbMATH Keywords: Lagrangian multiplier method
MaRDI profile type: Publication
full work available at URL: j.apm.2009.03.012
OpenAlex ID: W2068822053
cites work: The use of relative priorities in optimizing the performance of a queueing system
cites work: Purchasing Priorities in Queues
cites work: Priority Pricing
cites work: Optimal Priority-Purchasing and Pricing Decisions in Nonmonopoly and Monopoly Queues
cites work: Stable and superstable customer policies in queues with balking and priority options
cites work: Q4134686
cites work: Q3944001
cites work: Queue systems with balking : a stochastic model of price discrimination
cites work: Characterization and Optimization of Achievable Performance in General Queueing Systems
cites work: Extensions to Class Dominance Characteristics
cites work: Decentralized Regulation of a Queue
cites work: Equilibrium Threshold Strategies: The Case of Queues with Priorities
cites work: Simple sequencing problems with interdependent costs
cites work: Priority Auctions and Queue Disciplines That Depend on Processing Time
cites work: To queue or not to queue: equilibrium behavior in queueing systems.
cites work: Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure
cites work: How pre-emptive priority affects completion rate in an M/M/1 queue with Poisson reneging
cites work: Sharing a Processor Among Many Job Classes
cites work: Waiting times in queues with relative priorities
cites work: Mean sojourn times for phase-type discriminatory processor sharing systems
cites work: Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities
cites work: Q4585624
cites work: Q4847214
cites work: Q4209222
DOI: 10.1016/J.APM.2009.03.012
description: scientific article; zbMATH DE number 5701206