http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
최두일 ( Choi Doo Il ),임대은 ( Lim Dae-eun ) 한국경영공학회 2016 한국경영공학회지 Vol.21 No.4
In this study, we analyze a manufacturing system with a variable production rate. The system produces an item upon a request. If an arriving request finds the system occupied, the request waits in the queue. The production (or service) time distribution of requests (or customers) upon production initiation is changed if the number of requests in the system reaches a predefined threshold L₂. Then, the changed production time distribution continues until the number of requests in the system is reduced to another threshold L₁(≤ L₂), and this process is repeated. We model this system as an MMPP/G/1/K queue with a modified state-dependent service rate and analyze the system using an embedded Markov chain and a supplementary variable method. The performance measures of the queue-length distributions at a customer`s departure epochs and at an arbitrary time are derived. Numerical examples are also presented.
A Note on the M/G/1/K Queue with Two-Threshold Hysteresis Strategy of Service Intensity Switching
Doo Il Choi(최두일),Bo Keun Kim(김보근),Doo Ho Lee(이두호) 한국경영과학회 2014 韓國經營科學會誌 Vol.39 No.3
We study the paper Zhernovyi and Zhernovyi [Zhernovyi, K.Y. and Y.V. Zhernovyi, “An M <SUP>θ</SUP>/G/1/m system with two-threshold hysteresis strategy of service intensity switching,” Journal of Communications and Electronics, Vol.12, No.2(2012), pp.127-140]. In the paper, authors used the Korolyuk potential method to obtain the stationary queue length distribution. Instead, our note makes an attempt to apply the most frequently used methods : the embedded Markov chain and the supplementary variable method. We derive the queue length distribution at a customer"s departure epoch and then at an arbitrary epoch.
Choi Doo Il(최두일) 한국통신학회 2009 한국통신학회 학술대회논문집 Vol.2009 No.6
Traffics are classified into two types, real-time traffic such as voice and video and nonreal-time traffic such as data. By properties of burstiness and correlation between interarrival, it is assumed the arrival of real-time traffic to be a Markovian Arrival Process ( MAP ). The nonreal-time traffic follows a Poisson Process. We compare performance of diverse scheduling schemes to support real-time and nonreal-time traffic. Concretely, Head of Line priority scheme, Shortest Job First scheme, Longest Job First scheme, Bernoulli scheme, QLT scheme and QLT scheme with Bernoulli, are investigated, and their performance measures, loss and delay, are compared. Finally, this investigation helps the system designer to select optimal scheduling scheme, while satisfying the Quality of Service(QoS) of each traffics.