Nam K. Kim

According to our database1, Nam K. Kim authored at least 12 papers between 2002 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Improving service in the presence of surge traffic: a K-policy voluntary flushing queueing system.
Ann. Oper. Res., 2020

2013
On the Discrete-Time Geo<sup>X</sup>/G/1 Queues under N-Policy with Single and Multiple Vacations.
J. Appl. Math., 2013

2010
On the Distribution of the Number of Customers in the D-BMAP/G<sup><i>a, b</i></sup>/1/<i>M</i> Queue - A Simple Approach to a Complex Problem.
INFOR Inf. Syst. Oper. Res., 2010

2008
The use of the distributional Little's law in the computational analysis of discrete-time GI/G/1 and GI/D/c queues.
Perform. Evaluation, 2008

2007
Remarks on the remaining service time upon reaching a target level in the M/G/1 queue.
Oper. Res. Lett., 2007

Analysis of the queue-length distribution for the discrete-time batch-service Geo.
Eur. J. Oper. Res., 2007

2005
A Two-Moment Approximation for the <i>GI/G/c</i> Queue with Finite Capacity.
INFORMS J. Comput., 2005

2004
An Invariance Relation and a Unified Method to Derive Stationary Queue-Length Distributions.
Oper. Res., 2004

2003
A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times.
Oper. Res. Lett., 2003

Erratum to "Transform-free analysis of the GI/G/1/K queue through the decomposed Little's formula" [Comput. Oper. Res. 30(3) 353-365].
Comput. Oper. Res., 2003

Transform-free analysis of the GI/G/1/K queue through the decomposed Little's formula.
Comput. Oper. Res., 2003

2002
On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals.
Oper. Res. Lett., 2002


  Loading...