• 산업경영시스템학회지
• /
• 제30권3호
• /
• pp.89-93
• /
• 2007

In this study, we consider an assembly line operated under a base-stock policy. A product consists of two parts, and a finished product transfers to a warehouse in which demands are satisfied. Assume that demands arrive according to a Poisson process and processing times at each production line are exponentially distributed. Whenever a demand arrives, it is satisfied immediately from an inventory in the warehouse if available; otherwise, it is backlogged and satisfied later by the next product exiting from production lines. In either case, an arriving demand automatically triggers the production of a part at both production lines. These two parts will be assembled into a product that eventually transfers to the warehouse. We obtain a closed form formula of approximation for delay time or lead time distribution of a demand when a base- stock level is s. Moreover, it can be applied to the optimal base-stock level which minimizes the total inventory cost. Numerical examples are presented to show our optimal base-stock level's quality.

• Asia pacific journal of information systems
• /
• 제26권3호
• /
• pp.427-448
• /
• 2016

The stochastic phenomena of traffic network condition, such as traffic speed and density, are affected not only by exogenous traffic control but also by endogenous changes in service time during congestion. In this paper, we propose a mixed M/G/1 queuing model by introducing a condition-varying parameter of traffic congestion to reflect structural changes in the traffic network. We also develop congestion indices to evaluate network efficiency in terms of traffic flow and economic cost in traffic operating system using structure-changing queuing model, and perform scenario analysis according to various traffic network improvement policies. Empirical analysis using Korean highway traffic operating system shows that our suggested model better captures structural changes in the traffic queue. The scenario analysis also shows that occasional reversible lane operation during peak times can be more efficient and feasible than regular lane extension in Korea.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제16권4호
• /
• pp.313-322
• /
• 2016

Purpose: We introduce ways to employ Markov chain model to evaluate the effect of preventive maintenance process. While the preventive maintenance process decreases the failure rate of each subsystems, it increases the downtime of the system because the system can not work during the maintenance process. The goal of this paper is to introduce ways to analyze this trade-off. Methods: Markov chain models are employed. We derive the availability of the system consisting of N repairable subsystems by the methods under various maintenance policies. Results: To validate our methods, we apply our models to the real maintenance data reports of military truck. The error between the model and the data was about 1%. Conclusion: The models developed in this paper fit real data well. These techniques can be applied to calculate the availability under various preventive maintenance policies.

• 경영과학
• /
• 제25권3호
• /
• pp.87-99
• /
• 2008

Besieged by needs for upgrading the current Internet, social pressures, and regulatory concerns, a network operator may be left with few options to Improve his services. Yet he can still consider a transition prioritizing network services. In this paper, we describe a transition from a non-priority system to a prioritized one, using non-preemptive M/G/1 model. After reviewing the constraints and theoretical results from past research, we describe steps making the transition Pareto-improving, which boils down to a multi-goal search for a Pareto-improving state. We use a genetic algorithm that captures actual transition costs along with incentive-compatible and Pareto-Improving constraints. Simulation results demonstrate that the initial post-transition solutions are typically Pareto-improving. for non Pareto-improving solutions, the heuristic quickly generates Pareto-improving and incentive-compatible solutions.

• 산업경영시스템학회지
• /
• 제35권4호
• /
• pp.162-170
• /
• 2012

We propose a new priority discipline called the strict T-preemptive priority discipline, and derive the waiting time distributions of each class in the strict T-preemptive priority M/G/1 queue. Using this queueing analysis, we evaluate the performance of an opportunistic spectrum access in cognitive radio networks, where a communication channel is divided into time slots, a licensed primary user is assigned to one channel, and multiple unlicensed secondary users may opportunistically exploit time slots unused by the primary user. We also present a numerical example of the analysis of the opportunistic spectrum access where the arrival rates and service times distributions of each users are identical.

• International Journal of Control, Automation, and Systems
• /
• 제3권1호
• /
• pp.122-129
• /
• 2005

We describe the MiniWeb[7] TCP/IP stack (mIP), which is an extremely small implementation of the TCP/IP protocol suite running 8 or 32-bit micro controllers intended for embedded control systems, and satisfying the subset of RFC1122 requirements needed for host­to-host interoperability over different platforms. Our TCP/IP implementation does sacrifice some of TCP's mechanisms such as fragmentation, urgent data, retransmission, or congestion control. Our implementation is applicable to web based controllers. The network protocols are tested in operational networks using CommView and Dummynet where the various operational parameters such as bandwidth, delay, and queue sizes can be set and controlled.

• 대한산업공학회지
• /
• 제21권2호
• /
• pp.167-181
• /
• 1995

We develop an analytical model to estimate the time a workpiece spends in both input and output queues in trip-based material handling systems. The waiting times in the input queues are approximated by M/G/1 queueing system and the waiting times in the output queues are estimated using the method discussed in Bozer, Cho, and Srinivasan [2]. The analytical results are tested via simulation experiment. The result indicates that the analytical model estimates the expected waiting times in both the input and output queues fairly accurately. Furthermore, we observe that a workpiece spends more time waiting for a processor than waiting for a device even if the processors and the devices are equally utilized. It is also noted that the expected waiting time in the output queue with fewer faster devices is shorter than that obtained with multiple slower devices.

• 한국정보처리학회논문지
• /
• 제7권11S호
• /
• pp.3684-3693
• /
• 2000

본 논문에서는 다양한 트래픽을 수용해야 하는 차세대 인터넷에서 핵심적인 기능을 담당하는 고속 패킷스위치를 위한 동적우선권제어함수(Dynamic Priority Control Function)이 개념을 도입하고 TBPJ(Threshold-based Bernoulli Priority Jump) 방식에 대한 성능분석을 하였다. 동적우선권제어함수(Dynamic Priority Control Function)는 시스템의 상태에 따라 각 트래픽에 우선권을 동적으로 할당하여 패킷의 스케쥴링(scheduling)을 제어하는 함수 f(.)이다. 클래스 1의 손실민감(loss-sensitive) 트래픽과 클래스 2의 지연민감(delay-sensitive) 트래픽이 고속 패킷스위치의 모든 입력포트에 동일하게 입력되고 스위칭속도(switching capacity)가 m인 $N\timesN$용량의 고속 패킷스위치에 TBPJ 방식의 DPCF 함수를 적용하여 성능을 분석하였다. 이때 스위치는 유한한 크기의 입력 버퍼와 무한크기의 출력버퍼로 구성되어 있고 슬롯 단위로 동기방식(synchronous)으로 동작한다고 가정하였다. TBPJ 방식은 각 입력버퍼에 대기하고 있는 현재 트래픽의 양과 시스템 버퍼의 문턱값(threshold)에 따라 서비스 순위를 동적으로 할당하여 효율적인 스케쥴링이 이루어지도록 한다. 성능분석을 통하여 TBPJ 제어방식이 기존의 우선권 제어 방식보다 성능 및 효율성에 있어서 우수함을 입증하였다. 즉 TBPJ 방식을 적용하여 성능을 분석한 결과 손실민감 트래픽의 QoS(Quality of Service)를 만족시키기 위하여 패킷스위치를 스위치플랜으로 구현하는 경우 병렬로 (즉 m=2) 구성하면 충분하다는 것을 확인하였다.

• 대한원격탐사학회지
• /
• 제5권1호
• /
• pp.41-56
• /
• 1989

Improvement of the multichannel sea surface temperature(MCSST) software, which had been developed for the purpose of operating under mainframe computer system, was seeked in order to operate effectively in a mini computer system. CPU time and processing time, which is not a major factor under mainframe computer system, become a critical factor in real time image processing under mini computer system. Due to fixed kernel size(3$\times$4) of the old MCSST software, high spatial resolution characteristics of the original image received from satellites were apparently degraded when images are transformed into a cartesian coordinate system after geometrical distortions of the image due to earth curvature are removed. CPU and processing time were reduced to 0.13 and 0.15~0.22 comparing with the old MCSST's, respectively, by applying disk block I/O and M/T queue I/O method under VAX-11/750 computer. The high resolution quality (1.1km in AVHRR) of the processed image was guaranted using 2$\times$2 kernel size and applying moving window techniques without sacrificing CPU and processing time much.

• 대한교통학회지
• /
• 제7권2호
• /
• pp.89-111
• /
• 1989

This study concentrates on a basic investigation research related to some of parameters to be used for the analysis of capacity and the level of service for signalized intersections. The parameters to be studied are ideal saturation flow rate, large vehicle's passenger car equivalent(PCE) ane the lane utilization factors of through and left turn vehicles. The field data were collected at six intersections in Seoul using video cameras so as to reflect conditions in urban areas. In this study discharge headway based on a rear bumper of each vehicle was used and all the parameters were estimated using a regression technique. The findings of this research are as follows : 1. The saturation headway and saturation flow rate on a single lane with the lane width of 3.1m are 1.652 seconds and 2,180 pcphgpl. It was found that the frist 5 vehicles in the queue experience some start-up lost time. 2. It was confirmed that the new method adopted for the estimate of large vehicle's PCE gives larger PCE values than those derived from the method commonly used. 3. For the estimate of lane utilization factors of through and left turn vehicles, a relationship was established and the corresponding formulas were developed.