• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.801-805
• /
• 1992

Due to the inherent complexity in the CIM operation, achieving the triple, meeting duedates, maximizing machine utilization, and maximizing system throughput simultaneously is practically impossible. Targeting the small-to-medium size industries of Korea, we propose an exrert system that 'provides a good and practical solution to the CIM operation problems. Heavy consideration has given to the real-time and dynamic nature of CIM in the development process of the system. The system is under testing stage at KU-FMS, model CIM plant.

• International Journal of Computer Science & Network Security
• /
• v.22 no.2
• /
• pp.357-361
• /
• 2022

Employing the available technologies and utilizing the advanced means to improve the level of health care provided to citizens in their various locations. Citizens have the right to get a proper health care services despite the location of their residency or the distance from the health care delivery centers, a goal that can be achieved by utilizing air ambulance systems. In such systems, aircrafts and their life spans are the essential component, the flight duration of the aircraft during its life span is determined by the maintenance schedule. This research, enhances the air ambulance systems by presenting a proposal that maximizes the aircraft flight duration during its life span. The enhancement will be reached by developing a set of algorithms that handles the aircraft maintenance problem. The objective of these algorithms is to minimize the maximum completion time of all maintenance tasks, thus increasing the aircraft operation time. Practical experiments performed to these algorithms showed the ability of these algorithms to achieve the desired goal. The developed algorithms will manage the maintenance scheduling problem to maximize the uptime of the air ambulance which can be achieved by maximizing the minimum life of spare parts. The developed algorithms showed good performance measures during experimental tests. The 3LSL algorithm showed a higher performance compared to other algorithms during all performed experiments.

• Journal of the Korea Safety Management & Science
• /
• v.6 no.4
• /
• pp.215-226
• /
• 2004

This study develops a improved gate assignment algorithm and decision support system using its algorithm to extract a assignment result minimizing a walking distance of passengers in airport and maximizing the utilization rate of avaliable gates in domestic airports. By operation support system, it may contribute greatly in efficient enlargement of airport operation and increase the airport reliability through quickly coping with takeoff and landing delay of flight due to weather change, preservation and repair of gate, etc. Also, passengers who use airport terminal can minimize time and walking distance for departure, arrival, and transit, and it may greatly reduce the additional operation cost for common gates through maximizing the utilization rate for exclusive usage gates for airplanes which use gates.

• Proceedings of the Safety Management and Science Conference
• /
• 2004.11a
• /
• pp.221-227
• /
• 2004

This study develops a improved gate assignment algorithm and decision support system using its algorithm to extract a assignment result minimizing a walking distance of passengers in airport and maximizing the utilization rate of avaliable gates in domestic airports. By operation support system, it may contribute greatly in efficient enlargement of airport operation and increase the airport reliability through quickly coping with takeoff and landing delay of flight due to weather change, preservation and repair of gate, etc. Also, passengers who use airport terminal can minimize time and walking distance for departure, arrival, and transit, and it may greatly reduce the additional operation cost for common gates through maximizing the utilization rate for exclusive usage gates for airplanes which use gates.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.4
• /
• pp.997-1005
• /
• 2003

In this paper, the problem of determining optimal burn-in time is considered under a general failure model. There are two types of failure in the general failure model. One is Type I failure (minor failure) which can be removed by a minimal repair and the other is Type II failure (catastrophic failure) which can be removed only by a complete repair. In this model, when the unit fails at its age t, Type I failure occurs with probability 1 - p(t) and Type II failure occurs with probability p(t), $0{\leq}p(t)\leq1$. Under the model, the properties of optimal burn-in time maximizing mean time to the catastrophic failure during field operation are obtained. The obtained results are also applied to some illustrative examples.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.4
• /
• pp.294-303
• /
• 2023

During wartime, the operation of engineering equipment plays a pivotal role in bolstering the combat prowess of military units. To fully harness this combat potential, it is imperative to provide efficient support precisely when and where it is needed most. While previous research has predominantly focused on optimizing equipment combinations to expedite individual mission performance, our model considers routing challenges encompassing multiple missions and temporal constraints. We implement a comprehensive analysis of potential wartime missions and developed a routing model for the operation of engineering equipment that takes into account multiple missions and their respective time windows of required start and completion time. Our approach focused on two primary objectives: maximizing overall capability and minimizing mission duration, all while adhering to a diverse set of constraints, including mission requirements, equipment availability, geographical locations, and time constraints.

• Proceedings of the KIPE Conference
• /
• 2000.07a
• /
• pp.725-728
• /
• 2000

This paper presents the switching angle and voltage for maximizing torque of 4-phase 6-poles SRM. The switching angle and voltages was determined through the approximated analysis and computer simulation by using SIMULINK according to the speed and torque required by load but we used new analytic equation from maximum torque characteristic And then one-chp micro-controller controls the switching angle and voltage of an asymmetrical inverter in the SRM driver. Also we expects that this method reduce micro-controller load and realize approximated real time control

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.17 no.31
• /
• pp.21-31
• /
• 1994

In this research, tool allocation methods are studied in conjunction with loading and muting in FMSs. The objective function is to minimize production time while maximizing machine utilization of the FMS with several constraints. The proposed method has 2 steps. The first step is to determine tool allocation type with the proposed tool allocation method. The second step is to design loading models with routing. The effectiveness of the proposed FMS operation procedure is shown through numerical examples.

• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.33-38
• /
• 2014

This paper investigates the shaping operation problem introduced by Callahan et al., namely the k-fragility maximization problem (k-FMP), whose goal is to find a subset of personals within a terrorist group such that the regeneration capability of the residual group without the personals is minimized. To improve the impact of the shaping operation, the degree centrality of the residual graph needs to be maximized. In this paper, we propose a new greedy algorithm for k-FMP. We discover some interesting discrete properties and use this to design a more thorough greedy algorithm for k-FMP. Our simulation result shows that the proposed algorithm outperforms Callahan et al.'s algorithm in terms of maximizing degree centrality. While our algorithm incurs higher running time (factor of k), given that the applications of the problem is expected to allow sufficient amount of time for thorough computation and k is expected to be much smaller than the size of input graph in reality, our algorithm has a better merit in practice.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5307-5327
• /
• 2016

Restricted by finite battery energy, traditional wireless sensor networks (WSNs) can only maintain for a limited period of time, resulting in serious performance bottleneck in long-term deployment of WSN. Fortunately, the advancement in the wireless energy transfer technology provides a potential to free WSNs from limited energy supply and remain perpetual operational. A mobile charger called wireless charging vehicle (WCV) is employed to periodically charge each sensor node and keep its energy level above the minimum threshold. Aiming at maximizing the ratio of the WCV's vocation time over the cycle time as well as guaranteeing the perpetual operation of networks, we propose a feasible and optimal solution to this issue within the context of a real-time large-scale deployed WSN. First, we develop two different types of charging cycles: initialization cycles and renewable cycles and give relevant algorithms to construct these two cycles for each sensor node. We then formulate the optimization problem into an optimal construction algorithm and prove its correctness through theoretical analysis. Finally, we conduct extensive simulations to demonstrate the effectiveness of our proposed algorithms.