A product form solution to a system with multi-type jobs and multi-type servers
Reads0
Chats0
TLDR
It is shown that there exist assignment probabilities under which the system has a product-form stationary distribution, and it is derived that waiting time distributions in steady state are derived.Abstract:
We consider a memoryless single station service system with servers $\mathcal{S}=\{m_{1},\ldots,m_{K}\}$ , and with job types $\mathcal{C}=\{a,b,\ldots\}$ . Service is skill-based, so that server m i can serve a subset of job types $\mathcal{C}(m_{i})$ . Waiting jobs are served on a first-come-first-served basis, while arriving jobs that find several idle servers are assigned to a feasible server randomly. We show that there exist assignment probabilities under which the system has a product-form stationary distribution, and obtain explicit expressions for it. We also derive waiting time distributions in steady state.read more
Citations
More filters
Proceedings ArticleDOI
Pricing in Ride-Sharing Platforms: A Queueing-Theoretic Approach
TL;DR: This work shows that profit under any dynamic pricing strategy cannot exceed profit under the optimal static pricing policy (i.e., one which is agnostic of stochastic fluctuations in the system load), and explains the apparent paradox.
Proceedings ArticleDOI
Reducing Latency via Redundant Requests: Exact Analysis
TL;DR: This paper presents the first exact analysis of systems with redundancy, and finds that, in many cases, redundancy outperforms JSQ and Opt-Split with respect to overall response time, making it an attractive solution.
Journal ArticleDOI
Pricing in Ride-Share Platforms: A Queueing-Theoretic Approach
TL;DR: A queueing-theoretic economic model is built that lets platforms realize the benefits of optimal static pricing, even with imperfect knowledge of system parameters, and shows that dynamic pricing is much more robust to fluctuations in system parameters compared to static pricing.
Journal ArticleDOI
Efficient Redundancy Techniques for Latency Reduction in Cloud Systems
TL;DR: In this article, the authors compared different redundancy strategies in terms of the number of redundant tasks and the time when they are issued and canceled, and designed a general redundancy strategy that achieves a good latency-cost trade-off for an arbitrary service time distribution.
Journal ArticleDOI
Exact FCFS Matching Rates for Two Infinite Multitype Sequences
Ivo Adan,Gideon Weiss +1 more
TL;DR: In this paper, a bipartite graph G of allowable matches between the types of items in the two sequences is considered and the matching rate rci, sj is defined as the long-term fraction of (ci,sj) matches in the infinite matching.
References
More filters
Book
Flows in networks
D. R. Ford,D. R. Fulkerson +1 more
TL;DR: Ford and Fulkerson as mentioned in this paper set the foundation for the study of network flow problems and developed powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Journal ArticleDOI
Flows in Networks.
TL;DR: The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Journal ArticleDOI
The Modern Call Center: A Multi-Disciplinary Perspective on Operations Management Research
TL;DR: A survey of the recent literature on call center operations management can be found in this article, where the authors identify a handful of broad themes for future investigation while also pointing out several very specific research opportunities.
Journal ArticleDOI
On the Stochastic Matrices Associated with Certain Queuing Processes
TL;DR: In this paper, general theorems for determining whether a queuing process is transient, recurrent-null or ergodic are presented. But the main purpose of the present paper is to illustrate the application of general theorem provers to this type of problem.
Related Papers (5)
Fcfs infinite bipartite matching of servers and customers
Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy
Steven L. Bell,Ruth J. Williams +1 more