Ho Woo Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ho Woo Lee has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Se Won Lee
Sungkyunkwan University
12 shared publications - Jung Woo Baek
Department of Industrial & Systems Engineering, Dongguk University, Seoul 04620, Republic of Korea
9 shared publications - Soohan Ahn
Department of Statistics, The University of Seoul, Seoul, South Korea
5 shared publications Sahng Hoon Cheon
U-Biz Team, Dongbu CNI , Seoul, Korea
4 shared publicationsWon Joo Seo
Consulting Division, Hyundai Information Technology , Seoul, Korea
2 shared publicationsByoung-Hoon Lee
1 shared publication
Latest Publications
- 1 June 2020
- Published by Springer Nature in Journal of the Korean Statistical Society
- Vol. 49 (2) , 395-421
Markov-modulated fluid flow model with server maintenance period
- 1 June 2020
- Published by Springer Nature in Journal of the Korean Statistical Society
- Vol. 49 (2) , 395-421
Markov-modulated fluid flow model with server maintenance period
- 1 September 2018
- Published by Elsevier in Performance Evaluation
- Vol. 125, 68-79
Continuous-type-inventory model with an attached M/M/1 queue and lost sales- 1 September 2018
- Published by Elsevier in Performance Evaluation
- Vol. 125, 68-79
Continuous-type-inventory model with an attached M/M/1 queue and lost sales- 28 October 2012
- Published by Springer Nature
- p. 1-24
Factorization Properties for a MAP-Modulated Fluid Flow Model Under Server Vacation Policies
- 28 October 2012
- Published by Springer Nature
- p. 1-24
Factorization Properties for a MAP-Modulated Fluid Flow Model Under Server Vacation Policies
- 7 March 2012
- Published by Springer Nature in Annals of Operations Research
- Vol. 202 (1) , 19-34
A MAP-modulated fluid flow model with multiple vacations
- 7 March 2012
- Published by Springer Nature in Annals of Operations Research
- Vol. 202 (1) , 19-34
A MAP-modulated fluid flow model with multiple vacations
- Open Access
- 1 January 2012
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 8 (4) , 969-986
Stochastic method for power-aware checkpoint intervals in wireless environments: Theory and application
- 1 January 2012
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 8 (4) , 969-986
Open AccessStochastic method for power-aware checkpoint intervals in wireless environments: Theory and application
- 3 November 2011
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 18 (6) , 993-1010
A Markov‐modulated fluid flow queueing model under D‐policy
SUMMARY: We consider a Markov‐modulated fluid flow queueing model under D‐policy. As soon as the fluid level reaches zero, the server becomes idle. During the idle period, fluid arrives from outside according to an underlying continuous time Markov chain (UMC) and the idle server does not process the fluid. We consider two increase patterns of fluid during the idle period: vertical increase (Type‐V) and linear increase (Type‐L). The idle server is reactivated only when the cumulative fluid level in the system exceeds a predetermined threshold value D. We derive the distributions of fluid level and mean performance measures for both types. We also present cost optimization model to minimize average operating cost per unit time. Copyright © 2011 John Wiley & Sons, Ltd.
- 3 November 2011
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 18 (6) , 993-1010
A Markov‐modulated fluid flow queueing model under D‐policy
SUMMARY: We consider a Markov‐modulated fluid flow queueing model under D‐policy. As soon as the fluid level reaches zero, the server becomes idle. During the idle period, fluid arrives from outside according to an underlying continuous time Markov chain (UMC) and the idle server does not process the fluid. We consider two increase patterns of fluid during the idle period: vertical increase (Type‐V) and linear increase (Type‐L). The idle server is reactivated only when the cumulative fluid level in the system exceeds a predetermined threshold value D. We derive the distributions of fluid level and mean performance measures for both types. We also present cost optimization model to minimize average operating cost per unit time. Copyright © 2011 John Wiley & Sons, Ltd.
- 18 February 2010
- Published by Taylor & Francis in Stochastic Models
- Vol. 26 (1) , 98-123
Analysis of the MAP/G/1 Queue Under the Min(N,D)-Policy
In this paper, we consider the queueing system under the MAP (Markovian Arrival process) arrivals and the Min(N, D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service time of the waiting customers exceeds D, whichever occurs first (Min(N, D)-policy). We analyze the queue length, workload, and waiting time. Then, we present numerical examples in which our analytical results are compared with the simulation estimates for verification purposes. We also compare our system with the M/G/1 queue under the same parameter setting and show that a naive Poisson assumption may severely underestimate the mean performance measures.
- 18 February 2010
- Published by Taylor & Francis in Stochastic Models
- Vol. 26 (1) , 98-123
Analysis of the MAP/G/1 Queue Under the Min(N,D)-Policy
In this paper, we consider the queueing system under the MAP (Markovian Arrival process) arrivals and the Min(N, D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service time of the waiting customers exceeds D, whichever occurs first (Min(N, D)-policy). We analyze the queue length, workload, and waiting time. Then, we present numerical examples in which our analytical results are compared with the simulation estimates for verification purposes. We also compare our system with the M/G/1 queue under the same parameter setting and show that a naive Poisson assumption may severely underestimate the mean performance measures.
- 23 February 2009
- Published by Taylor & Francis in Stochastic Analysis and Applications
- Vol. 27 (2) , 331-352
MAP/G/1 Queue Under Workload Control and Postprocessing
This article studies the performance of the MAP/G/1 queue under workload control and post processing. We first obtain the probability generating function of the queue length distribution. Then we derive the mean queue length. We present computational experiences and compare the MAP queue with the Poisson queue.
- 23 February 2009
- Published by Taylor & Francis in Stochastic Analysis and Applications
- Vol. 27 (2) , 331-352
MAP/G/1 Queue Under Workload Control and Postprocessing
This article studies the performance of the MAP/G/1 queue under workload control and post processing. We first obtain the probability generating function of the queue length distribution. Then we derive the mean queue length. We present computational experiences and compare the MAP queue with the Poisson queue.
- 1 January 2009
- Published by Springer Nature
- p. 77-102
Modeling of Production System with Nonrenewal Batch Input, Early Setup, and Extra Jobs
- 1 January 2009
- Published by Springer Nature
- p. 77-102
Modeling of Production System with Nonrenewal Batch Input, Early Setup, and Extra Jobs
- 31 December 2007
- Published by Taylor & Francis in Stochastic Analysis and Applications
- Vol. 26 (1) , 39-59
Analysis and Cost Optimization of theM/G/1 Queue Under theD-Policy and LCFS Discipline
We deal with the M/G/1 queues under the D-policy and last-come-first-served (LCFS) disciplines. We first derive the queue length and waiting time distributions in the form of probability generating functions and the Laplace–Stieltjes transforms. Then we derive the mean performance measures. Finally, we obtain the optimal values of D under a linear cost function.
- 31 December 2007
- Published by Taylor & Francis in Stochastic Analysis and Applications
- Vol. 26 (1) , 39-59
Analysis and Cost Optimization of theM/G/1 Queue Under theD-Policy and LCFS Discipline
We deal with the M/G/1 queues under the D-policy and last-come-first-served (LCFS) disciplines. We first derive the queue length and waiting time distributions in the form of probability generating functions and the Laplace–Stieltjes transforms. Then we derive the mean performance measures. Finally, we obtain the optimal values of D under a linear cost function.