• 전자공학회논문지B
• /
• 제30B권8호
• /
• pp.23-32
• /
• 1993

This paper presents a decomposition method to evaluate the performance measures of the serial production lines with unreliable machines and finite buffers. This method is to decompose the transfer line into a set of two machine lines for analysis. Bases on this approximation method, we consider nonhomogeneous lines. In such lines, the machines may take the different lengths of time performing operations on parts. A new transformation is employed in order to replace the line by a homogeneous line. The approximate transformation enables one to determine parameters of performance such as production rate and average buffer levels, and it also shows better application for a large class of systems.

• 대한산업공학회지
• /
• 제22권1호
• /
• pp.3-15
• /
• 1996

An approximation algorithm is presented for cyclic queueing networks with finite buffers. The algorithm decomposes the queueing network into individual queues with revised arrival and service process and revised queue capacity. Then, each queue is analyzed in isolation. The service process reflects the additional delay a unit might undergo due to blocking and the arrival process is described by a 2-phases Coxian ($C_2$) distribution. The individual queues are modelled as $C_2/C_2$/1/B queues. The parameters of the individual queues are computed approximately using an iterative scheme. The population constraint of the closed network is taken into account by ensuring that the sum of the average queue lengths of the individual queues is equal to the number of customers of the network. Extensive numerical experiments show that this method provides a fairly good estimation of the throughput.

• 산업공학
• /
• 제14권4호
• /
• pp.348-355
• /
• 2001

This paper suggests a detailed design of APS(Advanced Planning & Scheduling) system using the DBR (Drum-Buffer-Rope) which is a finite capacity scheduling logic of TOC(Theory of Constraints). Our design is composed of four modules; Network, Buffer, Drum and Subordination. The Network module defines the Product Network which is built from BOM and routings. The Buffer module inserts the Buffers into the Product Network. The Drum module describes detail procedures to create Drum Schedule on the CCR(Capacity Constraint Resource). The Subordination module synchronizes all non-constraints to the constraints by determining the length of Rope. This design documented by ARIS.

• 한국시뮬레이션학회논문지
• /
• 제10권4호
• /
• pp.65-75
• /
• 2001

This study presents a heuristic algorithm for buffer allocation in FMS(Flexible Manufacturing System). The buffers, which are finite resources in FMS, are responsible for improvement of an overall system utilization. But, until now, the study for buffer allocation in FMS are rarely conducted because of the complexity in FMS. Most studies for buffer allocation had been addressed to the simple production line system. The presented algorithm uses a simulation for the description of system complexity and uses a genetic algorithm for finding better buffer allocation. Lastly, we compare performance of the presented algorithm with that of a simple heuristic, and analyze the experiment results.

• ETRI Journal
• /
• 제43권3호
• /
• pp.447-458
• /
• 2021

The quality of experience (QoE) of video streaming is degraded by playback interruptions, which can be mitigated by the playout buffers of end users. To analyze the impact of playout buffer dynamics on the QoE of wireless adaptive hypertext transfer protocol (HTTP) progressive video, we model the playout buffer as a G/D/1 queue with an arbitrary packet arrival rate and deterministic service time. Because all video packets within a block must be available in the playout buffer before that block is decoded, playback interruption can occur even when the playout buffer is non-empty. We analyze the queue length evolution of the playout buffer using diffusion approximation. Closed-form expressions for user-perceived video quality are derived in terms of the buffering delay, playback duration, and interruption probability for an infinite buffer size, the packet loss probability and re-buffering probability for a finite buffer size. Simulation results verify our theoretical analysis and reveal that the impact of playout buffer dynamics on QoE is content dependent, which can contribute to the design of QoE-driven wireless adaptive HTTP progressive video management.

• 한국자동차공학회논문집
• /
• 제14권4호
• /
• pp.12-19
• /
• 2006

It is positively necessary to study on the stiffness of a 13degree-type impact tester in order to improve the fracture prediction of impact testing in wheels using FE(finite-element) analysis. The 13degree-type impact tester consists of an impact striker, a wheel fixer, a steel plate, and four cylindrical rubbers. Important parts of the tester are the steel plate and four cylindrical rubbers which play a role of absorbing impact energy during impact testing. Because of these buffers, the RF(reaction force) variation of the lower part in the 13degree-type impact tester showed the tendency like a damped harmony oscillation during impact testing. In order to investigate the stiffness of a 13degree-type impact tester, this work measured each stiffness of a steel plate and cylindrical rubbers. The stiffness of a cylindrical rubber was measured using a compressive tester. On the other hand, the stiffness of a steel plate was predicted by simulating experimental method using FE analysis.

• 한국시뮬레이션학회논문지
• /
• 제28권2호
• /
• pp.119-129
• /
• 2019

유한 버퍼를 갖는 라인 생산시스템은 오랜 기간 동안 연구되어왔지만, 몇몇 특별한 경우 외에는 대기시간(체류시간), 차단 확률과 같은 시스템 성능 값에 대한 분석 결과는 많지 않다. 최근에, max-plus 대수를 활용하여 상수 공정시간을 갖고 버퍼 완전 공유 정책을 따르는 시스템에서 대기시간의 고차평균과 꼬리확률에 대한 분석 결과가 소개되었다. 이와 같은 max-plus 대수를 활용한 분석이 이론적으론 일반 공정시간 모형에도 응용 가능하지만, 도출된 표현식에 대한 적절한 계산방법을 제공하지 못한다. 이러한 이유로, 본 연구에서는 max-plus 대수로 도출된 표현식과 @RISK 소프트웨어를 활용하여 스프레드시트 시뮬레이션 모형을 개발하고, 두 가지 차단정책(통신차단과 제조차단) 하에서 시스템 특성값인 대기시간(또는 체류시간)과 차단확률을 비교 분석하였다. 또한 차단확률에 대한 제약을 만족하는 공유 버퍼의 크기를 결정하는 최적화 문제도 분석하였다.