• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.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.

• Journal of IKEEE
• /
• v.14 no.2
• /
• pp.24-32
• /
• 2010

Slotted-ALOHA and Binary-tree method are researched for the anti-collision for RFID system. However, it is required of the rapid recognition time for all tags and the reduction of the system complexity. In this paper. the hybrid anti-collision method is proposed to solve the problems. The RFID reader with the hybrid anti-collision method groups the tags with the number which makes the maximum system throughput, then it reads each group by slotted-ALOHA method. By the computer simulation results, it is found that the hybrid method improves the tag identification time and the system throughput together with the comparison to other anti-collision methods. Therefore, the proposed hybrid anti-collision method will enhance the RFID system performance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.769-778
• /
• 1997

Assembly/Disassembly Queueing Networks (ADQNs) with finite buffers have been used as a major tool for evaluating the performances of manufacturing and parallel processing systems. In this study, we present simple but effective methods which yield throughput upper and lower bounds for ADQNs with exponential service times and finite buffers. These methods are based on the monotonicity properties of throughputs with respect to service times and buffer capacities. The throughput-upper bounding method is elaborated on with general network configuration (specifically acyclic configuration). But our lower bounding method is restricted to the ADQNs with more specialized configuration. Computational experiments will be performed to confirm the effectiveness of our throughput-bounding methods.

• Journal of Multimedia Information System
• /
• v.3 no.4
• /
• pp.149-154
• /
• 2016

Wireless mesh networks (WMNs) are used for metropolitan area network that requires high network throughput for handling many users. TDMA-based access is a common solution for this problem and several scheduling methods have been proposed. However, existing heuristic methods have room for improvement at network throughput although they are low complexity. In this paper, we propose a novel divided scheduling method based on structural characteristics in order to improve network throughput in WMNs. It separately schedules neighbor links of gateways and that of the other links by different scheduling algorithms. Simulation-based evaluations show that our proposal improves up to 14% of network throughput compared with conventional scheduling algorithm script.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.1
• /
• pp.26-35
• /
• 1995

Bo-Back-N ARQ is widely used in packet networks for error and flow control methanisms. This paper analyzes the network throughput under the go-back-N schem. Contrast to other analytic methods which assume independent frame losses or the first order Markov frame analytic methods which assume independent frame losses or the first order Markov frame losses concoptually, the proposed method takes into account the correlation between successive frame losses in a congested node. Computer simulation shows that our method generates more accurate performance results that independent assumption method. We apply the proposed method to analyze the performance of BWM in high speed networs. Our results show that BWM maintains the independence between traffic streams.

• Bulletin of the Korean Chemical Society
• /
• v.30 no.6
• /
• pp.1325-1330
• /
• 2009

A general method has been developed for the solid phase synthesis of drug-like 7-aryl-benzo[b][1,4]oxazin-3(4H)- one derivatives 6. The method relies on a novel, microwave irradiation promoted cyclization reaction of the BOMBA resin bound, N-substituted-$\alpha$-(2-chloro-4-bromophenoxy)acetamide 3 that takes place via a Smiles rearrangement. The 7-bromobenzo[1,4]oxazine 4, produced in this process is converted to 7-aryloxazin analogs 5 by utilizing Suzuki coupling with various substituted arylboronic acids. Finally, the target 7-aryl-benzo[b][1,4]oxazin-3(4H)-ones 6 are liberated from the resin by treatment with 5% TFA. The progress of the reactions involved in this preparative route can be monitored by using ATR-FTIR spectroscopy on a single bead. The target compounds, obtained by using this five-step sequence, are produced in high yields and purities.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.5
• /
• pp.21-26
• /
• 2012

Intra-session network coding has been proposed to improve throughput by simplifying scheduling of multi-hop wireless network and efficiency of packet transmission. Multi-rate transmission has been used in multihop wireless networks. An opportunistic routing with multirate shows throughput improvement compared with single rate. In this paper, we propose a method of throughput improvement in multi-hop wireless network by using multi-rate and intra-session network coding. We suggest a method to select an local optimal transmission rate at each node. The maximum throughput is evaluated by using linear programming (LP). To solve the LP, we use MATLAB and lp_solve IDE program. The performance evaluation results show that end-to-end throughput is improved by using multirate and intra-session network coding can achieve better throughput than opportunistic routing.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.78-87
• /
• 2009

In the IEEE 802.16 Wireless MAN standard, the best effort service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. In such a MAC scheme, a collision among the requests is unavoidable so that the standard adopted a binary exponential back-off rule to arbitrate a collision. Aiming at improving throughput performance, we present two generic collision arbitration rules based on p-persistence rule, (identified as pristine and metamorphosed rules), as alternatives in a wireless MAN. For each of these rules, we then develop an analytical method to calculate an approximate value of saturated throughput. In comparison with simulation results, we confirm the high accuracy of the analytical method. Also, the pristine and metamorphosed rules are observed to exhibit higher saturated throughput compared with the binary exponential back-off rule.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.51-61
• /
• 2007

For provisioning reliable data transmission, the 3GPP RLC specification adopted a selective-repeat ARQ scheme assisted by a window-based admission control scheme. In the 3GPP ARQ, which is a member of the selective-repeat ARQ clan, inheres the reordering problem A long and irregular reordering time results in the degradation of throughput and delay performance, and may incur the overflow of the reordering buffer. Furthermore, the reordering time must be regulated to meet the requirements of some services which are loss-sensitive and delay-sensitive as well. Perceiving the reordering hazard, we propose an alternative, identified as snowball scheme, to the original admission control scheme of the 3GPP ARQ with aiming at deflating the occupancy of the reordering buffer. A unique feature of the snowball scheme is to reject a new DATA PDU if it is non-adjacent to any DATA PDU sojourning at the reordering buffer. Such an intentional rejection apparently reduces the occupancy of the reordering buffer while it may deteriorate the throughput and delay performance. Developing an analytical approximation method, we investigate the effect of snowball scheme on the saturated occupancy and throughput. Also, we, using a simulation method, evaluate the peak occupancy, normalized throughput and average delay in the practical environment. From the simulation results, we reveal that the snowball scheme is able to enhance occupancy performance as well as throughput performance compared with the original admission control scheme of the 3GPP ARQ.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.547-552
• /
• 2007

IEEE ratified IEEE802.3ah as the standard of E-PON, while it leaved the specific method of upstream bandwidth allocation as a role of implementation vendors. Many experts have researched the method of enhancing upstream bandwidth throughput and released related papers. This paper presents another novel mechanism to enhance upstream throughput. This mechanism performs the management of upstream queues by giving the minimum bandwidth of different level to each queue. In order to process packets on each queue we adopted a modified weighted DRR technology. By doing so, the transmission throughput of upstream packets can be largely enhanced. The experimental simulation of this mechanism showed an enhancement of bandwidth utilization more than 10% in comparison to legacy method.