• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.87-96
• /
• 1998

Using the concept of cellular manufacturing systems(CMS) in job shop manufacturing system is one of the most innovative approaches to improving plant productivity. However. several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of maintaining an ideal CMS environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem because it is a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine ceil. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and ceil space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine Incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.263-266
• /
• 1998

Several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of ideal Cellular Manufacturin System (CMS) environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem as it's a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine cells. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and cell space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• Korean Management Science Review
• /
• v.24 no.1
• /
• pp.91-111
• /
• 2007

In this paper an effective two-phase approach adopting modified p-median mathematical model is proposed for grouping machines and parts in cellular manufacturing(CM). Unlike the conventional methods allowing machines and parts to be improperly assigned to cells and families, the proposed approach seeks to find the proper block diagonal solution where all the machines and parts are properly assigned to their most associated cells and families in term of the actual machine processing and part moves. Phase 1 uses the modified p-median formulation adopting new inter-machine similarity coefficient based on the non-binary production data-based part-machine incidence matrix(PMIM) that reflects both the operation sequences and production volumes for the parts to find machine cells. Phase 2 apollos iterative reassignment procedure to minimize inter-cell part moves and maximize within-cell machine utilization by reassigning improperly assigned machines and parts to their most associated cells and families. Computational experience with the data sets available on literature shows the proposed approach yields good-quality proper block diagonal solution.

• Journal of Ocean Engineering and Technology
• /
• v.6 no.1
• /
• pp.113-121
• /
• 1992

In this study, the variation of fatigue strength in CF/PEEK and CF/EPOXY, the matrix and interfacial strength of which differ from each other, has been studied from the viewpoint of microfracture behavior. The results obtained are as follows; According as the fatigue strength moves from the lower cycle range to the higher cycle range, that of CF/PEEK shows higher curve than that of CF/EPOXY does. In the early stage of fatigue life, the characteristic of fatigue crack in CF/PEEK is mainly the fracture of longitudinal fiber, while that in CF/EPOXY is the fracture of transverse fiber. The difference of fatigue strength in these materials can be explained by the fracture criteria of transverse fiber and longitudinal fiber.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.6
• /
• pp.634-639
• /
• 2020

In general, the stability and response characteristics of the system can be improved by changing the pole position because a nonlinear system can be linearized by the product of a 1st and 2nd order system. Therefore, a controller that moves the pole can be designed in various ways. Among the other methods, LQ control ensures the stability of the system. On the other hand, it is difficult to specify the location of the pole arbitrarily because the desired response characteristic is obtained by selecting the weighting matrix by trial and error. This paper evaluated a method of selecting a weighting matrix of LQ control that moves multiple double poles with Jordan blocks to real poles. The relational equation between the double poles and weighting matrices were derived from the characteristic equation of the Hamiltonian system with a diagonal control weighting matrix and a state weighting matrix represented by two variables (ρ_d, ϕ_d). The Moving-Range was obtained under the condition that the state-weighting matrix becomes a positive semi-definite matrix. This paper proposes a method of selecting poles in this range and calculating the weighting matrices by the relational equation. Numerical examples are presented to show the usefulness of the proposed method.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.6
• /
• pp.115-131
• /
• 2022

Carbon dioxide (CO₂) emissions from the transportation sector in South Korea accounts for 16.5% of all CO₂ emissions, and road transportation accounts for 96.5% of this sector's emissions in South Korea. Hence, constant research is being carried out on methods to reduce CO₂ emissions from this sector. With the emerging use of smart crossings, attempts to monitor individual vehicles are increasing. Moreover, the potential commercial deployment of autonomous vehicles increases the possibility of obtaining individual vehicle data. As such, CO₂ emission research was conducted at five signalized intersections in the Gangnam District, Seoul, using data such as vehicle type, speed, acceleration, etc., obtained from image detectors located at each intersection. The collected data were then applied to the MOtor Vehicle Emission Simulator (MOVES)-Matrix model-which was developed to obtain second-by-second vehicle activity data and analyze daily CO₂ emissions from the studied intersections. After analyzing two large and three small intersections, the results indicated that 3.1 metric tons of CO₂ were emitted per day at each intersection. This study reveals a new possibility of analyzing CO₂ emissions using actual individual vehicle data using an improved analysis model. This study also emphasizes the importance of more accurate CO₂ emission analyses.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1829-1832
• /
• 2004

Closed loop stability of Extended Dynamic Matrix Control (EDMC) is investigated for limited sampling time. Linear approximation of the sensitivity functions is employed in the derivation of the stability condition. It is shown that the closed loop system will be stable if the control moves suppression coefficient ${\lambda}$ is taken arbitrarily large. Special cases such as M=P=1 and M=1, P>1 are discussed in more details.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.444-447
• /
• 2004

A new approach to compute the control moves in Extended Dynamic Matrix Control (EDMC) is presented. In this approach, the number of variables, determined in the inner loop of the control algorithm using iterative methods, is reduced from P , the prediction horizon to M , the control horizon. Since M is usually much smaller than P , this modifies the control algorithm from computational point of view. To justify the modification, the computational requirements are compared to those of the existing EDMC algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.27.4-27
• /
• 2001

A stabilizing control method for linear systems with model uncertainties and hard input constraints is developed, which does not require on-line optimizations. This work is motivated by the constrained robust MPC(CRMPC) approach [3] which adopts the dual mode prediction strategy (i.e. free control moves and invariant set) and minimizes a worst case performance criterion. Based on the observation that, a feasible control sequence for a particular state can be found as a linear combination of feasible sequences for other states, we suggest a stabilizing control algorithm providing sub-optimal and feasible control sequences using pre-computed optimal sequences for some canonical states. The on-line computation of the proposed method reduces to simple matrix multiplication.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.729-731
• /
• 2004

This paper deals with the design of a low order $H_{\infty}$ controller by using an iterative linear matrix inequality (LMI) method. The low order $H_{\infty}$ controller is represented in terms of LMIs with a rank condition. To solve the non-convex rank-constrained LMI problem, a linear penalty function is incorporated into the objective function so that minimizing the penalized objective function subject to LMIs amounts to a convex optimization problem. With an increasing sequence of the penalty parameter, the solution of the penalized optimization problem moves towards the feasible region of the original non-convex problem. The proposed algorithm is, therefore, convergent. Numerical experiments show the effectiveness of the proposed algorithm.