• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.83-101
• /
• 1998

Assembly U-lines are increasingly accepted in industry, especially just-in-time production systems, for the efficient utilization of workforce. In this paper, we present an integer programming formulation and a branch-and-bound method for balancing the U-line with the objective of minimizing the number of workstations with a fixed cycle time. In the mathematical model, we provide the method that can reduce the number of variables and constraints. The proposed branch-and-bound method searches the optimal solution based on a depth-first-search. To efficiently search for the optimal solutions to the problems, an assignment rule is used in the method. Bounding strategies and dominance rules are also utilized. Some problems require a large amount of computation time to find the optimal solutions. For this reason. some heuristic fathoming rules are also proposed. Extensive experiments with test-bed problems in the literature are carried out to show the performance of the proposed method. The computational results show that our method is promising in solution quality.

• Journal of Drive and Control
• /
• v.11 no.4
• /
• pp.32-38
• /
• 2014

The hydraulic fuse, which responds to the suddenly increased flow on rupture of a line and shuts off the fluid flow, would prevent large spillage of liquid. The quick-acting hydraulic fuse, which is mainly composed of a poppet, a seat, and a spring, must be designed to minimize the leaked flow and to prevent high collision speed between the poppet and seat during fuse operation on a line rupture. The optimal design parameters of a quick-acting hydraulic fuse were searched using the genetic algorithm and the complex method that are kinds of constrained direct search methods. The dynamic behavior of a quick-acting hydraulic fuse was researched using computer simulations that applied the obtained optimal design parameters.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.12 no.19
• /
• pp.73-78
• /
• 1989

This paper concerns the production model that the Automatic Guided Vehicles(AGVs) is used as transporters in assembly line. The model suggests that assembly parts may inter the beginning of the line in multiple units instead entering one unit at a time. Costs are occured in proportion to the number of vehicle on the line and job flow time. Here, the objective of this model is to determine the number of vehicle to minimize the total cost for M products production. Theoretical results are proved which lead to the development of algorithm for solution search. The solution search procedure is illustrated by a numerical example.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.377-384
• /
• 2004

The field based morphing requires the user to set most of the control lines manually which requires much time and skill to get satisfactory results. This thesis proposes a method to acquire semi-automation of image morphing through first acquiring shape information from the source image and the target image, then after the user manually designates the least amount of a pair of feature points, these are used as standards for polygon based vertex search to set the appropriate control line to the source mage and target image, and then using the ratio of control line lengths and space. Using the proposed method, the user can reduce the time setting the control line and unskilled persons can get natural image morphing results while designating the least amount control line.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.2
• /
• pp.73-90
• /
• 2010

Recently, Tan et al. introduced a serverless search protocol in which a mobile reader maintains a tag authentication list and authenticates a tag using the list without connecting authentication server. A serverless RFID system is different from general RFID systems which use on-line server models. In the serverless RFID system, since the mobility of a personalized reader must be considered, we have to protect not only the privacy of a tag but also the privacy of a mobile reader. In this paper, we define new security requirements for serverless RFID search system and propose a secure serverless RFID search system. In our system, since tag authentication information maintained by a reader is updated in every session, we can provide the backward untraceability of a mobile reader. Also we use an encrypted timestamp to block a replay attack which is major weakness of search protocols. In addition, we define a new adversary model to analyze a serverless RFID search system and prove the security of our proposed system using the model.

• The Journal of the Korea Contents Association
• /
• v.21 no.2
• /
• pp.301-314
• /
• 2021

Youth unemployment is a global social issue which leads to a waste of human resources and undermines the national economy. Job search self-efficacy (JSSE) can predict active job search and job search outcomes. The present study identified the factors affecting the JSSE of unemployed youth based on the Neuman Systems Model (NSM). The results indicated that job search period, job search stress, and problem-centred coping ability influenced young job seekers' JSSE, which increased especially with the perception of physical health. Therefore, to promote JSSE, it is necessary to not only establish social systems for the youth but also develop an intervention plan based on the NSM that optimises problem-centred coping ability, a normal line of defence in the individual's system, and maintains a healthy physical state, a line of resistance.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.366-369
• /
• 1991

Load shedding algorithm has been developed using heuristic search and D.C flow method. The line flow error with a D.C method was improved in this paper. Minimization of load shedding was obtained with heuristic search method. Although analytical method have been mixed with expert algorithm the C language fitted well for this purpose.

• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.13-27
• /
• 1996

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• Proceedings of the Safety Management and Science Conference
• /
• 2008.11a
• /
• pp.35-39
• /
• 2008

This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.4
• /
• pp.381-388
• /
• 1997

This paper proposes a heuristic algorithm to efficiently perform line balancing in the PCB assembly line including multiple surface mounters efficiently. Generally, the problems in line balancing are classified into two kinds. Firstly, is the determining of the minimum number of machines required for achieving the desired production rate. Secondly, is the assign of jobs to multiple machines in order to minimize the cycle time which is defined as a maximum among the working times of machines when the number of machines is fixed. In this paper, we deal with the latter. We consider a PCB assembly line, including the multiple surface mounters arranged serially as a target system. Also, the conveyor is assumed to move at a constant speed and have no buffer. Considering that the minimum number of machines required for the desired production rate is a discrete nonincreasing function which is inversely proportional to the cycle time, we propose an optimization algorithm for line balancing by using the binary search method. The algorithm is validated through computer simulation, the results of which show that their shapes coincide nearly with those of optimal line balancing efficiency graphs regardless of the number of components, the performance of surface mounters, and the structure of assembly line.