• 대한전자공학회논문지TC
• /
• 제44권5호
• /
• pp.33-39
• /
• 2007

본 논문은 cognitive radio (CR) 기능을 갖는 무선 멀티홉 릴레이 네트워크의 throughput 용량에 대한 연구 결과이다. 본 논문에서는 TDMA/FDMA에 기반한 프레임 구조를 갖는 릴레이가 기지국과 통신할 때 CR 기술을 이용하여 현재 사용되고 있지 않는 주파수 자원을 측정하여 동적으로 이용하는 시스템을 제안하고 이의 throughput 용량 모델을 제안 하였다. 특히, 본 논문에서는 Utilization factor를 이용하여 제안된 시스템을 위한 throughput 용량 모델을 제안하였다. 해석 모델링 결과 본 논문에서 제안한 CR 기반 멀티홉 릴레이 시스템은 throughput 용량을 매우 향상하는 결과를 보였다.

• 대한산업공학회지
• /
• 제32권2호
• /
• pp.104-110
• /
• 2006

When a new facility such as automobile assembly line is designed, computer simulation is often used to estimate its actual throughput level. If it falls short of the target throughput level, then the design must be modified to increase the throughput capacity. For complex facilities having parallel processes and network of material flows, the modification procedure is not trivial. Even if the capacity of a particular bottleneck process is increased, the target throughput may not be achieved because the bottleneck may move to another process. Furthermore, each process has a different set of options with different cost to increase the capacity. In this study, we present a systematic procedure of determining the cost-effective set of options which achieves the target throughput.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.97-98
• /
• 2007

In this paper, we investigate the throughput capacity of a multi-hop relay network with cognitive radio (CR) enabled relay stations (RS). We suggested a TDMA/FDMA based frame structure where RSs dynamically select unused channels to communicate with the base station (BS) using CR techniques to analyze the throughput capacity. We developed the throughput capacity model for the proposed system based on utilization factor. The analytical results based on those equations show significant improvement in throughput capacity for CR enabled multi-hop relay system.

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.230-245
• /
• 2002

Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

• 경영과학
• /
• 제17권1호
• /
• pp.17-30
• /
• 2000

This paper addresses the effect of protective capacity on the lead time and throughput of a re-entrant line where statistical fluctuations exist in the form of variation in processing times and machine breakdowns. The specific framework employed in the paper is a five station re-entrant line structured as a closed network mode. This paper argues that protective capacity can be used in conjunction with WIP inventory in order to reduce the lead time and to increase the increase the throughput of a line. Simulation analyses are included to give insight into the effectiveness of protective capacity.

• 한국항공운항학회지
• /
• 제31권4호
• /
• pp.7-18
• /
• 2023

The continuous increase in air traffic emphasizes the importance of capacity calculation. Research on the calculation method of Terminal Control Area (TMA) capacity has been treated as a partial aspect of the airspace sector capacity or has been limitedly studied. This study aims to propose a mathematical model for calculating TMA capacity, taking into account the Standard Terminal Arrival Route (STAR), separation standards, TMA entry speed, and runway threshold passing speed. The proposed model has the advantage of being able to calculate the instantaneous arrival capacity, which has not been noted in previous studies, along with the throughput. Additionally, it is meaningful as the model can easily calculate the arrival capacity of the TMA considering airport construction, runway expansion, or new procedures.

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

• 경영과학
• /
• 제11권1호
• /
• pp.39-50
• /
• 1994

Carousel systems can be classified into unidirectional and bidirectional carousel, depending on the hardware structure. Bidirectional carousels again can be classified into reversible and irreversible carousel, depending on whether the reversal of direction is allowed or not during the process of an order. In this study, single carousel served by one operator is considered. Analytical models for the rotation distance to process an order of size are developed for unidirectional and irreversible bidirectional cases. For reversible bidirectional and Nearest Neighbor Heuristic cases, simulation results of the average rotation distance are presented. Since the throughput capacity of carousel systems also depends upon the picking time of the operator; order size; and the rotation speed of carousel, the model considers the above three factors to express the throughput capacity of single carousel systems.

• 전기학회논문지
• /
• 제60권12호
• /
• pp.2254-2259
• /
• 2011

The introduction of Personal Rapid Transit (PRT) has been widely discussed in the Korean transportation research field. However, there is no robust criterion to derive the throughput of cars and passengers at PRT stations, which plays a primary role in determining the overall capacity of PRT systems. The present study provided a methodology to rigorously compute the capacity for simple-serial PRT stations with a single platform, considering three decisive factors, i.e., the demand level of incoming cars and outgoing passengers, the station structure, and the operation strategy. A micro-level simulator was developed for the analysis of station capacity. And, by using this, station capacities were presented for various combinations of the decisive factors. In particular, the relationship between capacity and station structure was investigated in detail. Station structure is represented by the numbers of platform berths, input queue berths, and output queue berths. Moreover, both waive rate and waiting time, which represent the level of passenger service, were taken into account when the station throughput was computed.

• 대한산업공학회지
• /
• 제33권2호
• /
• pp.246-253
• /
• 2007

All of the machines in a production line can be classified into bottleneck and non-bottleneck machines. A bottleneck is a resource whose capacity limits the throughput of the whole production facility. This paper addresses a batch sizing problem at the bottleneck machine. Traditionally, most batch sizing decisions have been made based on the EOQ (economic order quantity) model where setup and inventory costs are considered while throughput rate is assumed to be given. However, since batch size affects the capacity of the bottleneck machine, the throughput rate may not be constant. As the batch size increases, the frequency of the setup decreases. The saved setup time can be transferred to processing time, which results in higher throughput. But, the larger batch size may also result in longer lead time and larger WIP inventory level. This paper presents an alternative method to determine batch size at the bottleneck machine in a manufacturing line. A linear search algorithm is introduced to find optimal throughput rate and batch size at the same time. Numerical examples are provided to see how the proposed method works and to investigate the effects of some parameters.