Optimality of routing and servicing in dependent parallel processing systems
From MaRDI portal
Publication:1177919
DOI10.1007/BF01159224zbMath0748.90077MaRDI QIDQ1177919
Ronald Menich, Richard F. Serfozo
Publication date: 26 June 1992
Published in: Queueing Systems (Search for Journal in Brave)
Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items
Dynamic routing to heterogeneous collections of unreliable servers, The shorter queue polling model, Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing, Optimal control of multiclass parallel service systems, Self-Learning Threshold-Based Load Balancing, Sample path methods in the control of queues, Understanding the marginal impact of customer flexibility, Scalable Load Balancing in Networked Systems: A Survey of Recent Advances, A conservative index heuristic for routing problems with multiple heterogeneous service facilities, An Overview for Markov Decision Processes in Queues and Networks, Dynamic resource allocation in a multi-product make-to-stock production system, A survey of Markov decision models for control of networks of queues, Optimal Allocation of Machines to Distinguishable Repairmen in Order to Maximize Some Reward Functions, Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems, Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems, DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM, Multiple-server system with flexible arrivals, Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs, On the Shortest Queue Policy for the Tandem Parallel Queue, On the Assignment of Customers to Parallel Queues, Partial Flexibility in Routeing and Scheduling, A polling system with `join the shortest -- serve the longest' policy, Signaling for decentralized routing in a queueing network
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-queue, one-server model with priority for the longer queue
- Boundary value problems in queueing theory
- A queueing model of a production system with two machines, one operator and priorities
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
- The autostrada queueing problem
- On the Optimality of the Generalized Shortest Queue Policy
- J.comput. appl. math
- The shortest queue problem
- Stochastic Orderings for Markov Processes on Partially Ordered Spaces
- Deciding Which Queue to Join: Some Counterexamples
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- A Priority Queue with Discounted Linear Costs
- Dynamic Scheduling of a Multiclass Queue: Discount Optimality
- Optimality of the shortest line discipline
- Optimal Control of Single-Server Queuing Networks and Multi-Class M/G/1 Queues with Feedback
- On the optimal assignment of customers to parallel servers
- Dynamic Scheduling of a Two-Class Queue: Small Interest Rates
- A Queueing Model to Analyze the Value of Centralized Inventory Information
- Functions of Semi-Markov Processes
