• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.10a
• /
• pp.439-444
• /
• 2004

A new efficient intelligent machining strategy named the Steepest Directed Tree method is presented in this study, which makes surface model discrete with triangulation meshes and the cutter paths track along the tree directions. In order to formulate these algorithms practically, it is deduced the multi-stage machining approach of uncut volume caused by cutter gouging in the course of milling using flat end mill. It is systematized the checking process the cutter interference by grouping the 6 kinds of gouging types, which yields the environment of connectivity data lists including CL-data, and then the multi-stage machining strategy, that minimizes uncut area by continuously sequencing the generative subsequent CL-paths, is shamed to determine the second tool path for the next uncut area and to compose the operating multi-stage cutting processes. The completed machining system of curved surfaces is evaluated by testing the practical machining experiments which have various kinds of shape conditions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.10 no.15
• /
• pp.33-38
• /
• 1987

In establishing Multi-Stage Machining process inspection procedures, however, where costs of inspection md defective products are often directly measurable, a better method for formulating inspection plans is available. If one of the primary interest of a manufacturing concern is to maximize profits, then optimal inspection plans ought to be selected so as to minimize costs. This paper is aimed to find a methodology of optimal inspection planning in Multi-stage Machining process and to develope a proper algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.1
• /
• pp.64-73
• /
• 2004

This paper addresses a problem of machining determination of input quantity in a multi-stage flexible flow system with non-identical parallel machines considers a subcontracting, machining restraint, and machine yield. We develop a nonlinear programing with the objective of minimizing the sum of in-house processing cost and subcontracting cost. To solve this model, we introduce a single-processor parallel genetic algorithm(SPGA) to improve a weak point for the declined robustness of simple algorithm(SGA). The efficiency of the SPGA is examined in comparison with the SGA for the same problem. In of examination the SPGA is to provide the excellent solution than the solution of the SGA.

• Transactions of Materials Processing
• /
• v.23 no.4
• /
• pp.211-220
• /
• 2014

The outer race of a constant velocity (CV) joint having six inner ball grooves has traditionally been manufactured by multi-stage warm forging, which includes forward extrusion, upsetting, backward extrusions, necking, ironing and sizing, and machining. In the current study, a multi-stage cold forging process is examined and an assessment for replacing and modifying the conventional multi-stage warm forging is made. The proposed procedure is simplified to the backward extrusion of the conventional process, and the sizing and necking are combined into a single sizing-necking step. Thus, the forging surface of the six ball grooves can be obtained without additional machining. To verify the suitability of the proposed process, a 3-dimensional numerical simulation on each operation was performed. The forging loads were also predicted. In addition, a structural integrity evaluation for the tools was carried out. Based on the results, it is shown that the dimensional requirements of the outer race can be well met.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.44
• /
• pp.1-12
• /
• 1997

In this paper a new heuristic algorithm has been developed and presented for minimizing the total completion time of a scheduling problem in a multi stage automated machining and assembly systems. The proposed Higher Ratio First(HRF) algorithm is based on the idea that jobs with higher processing time ratio should be a higher priority. The heuristic algorithm is implemented on the various problem cases by number of jobs and machines. The proposed algorithm provided smaller makespan than the makespan applied by three previously documented heuristics. The results obtained show a superior solution by the new heuristic over previous heuristics on all problem sizes.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.455-458
• /
• 2002

In recent years, precision positioning stage is demanded fur some industrial fields such as semi conductor lithography, ultra precision machining and fabricating of nano structure. In this research, precision multi-axis positioning stage, which consists of pzt actuator, flexure, and capacitance gauge, is designed and developed. The performance of it such as 3-axis positioning, characteristic of motion and resolution is verified.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.99-104
• /
• 2002

This paper addresses a problem of machining route selection and determination of input quantity with yield in multi-stage flexible flow system. The problem is formulated as nonlinear programing and the proposed model is solved by genetic algorithm(GA) approach. The effectiveness of the proposed GA approach is evaluated through comparisons with the optimal solution obtained from the branch and bound for the same problem.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2002.10a
• /
• pp.214-218
• /
• 2002

In recent years, precision positioning stage is demanded for some industrial fields such as semi-conductor lithography, ultra precision machining, and fabricating of nano structure. In this research, precision multi-axis positioning stage, which consists of pzt actuator, flexure, and capacitance gauge, is designed and developed. The performance of 3-axis positioning, characteristics of motion and resolution are verified.

• Journal of the Korean Society for Precision Engineering
• /
• v.29 no.2
• /
• pp.129-138
• /
• 2012

In this study, three types of large scale multi-tasking machine tools together with core technologies involved have been developed and introduced; a multi-tasking machine tool for large scale marine engine crankshafts, a multi-tasking vertical lathe for windmill parts, and a large scale 5-axis machine tool of gantry type. Several special purpose devices has been necessarily developed for the purpose of handling and machining big and heavy workpieces accurately, such as PTD (Pin Turning Device) with revolving ring spindle for machining eccentric crankshaft pins, hydrostatic rotary table and steady rest for supporting and resting heavy workpieces, and 2-axis automatic swiveling head for high-quality free surface machining. Core technologies have been also developed and adopted on their detail design stage; 1) structural design optimization with FEM structural analysis, 2) theoretical hydrostatic analysis for the PTD and rotary table bearings, 3) box-in-box type cross-rail and octagonal ram design to secure machine rigidity and accuracy, 4) constant spindle rpm control against gravitational torque due to unbalanced workpiece.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.13-26
• /
• 2000

Machining route selection to produce parts should be based on shop flow information because of input data at scheduling tasks and is one of the main problem in process planning. This paper addresses the problem of machining route selection in multi-stage process with machine group included a similar function. The model proposed is formulated as 0-1 integer programing considering the relation of parts and machine table size, avaliable time of each machine for planning period, and delivery date. The objective of the model is to minimize the sum of processing, transportation, and setup time for all parts. Genetic algorithm approach is developed to solve this model. The efficiency of the approach is examined in comparison with the method of branch and bound technique for the same problem. Also, this paper is to solve large problem scale and provide it if the multiple machining routes are existed an optimal solution.