A Characterization of Waiting Time Performance Realizable by Single-Server Queues
From MaRDI portal
Publication:3898315
DOI10.1287/opre.28.3.810zbMath0451.90059OpenAlexW2009617375MaRDI QIDQ3898315
Edward G. jun. Coffman, Isi 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
necessary and sufficient conditionexistence conditionssingle-server queuesMarkov queueing systemknown demandwaiting time performanceexistence of a scheduling strategyscheduling strategies design
Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items
Index-based policies for discounted multi-armed bandits on parallel machines., On bounds of response time performance achievable by multiclass single- server queues, A Polyhedral Approach to Online Bipartite Matching, 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 Relaxations for Online Bipartite Matching, Optimal Cost-Sharing in General Resource Selection Games, Decomposable Markov Decision Processes: A Fluid Optimization Approach, A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits, Dynamic priority allocation via restless bandit marginal productivity indices, Cooperation in Markovian queueing models, The use of relative priorities in optimizing the performance of a queueing system, Dual bounds of a service level assignment problem with applications to efficient pricing, A survey on discriminatory processor sharing, Coding and control for communication networks, Submodular function minimization, Pseudo conservation for partially fluid, partially lossy queueing systems, A polyhedral approach to online bipartite matching, Three methods to share joint costs or surplus, Running Errands in Time: Approximation Algorithms for Stochastic Orienteering, Dynamic node packing, Optimal pricing and scheduling control of product shipping, A game theoretic approach to a problem in polymatroid maximization
