• 대한산업공학회지
• /
• 제24권2호
• /
• pp.185-197
• /
• 1998

Engineering design involves the specification of many variables that define a product, how it is made, and how it behaves. Before some variables can be determined, other variables must first be known or assumed. This fact implies a precedence order of the variables, and of the tasks of determining these variable consequently. Moreover, design of complex systems may involve a large number of design activities. In this paper, the activity-activity incidence matrix is considered as a representation of design activity analysis which mainly focuses on the precedence constraint. In order to analyze the activity-activity incidence matrix, a heuristic algorithm is proposed, which transforms an activity-activity, parameter-formula, and parameter-parameter incidence matrix into a lower triangular form. The analysis of the structured matrices can not only significantly reduce the overall project complexity by reorganizing few critical tasks in practice, but also aims at obtaining shorter times considering the solution structure by exploring concurrency.

• 제어로봇시스템학회논문지
• /
• 제15권7호
• /
• pp.742-752
• /
• 2009

Engineering design involves the specification of many variables that define a product, how it is made, and how it behaves applied to computer, communication and control fields. Before some variables can be determined, other variables must first be known or assumed. This fact implies a precedence order of the variables, and of the tasks of determining these variables consequently. Moreover, design of complex systems may involve a large number of design activities. In this paper, the activity-activity incidence matrix is considered as a representation of design activity analysis which mainly focuses on the precedence constraint with an object of doing IDEF3 in process-centered view. In order to analyze the activity-activity incidence matrix, a heuristic algorithm is proposed, which transforms an activity-activity, parameter-formula, and parameter-parameter incidence matrix into a lower triangular form. The analysis of the structured matrices can not only significantly reduce the overall project complexity by reorganizing few critical tasks in practice, but also aims at obtaining shorter times considering the solution structure by exploring concurrency.

• 한국산학기술학회논문지
• /
• 제9권5호
• /
• pp.1392-1398
• /
• 2008

본 논문에서는 분해우선작업을 가지는 페트리 넷 기반의 분해순서계획모델을 제안한다. 모든 가능한 분해순서는 분해트리에 의해 생성되고, 분해우선순위와 분해가치 행렬을 이용하여 분해순서를 결정한다. 분해작업의 우선순위는 분해트리를 통하여 결정하고 분해작업의 가치는 제품의 마지막 수명단계의 경제적 분석에 의해 유도된다. 분해우선작업을 가지는 분해계획모델을 해결하기 위하여, 본 연구에서는 페트리 넷 기반의 휴리스틱 알고리듬을 개발한다. 개발된 알고리듬은 페트리 넷 모델의 전이순서에 기반을 두어 도달할 수 있는 모든 그래프의 노드를 탐색하여 최적의 혹은 근사최적의 분해순서를 생성한다. 본 연구에서는 냉장고를 대상으로 제안모델의 유효성을 입증한다.

• 한국CDE학회논문집
• /
• 제6권4호
• /
• pp.244-253
• /
• 2001

For more complete process planning, machining sequence determination is critical to attain machining economics. Although many studies have been conducted in recent years, most of them suggests the non-unique machining sequences. When the tool approach directions(TAD) are considered fur a feature, both machining time and number of setups can be reduced. Then, the unique machining sequence can be extracted from alternate(non-unique) sequences by minimizing the idle time between operations within a sequence. This study develops an algorithm to generate the best machining sequence for composite prismatic features in a vertical milling operation. The algorithm contains five steps to produce an unique sequence: a precedence relation matrix(PRM) development, tool approach direction determination, machining time calculation, alternate machining sequence generation, and finally, best machining sequence generation with idle times. As a result, the study shows that the algorithm is effective for a given composite feature and can be applicable fur other prismatic parts.

• 한국산업정보학회논문지
• /
• 제15권3호
• /
• pp.59-65
• /
• 2010

This paper proposes a modified heuristic mixed model assembly line (MMAL) balancing algorithm that provides consistent station assignments on a model by model basis as well as on a station by station. Basically, some of single model line balancing techniques are modified and incorporated to be fit into the MMAL. The proposed algorithm is based on N.T. Thomopoulos' [8] method and supplemented with several well proven single model line balancing techniques proposed in the literature until recently. Hoffman's precedence matrix [2] is used to indicate the ordering relations among tasks. Arcus' Rule IX [1] is applied to generate rapidly a fairly large number of feasible solutions. Consequently, this proposed algorithm reduces the fluctuations in operation times among the models as well as the stations and the balance delays. A numerical example shows that the proposed algorithm can provide a good feasible solution in a relatively short time and generate relatively better solutions comparing to other three existing methods.

• 대한산업공학회지
• /
• 제19권1호
• /
• pp.1-17
• /
• 1993

It is well known that an assembly operation is usually constrained by the geometric interference between parts. These constraints are normally presented as AND/OR precedence relationships. To find a feasible assembly sequence which satisfies the geometric constraints is not an easy task because of the TSP(Traveling Salesman Problem) nature with precedence constraints. In this paper, we developed an automated system based on Neural Network for generating feasible assembly sequences. Modified Hopfield and Tank network is used to solve the problem of AND/OR precedence-constrained assembly sequences. An economic assembly sequence can be also obtained by applying the cost matrix that contains cost-reducing factors. To evaluate the performance and effectiveness of the developed system, a case of automobile generator is tested. The results show that the developed system can provide a "good" planning tool for an assembly planner within a reasonable computation time period.

• 한국정밀공학회지
• /
• 제13권6호
• /
• pp.78-89
• /
• 1996

Every mechanical component is fabricated with the variations in its size and shape, and the allowable range of the variation is specified by the tolerance in the design stage. Geometric tolerances specify the size or the thickness of each shape entity itself or its relative position and orientation with respect to datums. Since the range of shape variation can be represented by the variation of the coordinate system attached to the shape, the transformation matrix of the coordinate system would mathematically express the range of shape variation if the interval numbers are inserted for the elements of the transformation matrix. For the shape entity specified by the geometric tolerance with reference to datums, its range of variation can be also derived by propagating the transformation matrices composed of interval numbers. The propagation depends upon the order of precedence of datums.

• 대한산업공학회지
• /
• 제15권2호
• /
• pp.45-55
• /
• 1989

This paper deals with development of a computer-aided process selection and sequencing technique and its software for metal cutting processes of rotational parts. The process selection procedure consists of selection for proper machining operations and machine tools suitable for the selected operations. Machining operations are selected based on machining surface features and machine tools are selected by employing a conversion table which converts machining operations into machine tools. The process sequence is determined by the proper manipulation of the precedence relation matrix. A computer program for the proposed technique is developed by using Turbo-Pascal on IBM PC/AT compatible system. The proposed technique works well to real problems.

• Industrial Engineering and Management Systems
• /
• 제3권1호
• /
• pp.1-11
• /
• 2004

This paper proposes a new algorithm for determining an optimal control input for production systems. In many production systems, completion time should be planned within the due dates by taking into account precedence constraints and processing times. To solve this problem, the max-plus algebra is an effective approach. The max-plus algebra is an algebraic system in which the max operation is addition and the plus operation is multiplication, and similar operation rules to conventional algebra are followed. Utilizing the max-plus algebra, constraints of the system are expressed in an analogous way to the state-space description in modern control theory. Nevertheless, the formulation of a system is currently performed manually, which is very inefficient when applied to practical systems. Hence, in this paper, we propose a new algorithm for deriving a state-space description and determining an optimal control input with several constraint matrices and parameter vectors. Furthermore, the effectiveness of this proposed algorithm is verified through execution examples.

• 한국실내디자인학회논문집
• /
• 제14권5호
• /
• pp.245-253
• /
• 2005

The purpose of this study is to analyze the relationship between the personality type and the residential evaluation & remodeling preference in interior finishes and floor layouts. The subjects of this investigation were collected through questionnaire from two hundred and twelve adult residents who live in Seoul, Korea. By using the rotated component matrix of varimax method & the one way anova method of spss for windows Rel. 11.0 in my former study, there are analyzed several significances in eight personality types; E(extraversion), I(introversion), S(sensing), N(intuition), T(thinking), F(feeling), J(judging) and P(perceiving) in MBTI (Myers Briggs Type Indicator). This study shows that actual floor plans, remodeling preference plans & interior finishes materials of each personality type was analyzed several significances by Chi-Square. As results, during consulting the client in the residential projects, personality test may take precedence over everything else, and then designer can consider it for hidden client needs in the residential interiors & remodelings. Designers might understand the nature of personality in order to design wisely for clients. This method will allow the designer & consultant to more fully understand clients' preference.