http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Analysis of a Queueing Model with Time Phased Arrivals
김제숭,Kim, Che-Soong Korea Society of Industrial Information Systems 2007 한국산업정보학회논문지 Vol.12 No.4
A single-server queueing model with infinite buffer and batch arrival of customers is considered. In contrast to the standard batch arrival when a whole batch arrives into the system at one epoch, we assume that the customers of an accepted batch arrive one-by one in exponentially distributed times. Service time is exponentially distributed. Flow of batches is the stationary Poisson arrival process. Batch size distribution is geometric. The number of batches, which can be admitted into the system simultaneously, is subject of control. Analysis of the joint distribution of the number batches and customers in the system and sojourn time distribution is implemented by means of the matrix technique and method of catastrophes. Effect of control on the main performance measures of the system is demonstrated numerically.
New Warranty Model with Varying Usage Intensity
김제숭,Kim, Che-Soong Society of Korea Industrial and System Engineering 2005 한국산업경영시스템학회지 Vol.28 No.3
대부분의 일차원 보증정책에 대한 비용분석은 소비자 사용률이 모든 사용자들에게 동이란 것으로 가정하고 있다. 하지만 현실적으로 사용률은 소비자에 따라서 다르기 때문에, 일반적인 경우 소비자 집단을 ${\kappa}$ 범주로 나눌 수 있다. 즉, 동일한 제품에 대해서 생산자는 ${\kappa}$ 범주에 속하는 다른 보증정책을 제시할 수 있고, 보증비용은 이런 옵션들 가운데 소비자가 자기의 입장에 맞는 보증기간을 선택할 수 있다. 본 논문에서는 소비자의 사용률이 변화하는 경우를 고려한 무료보증정책을 갖는 기대보증비용 모형을 분석하고, 이에 따른 수치예제를 제시한다.
Warranty Models with Discrete Preventive Maintenance
김제숭,Kim, Che-Soong Korean Institute of Industrial Engineers 2002 산업공학 Vol.15 No.3
Products which are sold with warranty, preventive maintenance actions by manufacturers and/or buyers have an impact on the total costs for both parties. In this paper, we develop the models to study the expected warranty cost for products with free repairable warranty with three types of discrete preventive maintenance. We deal with by utilizing the concept that preventive maintenance reduces the virtual age of the system. We assume that the maintenance planning horizon can be segmented into k discrete and equally sized periods. In such a scenario, numerical examples are presented.
PERFORMANCE ANALYSIS OF A LOSS-RETRIAL BMAP/PH/N SYSTEM
Che-Soong Kim(김제숭),Young-Jin Oh(오영진) 한국산업경영시스템학회 2004 한국산업경영시스템학회 학술대회 Vol.2004 No.춘계
This paper investigates the mathematical model of multi-server retrial queueing system with the Batch Markovian Arrival Process (BMAP), the Phase type (PH) service distribution and the finite buffer. The sufficient condition for the steady state distribution existence and the algorithm for calculating this distribution are presented. Finally, a formula to solve loss probability in the case of complete admission discipline is derived.
Stable Algorithm for a BMAP\SM\1 Queue with MAP Input of Disasters
Che-Soong Kim(김제숭),Young-Jin Oh(오영진),Seog-Ha Park(박석하) 한국산업경영시스템학회 2004 한국산업경영시스템학회 학술대회 Vol.2004 No.춘계
A BMAP/SM/1 queueing system with Markovian arrival input of disasters is considered. After a disaster arrival all customers leave the system instantaneously and a server is recovered during a random period of time. We consider both variants of accumulating and losing the customers arriving during a recovery period. Numerically stable algorithm for calculation of the stationary state distribution of embedded Markov chain is presented.
Stable Algorithm for a BMAP\SM\1 Queueing System
김제숭(Che-Soong Kim),오영진(Young-Jin Oh) 한국산업경영시스템학회 2006 한국산업경영시스템학회지 Vol.29 No.2
대기행렬 모형은 통신시스템이나 통신망 구현에 가장 적합한 수리모형으로 알려져 있고, 이에 대한 연구가 상당히 많이 진행되고 있다. 본 논문에서는 재해가 발생될 수 있는 BMAP/SM/1 대기시스템으로, 재해가 발생했을 경우 시스템 복구가 즉시 이루어지지 않고 임의 시간 후 복구 되는 시스템을 고려대상으로 하고 있다. 시스템의 정보입력흐름은 상호종속 또는 그룹 입력이 허용되는 배치마코프 도착과정으로 가정하였고, 또한 서비스분포는 세미 마코프 프로세스를 따른다고 가정하였다. 아울러 시스템에 재해가 발생하면 모든 고객은 즉시 시스템을 떠나게 되고, 재해복구는 임의 시간 후에 이루어진다. 임베디드 마코프체인의 안전상태 확률분포가 유도를 위한 정상 알고리즘 개발이 이루어졌다.
Queueing System with Negative Customers and Partial Protection of Service
이석준(Seok-Jun Lee),김제숭(Che-Soong Kim) 한국산업경영시스템학회 2007 한국산업경영시스템학회지 Vol.30 No.1
A multi-server queueing system with finite buffer is considered. The input flow is the BMAP (Batch Markovian Arrival Process). The service time has the PH (Phase) type distribution. Customers from the BMAP enter the system according to the discipline of partial admission. Besides ordinary (positive) customers, the Markovian flow (MAP) of negative customers arrives to the system. A negative customer can delete an ordinary customer in service if the state of its PH-service process belongs to some given set. In opposite case the ordinary customer is considered to be protected of the effect of negative customers. The stationary distribution and the main performance measures of the considered queueing system are calculated.