• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1995.06a
• /
• pp.55-63
• /
• 1995

Press accidents are one of the most popular industrial accidents. Two factors are considered to lead to press accidents, one is human, the other press machine itself. Accident itself is analyzed and concluded to be due to incomplete interaction between press and human. A press design considering safety as a methodology is introduced to reduce the industrial accidents by press machine, that is micro-inching locking system.

• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.49-53
• /
• 2012

A novel method of transient stability analysis is presented in this paper. The proposed method extracts data points near the basin-of-attraction boundary and then builds a support vector machine (SVM) model learned from the generated data. The constructed SVM classifier has been shown to reduce dramatically the conservativeness of the estimated basin of attraction.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.34
• /
• pp.91-97
• /
• 1995

This paper presents a possible application of artificial neural network in CM system design. CM systems can be designed based on product lines, part characteristics or part routines. GT(Group Technology) which uses part characteristics to design cells is widely applied, however, the identification of the part-machine families is the fundamental problem in the design process. A heuristic procedure using SOFM which requires only part-machine incidence matrix is proposed in this research. Comparison studies on ZODIAC and ROC with SOFM model are done and the results are discussed and summarized in this paper.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.6 no.8
• /
• pp.55-61
• /
• 1983

In order to increase productivity, modern business which use the techniques of mass production should progress gradually from to use of human labor to total mechanization in the various steps of the production process. This will not only avoid the prospect of future labor shortages, but will also solve nancy of the problems involved in increasing productivity In this paper, we have approached the problem of determining the number of machine units that can be economically assigned to one operator by using Palm's model.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.34
• /
• pp.9-14
• /
• 1995

A cost minimization model for designing AS/RS (Automated Storage/Retrieval Systtems) has been developed under the S/R (Storage/Retrieval) machine throughput rate and total storage capacity requirements. The objective function includes S/R machine cost storage rack cost, and interface conveyor cost. Since the model is a nonlinear integer programming problem which is very hard to solve with large problem size, the model is simplified using previous research results to be solved exactly and a simultion procedure is combined to verify that throughput rate requirements are satisfied.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2003.05a
• /
• pp.52-56
• /
• 2003

In this paper, We evaluate the learning ability of non-monotonic DBM(Deterministic Boltzmann Machine) network through numerical simulations. The simulation results show that the proposed system has higher performance than monotonic DBM network model. Non-monotonic DBM network also show an interesting result that network itself adjusts the number of hidden layer neurons. DBM network can be realized with fewer components than other neural network models. These results enhance the utilization of non-monotonic neurons in the large scale integration of neuro-chips.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.329-332
• /
• 1998

This Paper proposes a mathematical model to solve the cell formation problem with exceptional elements, Exceptional elements are bottleneck machines and exceptional parts that span two or more manufacturing cells. The model suggests whether it is cost-effective to eliminate an EE (by machine duplication or part subcontracting), or whether the intercellular transfer caused by the EE should remain in the cell formation. It provides an optimal solution for resolving the interaction created by EE in the initial cell formation solution. In addition, the model recognizes potentially advantageous mixed strategies ignored by previous approaches.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.2
• /
• pp.7-12
• /
• 2006

This study considers the problem of scheduling jobs on uniform parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact that a certain phase of printed circuit board manufacturing is bottleneck and the processing speeds of parallel machines in this phase are uniformly different for all jobs. Optimal properties are proved and a simple polynomial time optimal algorithm is developed.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.24
• /
• pp.53-69
• /
• 1991

This paper is concerned with software developments for scheduling and sequencing of FMS. The scheduling algorithms are developed for 3 types of FMS:single machine type FMS, flowshop type FMS. assembly line type FMS. For the single machine type FMS. full enumeration algorithm is used. For the flowshop type FMS heuristic algorithms are developed. For the assembly type FMS the exsisting PERT/CPM algorithm is applied. Numerical examples are presented for illustration of each algorithm. Each soft ware program list are attached as appendices.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.3
• /
• pp.190-196
• /
• 2003

We consider the problem of scheduling n jobs on m machines with the objective of minimizing makespan. Each job cannot be eligible to all the machines but to its consecutively eligible set of machines. For this problem, a 2-approximation algorithm, MFFH, is developed. In addition, an example is presented to show the tightness of the algorithm.