default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKyung C. Chae
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j20]Sung-Jin Kim, Nam K. Kim, Hyunmin Park, Kyung Chul Chae, Dae-Eun Lim:
On the Discrete-Time GeoX/G/1 Queues under N-Policy with Single and Multiple Vacations. J. Appl. Math. 2013: 587163:1-587163:6 (2013)- 2010
- [j19]Kilhwan Kim
, Kyung C. Chae:
Discrete-time queues with discretionary priorities. Eur. J. Oper. Res. 200(2): 473-485 (2010) - [j18]Hyunmin Park, Tae-Sung Kim, Kyung C. Chae:
Analysis of a two-phase queueing system with a fixed-size batch policy. Eur. J. Oper. Res. 206(1): 118-122 (2010)
2000 – 2009
- 2009
- [j17]Won Seok Yang, Dae Eun Lim, Kyung C. Chae:
Maintenance of deteriorating single server queues with random shocks. Comput. Ind. Eng. 57(4): 1404-1406 (2009) - [j16]Kyung C. Chae, Dae Eun Lim, Won Seok Yang:
The GI/M/1 queue and the GI/Geo/1 queue both with single working vacation. Perform. Evaluation 66(7): 356-367 (2009) - 2007
- [j15]Xeung W. Yi, Nam K. Kim, Bong K. Yoon, Kyung C. Chae:
Analysis of the queue-length distribution for the discrete-time batch-service Geo. Eur. J. Oper. Res. 181(2): 787-792 (2007) - [j14]Kyung C. Chae, Sung J. Kim:
Busy period analysis for the GI/M/1 queue with exponential vacations. Oper. Res. Lett. 35(1): 114-118 (2007) - [j13]Kyung C. Chae, Kilhwan Kim, Nam K. Kim:
Remarks on the remaining service time upon reaching a target level in the M/G/1 queue. Oper. Res. Lett. 35(3): 308-310 (2007) - 2006
- [j12]Kyung C. Chae, Sangmin Lee, Ho Woo Lee:
On stochastic decomposition in the GI/M/1 queue with single exponential vacation. Oper. Res. Lett. 34(6): 706-712 (2006) - 2005
- [j11]Dae W. Choi, Nam K. Kim, Kyung C. Chae:
A Two-Moment Approximation for the GI/G/c Queue with Finite Capacity. INFORMS J. Comput. 17(1): 75-81 (2005) - 2004
- [j10]Nam K. Kim, Kyung C. Chae, Mohan L. Chaudhry:
An Invariance Relation and a Unified Method to Derive Stationary Queue-Length Distributions. Oper. Res. 52(5): 756-764 (2004) - [j9]Ho Woo Lee, Sahng Hoon Cheon, Eui Yong Lee, Kyung C. Chae:
Workload and Waiting Time Analyses of MAP/G/1 Queue under D-policy. Queueing Syst. Theory Appl. 48(3-4): 421-443 (2004) - 2003
- [j8]Nam K. Kim, Kyung C. Chae:
Transform-free analysis of the GI/G/1/K queue through the decomposed Little's formula. Comput. Oper. Res. 30(3): 353-365 (2003) - [j7]Nam K. Kim, Kyung C. Chae:
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. 30(14): 2227 (2003) - 2002
- [j6]Nam K. Kim, Seok Ho Chang, Kyung C. Chae:
On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals. Oper. Res. Lett. 30(1): 25-32 (2002) - [j5]Mohan L. Chaudhry, Bong K. Yoon, Kyung C. Chae:
Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system. Oper. Res. Lett. 30(3): 174-180 (2002) - 2001
- [j4]Kyung C. Chae, Ho Woo Lee, C. W. Ahn:
An Arrival Time Approach to M/G/1-type Queues with Generalized Vacations. Queueing Syst. Theory Appl. 38(1): 91-100 (2001)
1990 – 1999
- 1995
- [j3]Soon Seok Lee, Ho Woo Lee, Seung Hyun Yoon, Kyung C. Chae:
Batch arrival queue with N-policy and single vacation. Comput. Oper. Res. 22(2): 173-189 (1995) - 1994
- [j2]Kyung C. Chae, Tae-Sung Kim:
Reversed absorbing Markov chain: A simple path approach. Oper. Res. Lett. 16(1): 41-46 (1994) - [j1]Ho Woo Lee, Soon Seok Lee, Kyung C. Chae:
Operating characteristics of MX/G/1 queue with N-policy. Queueing Syst. Theory Appl. 15(1-4): 387-399 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
