A Characterization of Waiting Time Performance Realizable by Single-Server Queues

DOI10.1287/OPRE.28.3.810MaRDI QIDQ3898315zbMATH OpenOpenAlexFDO

Authors E. G. jun. Coffman, I. Mitrani

Publication date 1980

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.28.3.810

zbMATH Keywords

existence conditionsexistence of a scheduling strategyknown demandMarkov queueing systemnecessary and sufficient conditionscheduling strategies designsingle-server queueswaiting time performance

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queues and service in operations research (90B22)

Cited in

(26)

• On bounds of response time performance achievable by multiclass single- server queues
• Dual bounds of a service level assignment problem with applications to efficient pricing
• A polyhedral approach to online bipartite matching
• Three methods to share joint costs or surplus
• Index-based policies for discounted multi-armed bandits on parallel machines.
• The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
• Computational geometric approach to submodular function minimization for multiclass queueing systems
• Dynamic node packing
• A game theoretic approach to a problem in polymatroid maximization
• Coding and control for communication networks
• Pseudo conservation for partially fluid, partially lossy queueing systems
• Cooperation in Markovian queueing models
• A survey on discriminatory processor sharing
• Optimal cost-sharing in general resource selection games
• Decomposable Markov decision processes: A fluid optimization approach
• A Polyhedral Approach to Online Bipartite Matching
• Dynamic Relaxations for Online Bipartite Matching
• A verification theorem for threshold-indexability of real-state discounted restless bandits
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
• Optimal pricing and scheduling control of product shipping
• When does partial priority improve revenue?
• Balancing of the C-mu rule by intermediate priorities
• Coordinated referral and scheduling decisions for specialized healthcare services
• Dynamic priority allocation via restless bandit marginal productivity indices
• The use of relative priorities in optimizing the performance of a queueing system
• Submodular function minimization

This page was built for publication: A Characterization of Waiting Time Performance Realizable by Single-Server Queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898315)