• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.3
• /
• pp.78-89
• /
• 2022

The purpose of this study was to propose useful suggestion by analyzing preventive replacement policy under which there are minor and major failure. Here, major failure is defined as the failure of system which causes the system to stop working, however, the minor failure is defined as the situation in which the system is working but there exists inconvenience for the user to experience the degradation of performance. For this purpose, we formulated an expected cost rate as a function of periodic replacement time and the number of system update cycles. Then, using the probability and differentiation theory, we analyzed the cost rate function to find the optimal points for periodic replacement time and the number of system update cycles. Also, we present a numerical example to show how to apply our model to the real and practical situation in which even under the minor failure, the user of system is not willing to replace or repair the system immediately, instead he/she is willing to defer the repair or replacement until the periodic or preventive replacement time. Optimal preventive replacement timing using two variables, which are periodic replacement time and the number of system update cycles, is provided and the effects of those variables on the cost are analyzed.

• Journal of Navigation and Port Research
• /
• v.40 no.6
• /
• pp.421-430
• /
• 2016

In this study, a gate simulation model was developed to reduce the truck waiting time for trucking companies servicing container terminals. To verify the developed model, 4 weeks of truck gate-in/gate-out data was collected in December 2014 at the Port of Busan New Port. Also, the existing gate system was compared to the proposed gate system using the developed simulation model. The result showed that based on East gate-in, a maximum number of 50 waiting trucks with a maximum waiting time of 120 minutes. With the proposed system the maximum number of waiting trucks was 10 with a maximum waiting time of 5.3 minutes. Based on West gate-in, the maximum number of waiting trucks was 17 and the maximum waiting time was 34 minutes in the existing gate system. With the proposed system the maximum number of waiting trucks was 10 with a maximum waiting time of 5.3 minutes. Based on West gate-out, the maximum number of waiting trucks was 11 with a maximum waiting time of 5.5 minutes. With the proposed system the maximum number of waiting trucks was 9 with a maximum waiting time of 4.4 minutes. This developed model shows how many waiting trucks there are, depending on the gate-in/gate-out time of each truck. This system can be used to find optimal gate system operating standards by assuming and adjusting the gate-in/gate-out time of each truck in different situations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.879-888
• /
• 2000

In this paper, the performance of IS-95B CDMA system adopting multi-code scheme for data service on the forward link is obtained by theoretical analysis and computer simulation. The wireless channel is assumed to include AWGN, MUI(Multi-User Interference), and MPI(Multi-Path Interference), and multipath Rayleigh fading modeled by TDL(Tapped Delay Line). To obtain actual performance, IS-95B system using PN codes(M-sequence) concatenated with Walsh codes is considered. The BER performance of voice/data service satisfying QoS requirement and the maximum capacity of voice users is derived in terms of various system parameters(voice activity factor, required SNR of voice/data users, the number of multi-codes, the number of voice/data users.,etc.). As a result, under the condition that the maximum allowable number of voice user is 38 in voice only system, as the number of multi-code is decreased by 1, the maximum allowable number of voice user is increased by 5% for system with 1 data user and 22.3% for system with 4 data users. Therefore, it is possible to increase maximum allowable number of users in IS-95B CDMA system by appropriate control of the number of multi-codes and required SNR according to channel environment and traffic characteristic.

• Journal of Korean Society for Quality Management
• /
• v.28 no.3
• /
• pp.11-17
• /
• 2000

This paper presents a model for determining the optimal number of general repairs and supplementary input cost limit rate in addition to minimal repair cost rate to implement preventive maintenance. The basic concept parallels the periodic replacement model with minimal repair at failure introduced by Barlow and Hunter(1960) and Park(1979), only difference being the replacement signalled by the number of previous general repairs performed on the system. A general repair brings the state of the system to a certain better state than before repaired. Numerical examples are provided.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1101-1103
• /
• 2006

For a broad class of discrete-time FIFO queueing systems with D-MAP (discrete-time Markovian arrival process) arrivals, we present a distributional Little's law that relates the distribution of the stationary number of customers in system (queue) with that of the stationary number of slots a customer spends in system (queue). Taking the multi-server D-MAP/D/c queue for example, we illustrate how to utilize this relation to get the desired distribution of the number of customers.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.2
• /
• pp.49-58
• /
• 1996

The generalized Erlang loss function, extensively studied in the literature, is revisited. We study the steady state loss probability in M/M/s/s + c queueing system and prove that it satisfies the first and second order properties in integral number of servers as well as integral queue capacities. Also we study the problem of allocating integral number of servers and queue capacities, and develop an algorithm to obtian an optimal allocation of them individually and jointly with the small number of computations.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.662-665
• /
• 1988

This paper proposes the Minimum-Distance Classification(MDC) processor using the Residue Number System(RNS). The proposed MDC Processor in this paper is efficient for real-time pattern clustering application and illustrate satisfiable error rate in application experiments of image segmentation but error rate increase as cluster number do.

• Journal of Korean Society for Quality Management
• /
• v.13 no.2
• /
• pp.21-28
• /
• 1985

The purpose of this study is to analyze the direct relationship between doctors and number of patients to be treated by applying many kinds of IE techniques. Generally, doctors in this research work both at Out Patient Data & In Patient Data. Under the hospital management system that they are applying in, doctor's daily working schedules are instable because the number of OPD patients daily. Therefore, the amount of time they spend for inward patients are variable too. So the numbers of patients have great influence to the whole hospital system management.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.05a
• /
• pp.571-576
• /
• 2001

Hydroforming, the new production technology, has been used to manufacture many parts of vehicle in the recent auto industry. When Hydroforming is applied, it is possible to make parts simplification and flexible alteration of section shape in many advantages such as weight reduction, number of parts reduction or performance improvement. This research into shape optimization which reduces number of parts and weight maintaining performance was achieved. In this paper, the COWL CROSS BAA and MT'g BAKT parts of A car STEERING support SYSTEM was introduced by using Hydroforming.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2006.06a
• /
• pp.303-310
• /
• 2006

The sorting algorithms have been developed to take advantage of distributed computers. But the speedup of parallel sorting algorithms decrease rapidly with increased number of processors due to parallel processing overhead such as context switching time and inter-processor communication cost. In this paper, we propose a parallel sorting method which provides linear speedup of an optimal serial algorithm for a system with a large number of processors. This algorithm may even provide superlinear speedup for a practical system. The algorithm takes advantage of an interconnection network properties and its protocol.