• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.1
• /
• pp.78-89
• /
• 1991

This Paper presents an application example of the Adaptive Robust Servocontrol (ARSC) scheme, which is an explicit (or indirect) pole-assignment adaptive algorithm with the property of "robustness". The ARSC scheme is applied to an end-milling process for cutting force regulation. It is shown that the federate of an end-milling process can be maximized by the adaptive regulation of the peak cutting force through the ARSC scheme. The results of simulation study and real cutting experiment are presented. It has been verified that asymptotic regulation can be achieved with robustness against the slowly time-varying perturbations to the process model parameters, which are caused by nonlinear cutting dynamics. dynamics.

• Journal of Korean Society of Transportation
• /
• v.20 no.1
• /
• pp.101-110
• /
• 2002

This study first explains general features of traffic assignment models and network loading methods, and investigates the relationship between them. Then it introduces a dynamic network loading method, which accounts far time variable additionally. First of all, this study suggests that it is important to consider some requirements for the dynamic network loading, such as causality, FIFO(First-In-First-Out) discipline, the flow propagation, and the flow conservation. The details of dynamic network loafing methods are explained in the form of algorithm, and numerical examples are shown in the test network by adopting deterministic queuing model for a link Performance function.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.42
• /
• pp.99-109
• /
• 1997

This paper considers to determine the processing workstation of parts and number of machines at workstations in multi-stage manufacturing system. Several part types are processed simultaneously through multi-stage, which consist of several workstations. The machines in each stage are identical in function, but non-identical in functional performance depending on workstations. Two models are suggested. One is assumed that a part type can be processed at the only one workstation in each processing stage. The other is assumed that a part type can be processed at several workstations. Decision criteria is to minimize the sum of the processing cost, travel cost and machine setup cost. Model formulations are presented, and a numerical example is shown.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.1-9
• /
• 2005

This paper proposes the heuristic algorithm for the generalized GT problems to consider the restrictions which are given the number of machine cell and maximum number of machines in machine cell as well as minimum number of machines in machine cell. This approach is split into two phase. In the first phase, we use the similarity coefficient which proposes and calculates the similarity values about each pair of all machines and sort these values descending order. If we have a machine pair which has the largest similarity coefficient and adheres strictly to the constraint about birds of a different feather (BODF) in a machine cell, then we assign the machine to the machine cell. In the second phase, we assign parts into machine cell with the smallest number of exceptional elements. The results give a machine-part grouping. The proposed algorithm is compared to the Modified p-median model for machine-part grouping.

• 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.

• Proceedings of the Korean Institute of Interior Design Conference
• /
• 2006.11a
• /
• pp.95-98
• /
• 2006

Movement from aging society to aged society and to ultra aged society is a fact that we have to accept as reality. It also means that we are given a common assignment of supporting the aged. Therefore, this study dealt with forms of space of the welfare facilities for the aged in Japan that are being suggested as a plan to solve the problem of supporting the aged. Japan who has similar Confucian culture like Korea experienced the aging of population 30 years earlier and enactment of law 20 years earlier than Korea. Therefore, Korean policies, systems and standards for welfare of the aged have been following Japanese welfare development model. This study analyzed the small-scale multifunctional welfare facilities for the aged in Japan before founding them in Korea to adapt the facilities that are compatible in domestic circumstance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.1
• /
• pp.23-35
• /
• 1998

This article presents a network flow analysis to form flexible machine cells with minimum intercellular part moves and a neural network model to form part families. The operational sequences and production quantity of the part, and the number of cells and the cell size are taken into considerations for a 0-1 quadratic programming formulation and a network flow based solution procedure is developed. After designing the machine cells, a neural network approach for the integration of part families and the automatic assignment of new parts to the existing cells is proposed. A multi-layer backpropagation network with one hidden layer is used. Experimental results with varying number of neurons in hidden layer to evaluate the role of hidden neurons in the network learning performance are also presented. The comprehensive methodology developed in this article is appropriate for solving large-scale industrial applications without building the knowledge-based expert rule for the cellular manufacturing environment.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.1
• /
• pp.37-50
• /
• 1998

This paper considers the nonidentical parallel machine scheduling problem in which n jobs having different due dates are to be scheduled on m nonidentical parallel machines. For the make-to-order manufacturing environment, the objective is to minimize the number of tardy jobs. A 0-1 nonlinear programming model is formulated and a heuristic algorithm that allocates and sequences jobs to machines is developed. The proposed algorithm makes use of the concept of assignment problem based on the suitability measure as the cost coefficient. Computational experiments show that the proposed algorithm is superior to the existing one in some performance measures such as number of tardy jobs. In addition, this algorithm is appropriate for solving real industrial problems efficiently.

• Proceedings of the KAIS Fall Conference
• /
• 2010.11b
• /
• pp.959-963
• /
• 2010

본 연구는 종합병원에서 간호부서의 인사관리에서 부서이동이 전문간호와 간호사의 직무만족에 어떤 영향을 미치는지에 관한 개념적 모형을 제시하고자 한다. 이는 간호부서의 효율적 인사관리로 간호사 자신의 긍정적인 수용자세로 간호사 자신의 발전은 물론 병원조직의 목표달성을 효율적으로 하기 위한 기초자료를 제공할 수 있으며, 추후 진행되는 실증적 분석에 의하여 보다 나은 방향의 부서이동 정책을 지원할 수 있을 것이다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.724-728
• /
• 1995

A new dynamic channel assignment (DCA) algorithm with rearrangement for cellular mobile communication systems is suggested. Our DCA algorithm is both traffic and interference adaptive, which is based on the mathematical formulation of the maximum packing under a realistic propagation model. In developing the algorithm, we adopt the Lagrangean relaxation technique that has been successfully used in the area of mathematical programming. Computational experiments of the algorithm reveal quite encouraging results. Although our algorithm primarily focuses on microcellular systems, it can be effectively applied to conventional cellular systems under highly nonuniform traffic distributions and interference conditions.