• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.6
• /
• pp.90-101
• /
• 1996

Determination of assembly sequence of components is a key issue in assembly operation. Although a number of articles dealing with assembly sequence determination have appeared, an efficient and general methodology for complex products has yet to appear. The objective of this paper is to present the problems and models used to generate assembly sequence from design data. An essential idea of this research is to acquire a finite number of voxels from any complex geometric entity, such as 3D planar polygons, hollow spheres, cylinders. cones, tori, etc. In order to find a feasible assembly sequence, the following four steps are needed: (1) The components composing of an assembly product are identified and then the geometric entities of each component are extracted. (2) The geometric entities extracted in the first step are translated into a number of voxels. (3) All the mating or coupling relations between components are found by considering relations between voxels. (4) The components to be disassembled are determined using CCGs (Component Coupling Graph).

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.3
• /
• pp.264-273
• /
• 2002

This paper focuses on disassembly sequencing, which is the problem of determining the optimum disassembly level and the corresponding disassembly sequence for a product at its end-of-life with the objective of maximizing the overall profit. In particular, sequence-dependent operation times, which frequently occur in practice due to tool-changeover, part reorientation, etc, are considered in the parallel disassembly environment. To represent the problem, a modified directed graph of assembly states is suggested as an extension of the existing extended process graph. Based on the directed graph, the problem is transformed into the shortest path problem and formulated as a linear programming model that can be solved straightforwardly with standard techniques. A case study on a photocopier was done and the results are reported.

• IE interfaces
• /
• v.18 no.2
• /
• pp.136-147
• /
• 2005

This paper introduces a simulation study regarding the operation of the Painted Body Storage (PBS) in an automobile factory. In the paint shop of the factory, same colored bodies are grouped together in order to increase the effectiveness of process, for example decrease the loss of cleaning the painting-gun when the color of body changes from one to another. However the production of automobiles in the assembly shop is a typical example of the mixed model assembly production. Therefore PBS locates between the paint shop and the assembly shop for control the input sequence of bodies to the assembly shop, and it enables to meet the smoothing requirement of assembly sequence. There are highly restricted constraints on the assembly sequence in a assembly shop. Those are spacing restriction and smoothing restriction. If such restrictions are violated, conveyor-stop or utility work will be necessary. Thus the major objective of PBS is to control the assembly sequence in a way to meet the two restrictions. In this paper a case study of PBS in an automotive factory is introduced. The storage/retrieval algorithms are suggested and the proposed system is verified using simulation models. Sensitivity analysis for operating factors is also conducted.

• IE interfaces
• /
• v.14 no.3
• /
• pp.247-254
• /
• 2001

As current postal automation is limited to dispatch and arrival sorting, delivery sequence sorting is performed manually by each postman. It not only acts as a bottleneck process in the overall mailing process but is expensive operation. To cope with this problem effectively, delivery sequence sorting automation is required. The important components of delivery sequence sorting automation system are sequence sorter and Hangul OCR which function is to extract the address of delivery point. DSI database will be interfaced to both Hangul OCR and sequence sorter for finding the accurate delivery sequence number and stacker number. The objectives of this research are to develop DSI(Delivery Sequence Information) database prototype and client application for managing information effectively. For database requirements collection and analysis, we draw all possible sorting plans, and apply the AHP(Analytic Hierarchy Process) method to determine the optimal one. And then, we design DSI database schema based on the optimal one and implement it using Oracle RDBMS. In addition, as address information in DIS database consist of hierarchical structure which has its correspondence sequence number, so it is important to reorganize sequence information accurately when address information is inserted, deleted or updated. To increase delivery accuracy, we reflect this point in writing application.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.12
• /
• pp.1554-1563
• /
• 1999

This paper presents the design of high speed processor for a sequence logic control using field programmable gate array(FPGA). The sequence logic controller is widely used for automating a variety of industrial plants. The FPGA designed by VHDL consists of program and data memory interface block, input and output block, instruction fetch and decoder block, register and ALU block, program counter block, debug control block respectively. Dedicated clock inputs in the FPGA were used for high speed execution, and also the program memory was separated from the data memory for high speed execution of the sequence instructions at 40 MHz clock. Therefore it was possible that sequence instructions could be operated at the same time during the instruction fetch cycle. In order to reduce the instruction decoding time and the interface time of the data memory interface, an instruction code size was implemented by 16 bits or 32 bits respectively. And the real time debug operation was implemented for easy debugging the designed processor. This FPGA was synthesized by pASIC 2 SpDE and Synplify-Lite synthesis tool of Quick Logic company. The final simulation for worst cases was successfully performed under a Verilog HDL simulation environment. And the FPGA programmed for an 84 pin PLCC package was applied to sequence control system with inputs and outputs of 256 points. The designed processor for the sequence logic was compared with the control system using the DSP(TM320C32-40MHz) and conventional PLC system. The designed processor for the sequence logic showed good performance.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.12
• /
• pp.224-232
• /
• 2009

Power plant start-up is a complicate process involving hundreds of operations that should be performed either automatically or manually. Several major operations should be proceeded in parallel and each major operation is again broken down into detailed operations that must be carried out in a strict sequence. Even though most of the operations are automated, still substantial portions of the operations are carried out manually and the operational status should be monitored by the crew members, which are quite stressful tasks to be performed in real time. In this paper, a data structure called an Event Sequence Monitoring Graph(ESMG) is proposed for monitoring a sequence of events involved in the power plant start-up process. The ESMG is currently being applied to a thermal power plant with a rated output of 500MW. An application example is shown with the boiler feed water pump system start-up process, which exhibits a good potential for future applications.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.5 s.98
• /
• pp.29-39
• /
• 1999

Many industrial products can be assembled in various sequences of assembly operations. To save time and cost in assembly process and to increase the quality of products, it is very important to choose an optimal assembly sequence. In this paper, we propose a methodology that generates an optimal assembly sequence by using the knowledge of experts. First, a product is divided into several sub-assemblies. Next, the disassembly sequences of sub-assembly are generated using disassembly rules and special information can be extracted through the disassembly process. By combining every assembly sequence of sub-assemblies, we can generate all the possible assembly sequences of a product. Finally, the expert system evaluates all the possible assembly sequences and finds an optimal assembly sequence. It can be achieved under consideration of the parameters such as assembly operation, tool change, safety of part. basepart location, setup change, distance, and orientation. The developed system is applied to UBR(Unit Bath Room) example.

• Nuclear Engineering and Technology
• /
• v.46 no.5
• /
• pp.667-674
• /
• 2014

One of the largest problems for tokamak devices such as Kazakhstan Tokamak for Material Testing (KTM) is the operation scenarios' development and execution. Operation scenarios may be varied often, so a convenient hardware and software solution is required for scenario management and execution. Dozens of diagnostic and control subsystems with numerous configuration settings may be used in an experiment, so it is required to automate the subsystem configuration process to coordinate changes of the related settings and to prevent errors. Most of the diagnostic and control subsystems software at KTM was unified using an extra software layer, describing the hardware abstraction interface. The experiment sequence was described using a command language. The whole infrastructure was brought together by a universal communication protocol supporting various media, including Ethernet and serial links. The operation sequence execution infrastructure was used at KTM to carry out plasma experiments.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.4
• /
• pp.830-837
• /
• 2011

A turbine control system which has been operated for years in a nuclear power plant was retrofitted with a newly developed digital control system. After completion of the retrofit, turbine valve tests were performed to ensure the integrity of each valve's control function. The sequence of each valve test is composed of a closing process and a reopening process. To minimize megawatt variation which normally occurs during the test sequence, we employed a kind of compensator algorithm in the new digital control system which also have been used in the old system. There were difficulties finding optimal parameter settings for our new compensator algorithm because the power plant didn't allow us to perform necessary tuning procedures while the turbine is on load operation. Therefore an alternative measure for the compensator tuning which is independent of the turbine actual operation had to be implemented. So, a process model for the test was required to overcome this situation. We analyzed the operation data of the test and implemented the process model by use of input and output variable relations. Also we verified the process model by use of another condition's operating data. The result shows that the output of model is similar to the actual operation data.

• Journal of Navigation and Port Research
• /
• v.30 no.6 s.112
• /
• pp.457-464
• /
• 2006

Remarshalling operation is one of the operations considered important in an automated container terminal to perform quickly loading operations and delivery operations. It arranges the containers scattered at a verticla yard block in order to reduce the transfer time and the rehandling time of ATC(Automated Transfer Crane)s. This paper deals with the remarshalling planning problem minimizing the weighted operation time. This problem can be decomposed into 2 subproblems, storage space assignment problem and operation sequencing problem Storage space assignment problem decides to where containers are transported in terms of transportation time cost.. With results of a previous subproblem, operation sequence problem determines the ATC operation sequence, which minimizes the dead-heading of ATC This study formulates each subproblem with mixed integer program and dynamic program. To illustrate the proposed model, we propose an instance to explain the process of remarshalling planning.