• 대한안전경영과학회지
• /
• 제3권2호
• /
• pp.91-103
• /
• 2001

The purpose of this paper is to supply the principal methods for the safety in the press industrial accident preventions and the basic analyzing theory in the press industrial accidents. It was reached the press machine installed companys and was analyzed the accident characteristics, types, the worker's working period and the distributed worker's age of the happened the press machine industrial accidents. The direct reasons are almost reasons of the press industrial accidents. But it should be not ignore the indirect reasons of the accidents In this study, it was presented that the safety devices is selected by the amalyzed reasons in the press industrial accidents for the principal accident prevention.

• 산업경영시스템학회지
• /
• 제23권56호
• /
• pp.9-18
• /
• 2000

This paper considers the problem of two-machine, M-parallel flow shop scheduling to minimize makespan, and proposes a series of heuristic algorithms and a branch and bound algorithm. Two processing times of each job at two machines on each line are identical on any line. Since each flow-shop line consists of two machines, Johnson's sequence is optimal for each flow-shop line. Heuristic algorithms are developed in this paper by combining a "list scheduling" method and a "local search with global evaluation" method. Numerical experiments show that the proposed heuristics can efficiently give optimal or near-optimal schedules with high accuracy. with high accuracy.

• 한국생산제조학회지
• /
• 제22권3호
• /
• pp.349-355
• /
• 2013

Recently, there is an increasing need to produce more precise products with small deviations from defined target values. Machine capability is the ability of a machine tool to produce parts within a tolerance interval. Capability indices are a statistical way of describing how well a product is machined compared to defined target values and tolerances. Today, there is no standardized way to acquire a machine capability value. This paper describes a method for evaluating machine capability indices in machining centers. After the machining of specimens, the straightness, roundness, and positioning accuracy were measured by using CMM (coordinate measuring machine). These measured values and defined tolerances were used to evaluate the machine capability indices. It will be useful for the industry to have standardized ways to choose and calculate machine capability indices.

• 산업경영시스템학회지
• /
• 제39권3호
• /
• pp.83-89
• /
• 2016

The group formation problem of the machine and part is a critical issue in the planning stage of cellular manufacturing systems. The machine-part grouping with alternative process plans means to form machine-part groupings in which a part may be processed not only by a specific process but by many alternative processes. For this problem, this study presents an algorithm based on self organizing neural networks, so called SOM (Self Organizing feature Map). The SOM, a special type of neural networks is an intelligent tool for grouping machines and parts in group formation problem of the machine and part. SOM can learn from complex, multi-dimensional data and transform them into visually decipherable clusters. In the proposed algorithm, output layer in SOM network had been set as one-dimensional structure and the number of output node has been set sufficiently large in order to spread out the input vectors in the order of similarity. In the first stage of the proposed algorithm, SOM has been applied twice to form an initial machine-process group. In the second stage, grouping efficacy is considered to transform the initial machine-process group into a final machine-process group and a final machine-part group. The proposed algorithm was tested on well-known machine-part grouping problems with alternative process plans. The results of this computational study demonstrate the superiority of the proposed algorithm. The proposed algorithm can be easily applied to the group formation problem compared to other meta-heuristic based algorithms. In addition, it can be used to solve large-scale group formation problems.

• 산업공학
• /
• 제15권3호
• /
• pp.316-324
• /
• 2002

Automated Guided Vehicles are widely used as an essential material handling system for FMS to provide flexibility and efficiency. We suggest a new dispatching rule based on priority function which considers urgency and empty vehicle travel time under finite buffer capacity. We evaluate the performance of the proposed rule by comparing the performance of Shortest Travel Time/Distance(STT/D) rule in terms of machine utilization, throughput and WIP level using simulation. The simulation results show that the suggested dispatching rule is robust and provides better machine utilization, throughput with comparable WIP level compared to STT/D rule.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 춘계학술대회 논문집
• /
• pp.15-19
• /
• 2002

With the rapid development of industrial technologies, the demand for high precision products has been increasing drastically. For this reason, the need for developing of high performance machine tool, which can ensure high precision, is desired in the industrial fields. Technologies on the spindle system manufacture, guideway manufacture, error compensation, design of bed structure, protection against vibrations, and system integration are core technology for developing of high precision machine tools. Especially, among these, design of spindle system, which is leading precision and manufacturing technique. is one of the most important technologies. A high speed and high precision spindle system, which will be used for final machining of ferrule, is designed considering the effect caused by thermal, cutting torque, cutting farce, and work-piece materials. The detail process of analysis is presented.

• 산업공학
• /
• 제12권4호
• /
• pp.617-624
• /
• 1999

In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider a scheduling problem for assembly machine in ship engine assembly shop. This paper considers the parallel machine scheduling problem in which n jobs having different release times, due dates and space limits are to be scheduled on m parallel machines. The objective function is to minimize the sum of earliness and tardiness. To solve this problem, a heuristic is developed. The proposed heuristic is divided into three modules hierarchically: job selection, machine selection and job sequencing, solution improvement. To illustrate its effectiveness, a proposed heuristic is evaluated with a large number of randomly generated test problems based on the field situation. Through the computational experiment, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic.

• 산업경영시스템학회지
• /
• 제37권3호
• /
• pp.113-121
• /
• 2014

This paper considers a scheduling problem in a two-machine flowshop with outsourcing strategy incorporated. The jobs can be either processed in the first machine or outsourced to outside subcontractors. This paper wants to determine which jobs to be processed in-house and which jobs to be outsourced. If any job is decided to be outsourced, then an additional outsourcing cost is charged The objective of this paper is to minimize the sum of scheduling cost and outsourcing cost under a budget constraint. At first this paper characterizes some solution properties, and then it derives solution procedure including DP (Dynamic Programming) and B&B (Branch-and-Bound) algorithms and a greedy-type heuristic. Finally the performance of the algorithms are evaluated with some numerical tests.

• 산업기술연구
• /
• 제16권
• /
• pp.217-230
• /
• 1996

This paper deals with storage and retrieval policies for S/R machine with capacity constraints in Man-On-Board AS/RS. It is assumed that storage sequence is based on SFC(spacefilling curve) routine and that storage layout is dedicated by storage policies. We present several heuristic algorithms for storage and retrieval policies which minimize total distance travelled by the S/R machine. These algorithms are based on COI, group COI, frequency of order, similarity between items and capacity of S/R machine. Experimental results of 24 combinastorial policies are provided to illustrate the performance of the heuristics under various rack utilization ratios. In storage policies, the results show that algorithms considering both similarity and frequency are better than those with COI as rack utilization is increasing. And algorithm using group COI is superior to others. In retrieval policies, the method with revision expression is shown to be better than others.

• 산업경영시스템학회지
• /
• 제23권61호
• /
• pp.137-146
• /
• 2000

One of the problems faced in implementing cellular manufacturing systems is machine-part group formation. This paper proposes machine-part grouping algorithms based on Self-Organizing Map(SOM) neural networks and K-Means algorithm in cellular manufacturing systems. Although the SOM spreads out input vectors to output vectors in the order of similarity, it does not always find the optimal solution. We rearrange the input vectors using SOM and determine the number of groups. In order to find the number of groups and grouping efficacy, we iterate K-Means algorithm changing k until we cannot obtain better solution. The results of using the proposed approach are compared to the best solutions reported in literature. The computational results show that the proposed approach provides a powerful means of solving the machine-part grouping problem. The proposed algorithm Is applied by simple calculation, so it can be for designer to change production constraints.