activity
20042022
most citedScheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic

149 citations · 178 across the 6 of their papers we have counts for

collaborators

6 papers

math.OC2022

Asymptotic optimality of switched control policies in a simple parallel server system under an extended heavy traffic condition

Rami Atar, Eyal Castiel, Marty Reiman

This paper studies a 2-class, 2-server parallel server system under the recently introduced extended heavy traffic condition, which states that the underlying 'static allocation' l…

math.OC2022

Parallel server systems under an extended heavy traffic condition: A lower bound

Rami Atar, Eyal Castiel, Martin I. Reiman

The standard setting for studying parallel server systems (PSS) at the diffusion scale is based on the heavy traffic condition (HTC), which assumes that the underlying static alloc…

math.PR2020

Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities

Jose H. Blanchet, Martin I. Reiman, Viragh Shah +2

We consider a matching market where buyers and sellers arrive according to independent Poisson processes at the same rate and independently abandon the market if not matched after…

math.OC2018

Asymptotically Optimal Inventory Control for Assemble-to-Order Systems

Martin I. Reiman, Haohua Wan, Qiong Wang

We consider Assemble-to-Order (ATO) inventory systems with a general Bill of Materials and general deterministic lead times. Unsatisfied demands are always backlogged. We apply a f…

math.PR2008★ 29 cited

The heavy traffic limit of an unbalanced generalized processor sharing model

Kavita Ramanan, Martin I. Reiman

This work considers a server that processes classes using the generalized processor sharing discipline with base weight vector and redistribution weight vecto…

math.PR2004★ 149 cited

Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic

Rami Atar, Avi Mandelbaum, Martin I. Reiman

We consider the problem of scheduling a queueing system in which many statistically identical servers cater to several classes of impatient customers. Service times and impatience…