• Title/Summary/Keyword: finite buffer

Search Result 133, Processing Time 0.02 seconds

Determination of Optimal Buffer Size for Semiconductor Production System using Harmony Search Algorithm (하모니서치 알고리즘을 이용한 반도체 공정의 최적버퍼 크기 결정)

  • Lee, Byeong-Gil;Byun, Minseok;Kim, Yeojin;Lee, Jonghwan
    • Journal of the Semiconductor & Display Technology
    • /
    • v.19 no.4
    • /
    • pp.39-45
    • /
    • 2020
  • In the production process, the buffer acts as a buffer to alleviate some of the problems such as delays in delivery and process control failures in unexpected situations. Determining the optimal buffer size can contribute to system performance, such as increased output and resource utilization. However, there are difficulties in allocating the optimal buffer due to the complexity of the process or the increase in the number of variables. Therefore, the purpose of this research is proposing an optimal buffer allocation that maximizes throughput. First step is to design the production process to carry out the research. The second step is to maximize the throughput through the harmony search algorithm and to find the buffer capacity that minimizes the lead time. To verify the efficiency, comparing the ratio of the total increase in throughput to the total increase in buffer capacity.

Explicit Expression for Moment of Waiting Time in a DBR Line Production System with Constant Processing Times Using Max-plus Algebra (Max-plus 대수를 이용한 상수 공정시간을 갖는 DBR 라인 생산시스템에서의 대기시간에 대한 간결한 표현식)

  • Park, Philip;Seo, Dong-Won
    • Journal of the Korea Society for Simulation
    • /
    • v.24 no.2
    • /
    • pp.11-17
    • /
    • 2015
  • Although systems with finite capacities have been the topic of much study, there are as of yet no analytic expressions for (higher) moment and tail probability of stationary waiting times in systems with even constant processing times. The normal queueing theory cannot properly handle such systems due to the difficulties caused by finite capacity. In this study, for a DBR (Drum-Buffer-Rope) line production system with constant processing times, we introduce analytic expressions by using previous results obtained using a max-plus algebraic approach.

Spreadsheet Model Approach for Buffer-Sharing Fork-Join Production Systems with General Processing Times and Structure (일반 공정시간과 구조를 갖는 버퍼 공유 분기-접합 생산시스템의 스프레드시트 모형 분석)

  • Seo, Dong-Won
    • Journal of the Korea Society for Simulation
    • /
    • v.28 no.3
    • /
    • pp.65-74
    • /
    • 2019
  • For many years, it has been widely studied on fork-join production systems but there is not much literature focusing on the finite buffer(s) of either individuals or shared, and generally distributed processing times. Usually, it is difficult to handle finite buffer(s) through a standard queueing theoretical approach. In this study, by using the max-plus algebraic approach we studied buffer-shared fork-join production systems with general processing times. However, because it cannot provide proper computational ways for performance measures, we developed simulation models using @RISK software and the expressions derived from max-plus algebra. From the simulation experiments, we compared some properties on waiting time with respect to a buffer capacity under two blocking policies: BBS (Blocking Before Service) and BAS (Blocking After Service).

Hardware accelerated Voxelization using a Stencil Buffer (Stencil Buffer를 이용한 형상의 복셀화)

  • Jang Dong Go;Kim Gwang Su
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.266-271
    • /
    • 2002
  • We propose a hardware accelerated voxelization method for various 3D object model such as surface models, solid models, and volumetric CSG models. The algorithm utilizes the stencil buffer that is one of modern Open히 graphics hardware features. The stencil buffer is originally used to restrict drawing to certain portions of the screen. The volumetric representations of given 3D objects are constructed slice-by-slice. For each slice, the algorithm restricts the drawing areas constructed inner region of 3D objects using the stencil buffer, and generates slices of the volumetric representation for target objects. As a result, we can provide volume graphics support for various engineering applications such as multi-axis machining simulation, collision detection and finite element analysis.

  • PDF

A Study on the Nonlinear Structural Analysis for Spent Nuclear Fuel Disposal Container and Bentonite Buffer (고준위폐기물 처분장치와 이를 감싸고 있는 벤토나이트 버퍼에 대한 비선형 구조해석)

  • 권영주;최석호
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.04a
    • /
    • pp.19-26
    • /
    • 2002
  • In this paper, the nonlinear structural analysis for the composite structure of the spent nuclear fuel disposal container and the 50cm thick bentonite buffer is carried out to predict the collapse of the container while the sudden rock movement of 10cm is applied on the composite structure. This sudden rock movement is anticipated by the earthquake etc. at a deep underground. Horizontal symmetric rock movement is assumed in this structural analysis. Elastoplastic material model is adopted. Drucker-Prager yield criterion is used for the material yield prediction of the bentonite buffer and von-Mises yield criterion is used for the material yield prediction of the container(cast iron insert, copper outer shell and lid and bottom). Analysis results show that even though very large deformations occur beyond the yield point in the bentonite buffer, the container structure still endures elastic small strains and stresses below the yield strength. Hence, the 50cm thick bentonite buffer can protect the container safely against the 10cm sudden rock movement by earthquake etc.. Analysis results also show that bending deformations occur in the container structure due to the shear deformation of the bentonite buffer. The elastoplastic nonlinear structural analysis for the composite structure of the container and the bentonite buffer is performed using the finite element analysis code, NISA.

  • PDF

Stationary Waiting Times in Simple Fork-and-Join Queues with Finite Buffers and Communication Blocking (통신차단규칙을 따르는 유한버퍼 단순 조립형 대기행렬 망에서의 안정대기시간)

  • Seo, Dong-Won;Lee, Seung-Man
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.3
    • /
    • pp.109-117
    • /
    • 2010
  • In this study, we consider stationary waiting times in a simple fork-and-join type queue which consists of three single-server machines, Machine 1, Machine 2, and Assembly Machine. We assume that the queue has a renewal arrival process and that independent service times at each node are either deterministic or non-overlapping. We also assume that the Machines 1 and 2 have an infinite buffer capacity whereas the Assembly Machine has two finite buffers, one for each machine. Services at each machine are given by FIFO service discipline and a communication blocking policy. We derive the explicit expressions for stationary waiting times at all nodes as a function of finite buffer capacities by using (max,+)-algebra. Various characteristics of stationary waiting times such as mean, higher moments, and tail probability can be computed from these expressions.

The Study for Optimal Boner Allocation in FMS Using Genetic Algorithm and Simulation (유전알고리즘과 시뮬레이션을 이용한 유연생산시스템에서의 최적 버퍼 할당에 관한 연구)

  • 이용균;김경섭
    • Journal of the Korea Society for Simulation
    • /
    • v.10 no.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.

  • PDF

On Statistical Multiplexing of Data Signals with Dynamic Buffer Control (Buffer의 동적제어에 의한 데이터 신호의 통계적 다중화에 관한 연구)

  • 김낙명;은종관
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.3
    • /
    • pp.61-68
    • /
    • 1983
  • In this paper various aspects of statistical maltiplexing of data signs have been investigated. A queueing model with finite waiting room and batch poisson arrivals is studied assuming that data signals are transmitted at a constant rate. Using traffic intensity and average burst length as parameters, overflow probabilities and expected queueing delay due to buffering are obtained. Also, a real system model of a statistical multiplexer that can be directly used in micro-programmed hardware realization is proposed. To examine the performance of the system, computer simulation has been done at various conditions. The results obtained can be used in designing a buffer efficiently.

  • PDF

Numerical Simulation of Wave Forces acting on Fixed Offshore Structures Using Hybrid Scheme (하이브리드 기법을 이용한 고정된 해양구조물에 작용하는 파랑하중에 관한 수치 시뮬레이션)

  • Nam, Bo-Woo;Hong, Sa-Young;Kim, Yong-Hwan
    • Journal of Ocean Engineering and Technology
    • /
    • v.24 no.6
    • /
    • pp.16-22
    • /
    • 2010
  • In this paper, the diffraction problems for fixed offshore structures are solved using a hybrid scheme. In this hybrid scheme, potential-based solutions and the Navier-Stokes-based finite volume method (FVM) with a volume-of-fluid (VOF) method are combined. We introduce a buffer zone for efficient wave-making and damping. In this buffer zone, the near field solution from FVM-VOF is gradually changed to Stokes' 2nd order wave solutions. Three different models, including the truncated cylinder, sphere, and wigleyIII model, are numerically investigated in regular waves with a wave steepness of 1/30. The efficiency and accuracy of the hybrid scheme are numerically validated from results using different domain sizes and buffer zones. The wave exciting forces from the FVM-VOF simulations are compared with experiments and potential-based solutions from the higher-order boundary element method (HOBEM). This comparison shows good agreement between the hybrid scheme and potential-based solutions.

A Queueing Model for Performance Analysis of SPAX Inter-Node Communication System (고속병렬컴퓨터1)(SPAX) 노드간 통신시스템의 성능분석을 위한 대기행렬모형)

  • Cho, Il-Yeon;Lee, Jae-Kyung;Kim, Hae-Jin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.1
    • /
    • pp.33-39
    • /
    • 1998
  • A queueing model for performance evaluation of finite buffered inter-node communication system is proposed in this paper. Each components are modeled as M/M/I/B queues to obtain the steady state probabilities and ar-rival rate and to analyze finite buffer behavior, The overall sysrem is integrated as series queues with blocking. Average delay and throughput are the performance measures studied in this analysis. The analytical results are first validated through simulation. Next, the effect of buffer length is discussed using the proposed model.

  • PDF