• 한국정보시스템학회:학술대회논문집
• /
• 한국정보시스템학회 2003년도 추계학술대회
• /
• pp.55-63
• /
• 2003

Workflow Management System (WFMS) is a software system to support an efficient execution, control and management of complex business processes. Since traditional commercial systems mainly focus on automating processes, they don't have methods for enhancing the task performer's efficiency. In this paper, we propose a new method of executing business processes more efficiently in that a whole process is scheduled considering the degree of the participants' workload. The method allows managing the largest constraints among constituent resources of the process. We utilize DBR scheduling techniques to develop the method. We first consider the differences between workflow process models and DBR application models, and then develop the modified drum, buffer and rope. This leads us to develop WF-DBR (WorkFlow-DBR) that can control the proper size of the task performers' work list and arrival rate of process instances. Use of WF-DBR improves the efficiency of the whole process as well as the participants' working condition. We then carry out a set of simulation experiments and compare the effectiveness of our approach with that of scheduling techniques used in existing systems.

• 한국응급구조학회지
• /
• 제11권3호
• /
• pp.111-118
• /
• 2007

Purpose : It was to present strategies on activation of prehospital medical direction in Korea. Methods : This study was conducted by analysing some papers on prehospital medical direction and statistical data from the National Emergency Management Agency. Results : There was no active application of medical direction methods such as Priority Dispatch System, Pre-Arrival Instructions, System Status Management and no data on prehospital medical direction. To estimate direct medical control on emergency patients who were sorted by EMTs in 2006 was only 2.5%. Conclusion : To improve prehospital medical direction, it needed to applicate data collecting & using system and in-direct & direct medical control by medical doctor.

• 디지털산업정보학회논문지
• /
• 제5권1호
• /
• pp.83-88
• /
• 2009

This paper consider the problem of direction of arrival(DOA) estimation in the presence of multipath propagation. The sensor elements are assumed to be linear and uniformly spaced. Numerous authors have advocated the use of a beamforming preprocessor to facilitate application of high resolution direction finding algorithms The benefits cited include reduced computation, improved performance in environments that include spatially colored noise, and enhanced resolution. Performance benefits typically have been demonstrated via specific example. The purpose of this paper is to provide an analysis of a beamspace version of the MUSIC algorithm applicable to two closely spaced emitters in diverse scenarios. Specifically, the analysis is applicable to uncorrelated far field emitters of any relative power level, confined to a known plane, and observed by an arbitrary array of directional antenna. In this paper, we researched about optimize beam forming to smart antenna system. The covariance matrix obtained using fourth order cumulant function. Simulations illustrate the performance of the techniques.

• 한국경영과학회지
• /
• 제30권2호
• /
• pp.73-80
• /
• 2005

In this paper, we consider characteristics of waiting times in s1n91e-server 3-node tandem queues with finite buffers, a Poisson arrival process and deterministic service times at all nodes. There are three buffers : one at the first node is infinite and the others are finite. We obtain the fact that sojourn time or departure process is independent of the capacities of the finite buffers and does not depend on the order of service times, which are the same results in the literature. Moreover, the explicit expressions of stationary waiting times in all areas of the systems can be derived as functions of the finite buffer capacities. We also disclose a relationship of waiting times in subareas of the systems between two blocking policies communication and manufacturing. Some numerical examples are also provided.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.881-889
• /
• 2005

In this study, we consider characteristics of waiting times in single-server 3-node tandem queues with a Poisson arrival process, finite buffers and deterministic or non-overlapping service times at each queue. There are three buffers: one at the first node is infinite and the others are finite. The explicit expressions of waiting times in all areas of the systems, which are driven as functions of finite buffer capacities, show that the sojourn time does not depend on the finite buffer capacities and also allow one to compute and compare characteristics of waiting times at all areas of the system under two blocking policies: communication and manufacturing blocking. As an application of these results, moreover, an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on waiting times is considered. Some numerical examples are also provided.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.775-783
• /
• 2005

이동통신 네트워크의 위치영역 설계는 위치관리 비용을 최소화하도록 네트워크를 위치영역으로 분리하는 문제이다. 기존 위치영역 설계 관련 연구는 설계의 모수가 되는 호 발생률 및 셀 간 가입자 이동률을 고정된 것으로 가정하였다. 그러나 실제 환경에서의 두 모수는 시간에 따라 변화하고, 일정한 패턴을 나타내며, 시간 당 셀 내 인구에 영향을 받는다. 본 연구에서는 이러한 인구유동 및 호 발생의 불확실성 및 시간에 따는 패턴 변화를 고려하여 기준 이상의 페이징 서비스 품질을 만족시키고, 비용을 최소화 하는 위치영역 설계 방식을 제안하였다. 모수의 변동에 일정 서비스 품질을 보장하기 위해 시간대 및 가동률 상한의 개념을 도입하여 추계적 문제를 정적 그래프 분리문제로 변환하였고, 이에 대한 솔루션은 Simulated Annealing을 응용한 경험적 최적해 도출 알고리즘을 이용하여 도출했다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.866-872
• /
• 2005

본 연구는 비축출형 우선순위 2-계층 대기행렬을 다룬다. 각 계층별 고객들은 마코비안 도착과정(Markovian arrival process, MAP)에 의하여 시스템에 도착하고, 각 계층마다 고유의 임계점을 갖는다. 시스템 내에 고객들이 존재하지 않으면 서어버는 유휴해지고 어느 계층이든지 상관없이 계층에 부여된 임계점에 먼저 도달하면 서어버는 서비스를 시작한다. 우선순위가 높은 고객들을 먼저 서비스하는 비축출형 우선순위 서비스규칙을 따른다. 본 연구에서는 각 계층별 고객들의 대기시간분포에 대한 라플라스(Laplace-Stieltjes) 변환과 평균 대기시간을 유도한다.

• 한국경영과학회지
• /
• 제24권4호
• /
• pp.111-122
• /
• 1999

In this paper, we consider a queueing network model. where the population constraint within each subnetwork is controlled by a semaphore queue. The total number of customers that may be present in the subnetwork can not exceed a given value. Each node has a constant service time and the arrival process to the queueing network is an arbitrary distribution. A major characteristics of this model is that the lower layer flow is halted by the state of higher layer. We present some properties that the inter-change of nodes does not make any difference to customer's waiting time in the queueing network under a certain condition. The queueing network can be transformed into a simplified queueing network. A dramatic simplification of the queueing network is shown. It is interesting to see how the simplification developed for sliding window flow control, can be applied to multi-layered queueing network.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2007년도 추계학술대회 및 정기총회
• /
• pp.195-203
• /
• 2007

In this paper, an analytic model of sleep model operation in the IEEE 802.16e is investigated. A mobile subscribe. station (MSS) goes to sleep mode after negotiations with the base station (BS) and wakes up periodically for a short interval to check whether there is downlink traffic to it. If the arrival of traffic is notified, an MSS returns to wake mode. Otherwise, it again enters increased sleep interval which is double as the previous one. In order to consider the situation more practically, we propose the sleep mode starting threshold, during which MSS should await packets before it enters the sleep mode. By modifying the M/G/1 with multiple vacations model, energy consumption ratio(ECR) and average packet response time are calculated. Our analytic model provides potential guidance in determining the optimal parameters values such as sleep mode starting threshold, minimal sleep and maximal sleep window.

• 품질경영학회지
• /
• 제22권1호
• /
• pp.214-218
• /
• 1994

An inventory supplies stock continuously at a constant rate. A deliveryman arrives according to a Poisson process. If the level of the inventory, when he arrives, exceeds a threshold, no action is taken, otherwise a delivery is made by a random amount. Costs are assigned to each visit of the deliveryman, to each delivery, to the inventory being empty and to the stock being kept. It is shown that there exists a unique arrival rate of the deliveryman which minimizes the average cost per unit time over an infinite horizon.