• 한국경영과학회지
• /
• 제30권1호
• /
• pp.149-159
• /
• 2005

In this study, we consider characteristics of stationary waiting times in single-server 2-node tandem queues with a finite buffer, a Poisson arrival process and deterministic service times. The system has two buffers: one at the first node is infinite and the other one at the second node is finite. We show that the sojourn time or departure process does not depend on the capacity of the finite buffer and on the order of nodes (service times), which are the same as the previous results. Furthermore, the explicit expressions of waiting times at the first node are given as a function of the capacity of the finite buffer and we are able to disclose a relationship of waiting times between under communication blocking and under manufacturing blocking. Some numerical examples are also given.

• 산업공학
• /
• 제15권3호
• /
• pp.316-324
• /
• 2002

Automated Guided Vehicles are widely used as an essential material handling system for FMS to provide flexibility and efficiency. We suggest a new dispatching rule based on priority function which considers urgency and empty vehicle travel time under finite buffer capacity. We evaluate the performance of the proposed rule by comparing the performance of Shortest Travel Time/Distance(STT/D) rule in terms of machine utilization, throughput and WIP level using simulation. The simulation results show that the suggested dispatching rule is robust and provides better machine utilization, throughput with comparable WIP level compared to STT/D rule.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.407-410
• /
• 1997

This paper analytically derives the variance of service time of a station in the symmetric IEEE 802.4 token bus network with single access class and finite buffer capacity. This performance measure is represented in terms of the total number of stations, the token hold time, the arrival rate of frames, the service rate, and other parameters. Using computer simulations, presented performance measure is validated.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.185-191
• /
• 2015

This paper considers a discrete-time buffer system with session-based arrivals, an infinite storage capacity and one unreliable output line. There are multiple different types of sessions and the output line is governed by a finite state Markov chain. Based on a generating functions approach, we obtain an exact expression for the mean buffer content.

• 반도체디스플레이기술학회지
• /
• 제19권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.

• 한국시뮬레이션학회논문지
• /
• 제17권4호
• /
• pp.241-247
• /
• 2008

본 연구에서는 하나의 포아송 도착과정(Poisson Arrival Process)과 상수(constant) 서비스 시간을 갖는 유한 버퍼(finite buffer) 대기행렬을 분석 대상으로 한다. 유한 버퍼로 인한 차단현상으로 도착하는 고객이 시스템에 진입하지 못하고 시스템을 떠나게 된다. 이러한 M/D/1/K 대기행렬에서 차단확률(blocking probability)의 계산방법은 이미 연구되어있지만, 계산과정이 매우 복잡하다. 본 연구에서는(max,+)-대수를 이용하여 차단확률을 도출하는 새로운 방법을 제안하고자 한다. 제안된 방법은 기존 연구결과보다 쉽게 차단확률을 계산할 수 있을 뿐만 아니라 보다 복잡한 대기행렬 망에서의 차단확률을 구하는데도 응용 될 수 있을 것이다.

• 대한수학회지
• /
• 제32권2호
• /
• pp.211-236
• /
• 1995

The purpose of this paper is to provide a transient diffusion approximation of queue size distribution for M/G/m/N system. The M/G/m/N system can be expressed as follows. The interarrival times of customers are exponential and the service times of customers have general distribution. The system can hold at most a total of N customers (including the customers in service) and any further arriving customers will be refused entry to the system and will depart immediately without service. The queueing system with finite capacity is more practical model than queueing system with infinite capacity. For example, in the design of a computer system one of the important problems is how much capacity is required for a buffer memory. It its capacity is too little, then overflow of customers (jobs) occurs frequently in heavy traffic and the performance of system deteriorates rapidly. On the other hand, if its capacity is too large, then most buffer memories remain unused.

• ETRI Journal
• /
• 제36권4호
• /
• pp.609-616
• /
• 2014

Even though many computational methods (recursive formulae) for blocking probabilities in finite-capacity M/D/1 queues have already been produced, these are forms of transforms or are limited to single-node queues. Using a distinctly different approach from the usual queueing theory, this study introduces explicit (transform-free) formulae for a blocking probability, a stationary probability, and mean sojourn time under either production or communication blocking policy. Additionally, the smallest buffer capacity subject to a given blocking probability can be determined numerically from these formulae. With proper selection of the overall offered load ${\rho}$, the approach described herein can be applicable to more general queues from a computational point of view if the explicit expressions of random vector $D_n$ are available.

• 산업공학
• /
• 제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.

• 한국시뮬레이션학회논문지
• /
• 제19권3호
• /
• pp.109-117
• /
• 2010

본 연구에서는 3개의 단일서버 노드(기계 1, 기계 2, 조립기계)로 구성된 단순 조립형 대기행렬 망의 안정대기시간에 대해 분석한다. 하나의 재생도착과정을 가정하며, 각 기계의 서비스시간은 서로 독립이며 상수 또는 겹침이 없는 시간으로 가정한다. 기계 1과 기계 2는 무한크기의 버퍼를 가지며, 조립기계는 각 기계로부터의 이송되는 부품을 위해 2개의 유한버퍼를 가진다. 각 기계는 FIFO 규칙과 통신차단규칙에 따라 서비스를 제공한다. 단순 조립형 대기행렬 망의 안정대기시간에 대한 간결한 표현식을 (max,+)-대수를 활용하여 유한버퍼의 크기에 대한 함수의 형태로 도출하였다. 이러한 표현식으로부터 평균, 고차평균, 꼬리확률과 같은 다양한 성능 특성치들의 값을 구할 수 있다.