Partial Flexibility in Routeing and Scheduling
From MaRDI portal
Publication:2856031
DOI10.1239/AAP/1377868534zbMath1273.90049OpenAlexW2081761153MaRDI QIDQ2856031
Rhonda Righter, Osman T. Akgun, Ronald W. Wolff
Publication date: 23 October 2013
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.aap/1377868534
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (3)
The cost of collaboration ⋮ Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview ⋮ A Survey of Stability Results for Redundancy Systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certain optimality properties of the first-come first-served discipline for G/G/s queues
- Optimality of the shortest line discipline with state-dependent service rates
- Approximation of multichannel queueing systems
- Optimality of routing and servicing in dependent parallel processing systems
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Join the shortest queue: Stability and exact asymptotics
- Sample path methods in the control of queues
- Heavy traffic resource pooling in parallel-server systems
- On the Gittins index in the M/G/1 queue
- Optimal Load Balancing on Distributed Homogeneous Unreliable Processors
- Upper bounds on work in system for multichannel queues
- Multiple-server system with flexible arrivals
- Modeling and analysis of flexible queueing systems
- Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
- On the Optimality of the Generalized Shortest Queue Policy
- THE N-NETWORK MODEL WITH UPGRADES
- A simple dynamic routing problem
- Optimality of the shortest line discipline
- A critical remark on a system approximation in queueing theory
- On the optimal assignment of customers to parallel servers
- An upper bound for multi-channel queues
- Optimality of the round-robin routing policy
- Optimal control of a flexible server
- ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS
- Minimizing response times and queue lengths in systems of parallel queues
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Inequalities: theory of majorization and its applications
This page was built for publication: Partial Flexibility in Routeing and Scheduling
