David D. Gamarnik


David D. Gamarnik

Support Staff

Get in Touch



Academic Groups

Academic Area

David Gamarnik is the Nanyang Technological University Professor of Operations Research at the MIT Sloan School of Management.

His research interests include applied probability and stochastic processes with application to queuing theory, theory of random combinatorial structures and algorithms, scheduling, and various business processes, including call centers, manufacturing, and communications networks.

Gamarnik has served as a research staff member at the Department of Mathematical Sciences, IBM Research, where he worked on various projects with industrial applications, including disaster recovery, performance in business processes, call centers, and operational resilience. Gamarnik is a member of the Institute of Mathematical Statistics, Bernoulli Society, INFORMS, and the American Mathematical Society, and serves on the editorial board of both Operations Research and the Annals of Applied Probability. He is the recipient of the 2004 Erlang Prize from the INFORMS Applied Probability Society, as well as two National Science Foundation grants in 2007.

Gamarnik holds a BA in mathematics from New York University and a PhD in operations research from MIT.


Gamarnik receives two honors


"Performance Analyis of Queueing Networks via Robust Optimization."

Bertsimas, Dimitris, David Gamarnik and Alexander Rikun. Operations Research Vol. 59, No. 2 (2011): 455-466. PDF.

"Basestock Policies in Supply Chain Networks: Robust vs. Stochastic Optimization."

Dimitris Bertsimas, David Gamarnik and Alexander Rikun. In Proceedings of MSOM 2010 Annual Conference and SIG Conference, edited by David Simchi-Levi. Haifa, Israel: June 2010.

"A Model for Understanding the Impacts of Demand and Capacity on Waitlists in a Congested Recovery Room."

Schoenmeyr, Tor I., Peter F. Dunn, David Gamarnik, Retsef Levi, David L. Berger, Bethany J. Daily, Wilton C. Levine, and Warren S. Sandberg. Anesthesiology Vol. 110, No. 6 (2009): 1293-1304.

"From Fluid Relaxations to Practical Algorithms for Job Shop Scheduling: The Holding Cost Objective."

Bertsimas, Dimitris, David Gamarnik and Jay Sethuraman. Operations Research Vol. 51, No. 5 (2002): 798-813.

"Performance Bounds for Multiclass Queueing Networks via Piecewise Linear Liapunov Functions."

Bertsimas, Dimitris, David Gamarnik and John N. Tsitsiklis. Annals of Applied Probability Vol. 11, No. 4 (2001): 1384-1428.

"Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing."

Bertsimas, Dimitris and David Gamarnik. Journal of Algorithms Vol. 33, No. 2 (1999): 296-318.

Load More