Queueing Systems: Theory and Applications

Motivated by a service platform, we study a two-sided network where heterogeneous demand (customers) and heterogeneous supply (workers) arrive randomly over time to get matched. Customers and workers arrive with a randomly sampled patience time (...

This paper examines the performance of multi-class, multi-server bipartite queueing systems, where each arriving customer is compatible with only a subset of servers. We focus on the system’s performance under a first-come, first-served-assign ...

We consider multi-component matching systems in heavy traffic consisting of $K\ge 2$ distinct perishable components which arrive randomly over time at high speed at the assemble-to-order station, and they wait in their respective queues according to ...$$

We characterize the impact of scheduling policies on the mean response time in nested systems with cancel-on-complete redundancy. We consider not only class- and state-oblivious policies such as FCFS and ROS, but also class-based, and, in ...${\mathrm{}}_{\mathrm{}}{\mathrm{}}_{\mathrm{}}$${\mathrm{}}_{\mathrm{}}$${\mathrm{}}_{\mathrm{}}$