• Title/Summary/Keyword: Precedence matrix

Search Result 12, Processing Time 0.024 seconds

A Heuristic Approach Solving for the Complex Design with Precedence Constraints in Concurrent Engineering (복합설계를 위한 동시공학적 접근방법)

  • Cho, Moon-Soo;Kim, Chang-Yeong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.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.

  • PDF

A Triangularization Algorithm Solving for the Complex Design with Precedence Constraints and IDEF3 Modeling in Concurrent Engineering (전제조건과 IDEF3를 응용한 동시공학환경에서의 복합설계)

  • Cho, Moon-Soo;Lim, Tae-Jin
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.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.

A Petri Net based Disassembly Sequence Planning Model with Precedence Operations (분해우선작업을 가지는 페트리 넷 기반의 분해순서계획모델)

  • Seo, Kwang-Kyu
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.5
    • /
    • pp.1392-1398
    • /
    • 2008
  • This paper presents a Petri Net (PN) based disassembly sequence planning model with precedence operations. All feasible disassembly sequences are generated by a disassembly tree and a disassembly sequence is determined using the disassembly precedence and disassembly value matrix, The precedence of disassembly operations is determined through a disassembly tree and the value of disassembly is induced by economic analysis in the end-of-life phase. To solve the disassembly sequence planning model with precedence operations, a heuristic algorithm based on PNs is developed. The developed algorithm generates and searches a partial reachability graph to arrive at an optimal or near-optimal disassembly sequence based on the firing sequence of transitions of the PN model. A refrigerator is shown as an example to demonstrate the effectiveness of proposed model.

Machining Sequence Generation with Machining Times for Composite Features (가공시간에 의한 복합특징형상의 가공순서 생성)

  • 서영훈;최후곤
    • Korean Journal of Computational Design and Engineering
    • /
    • v.6 no.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.

  • PDF

A Modified Heuristic Algorithm for the Mixed Model Assembly Line Balancing

  • Lee, Sung-Youl
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.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.

Automatic Generation of Assembly Sequences (조립순서의 자동생성에 관한 연구)

  • Son, Kyoung-Joon;Jung, Moo-Young
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.19 no.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.

  • PDF

Mathematical Representation of Geometric Tolerances : Part 1 (기하 공차의 수학적 표현 : 1편)

  • Park, Sangho;Lee, Kunwoo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.13 no.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.

  • PDF

An Automated Process Selection and Sequencing Method in Computer-Aided Process Planning (자동공정설계(自動工程設計)에서 가공작업(加工作業)의 선정(選定) 및 순서결정(順序決定) 기법(技法)의 개발(開發))

  • Cho, Kyu-Kab;Kim, In-Ho;Rho, Hyung-Min
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.15 no.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.

  • PDF

Derivation Algorithm of State-Space Equation for Production Systems Based on Max-Plus Algebra

  • Goto, Hiroyuki;Masuda, Shiro
    • Industrial Engineering and Management Systems
    • /
    • v.3 no.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.

A Study on Residential Evaluation & Remodeling Preference Characterisitics with the Personality Type(II) (성격 유형에 따른 주거평가 및 리모델링 선호특성에 관한 연구(II))

  • Kim Nam-Hyo;Lee Sang-Ho
    • Korean Institute of Interior Design Journal
    • /
    • v.14 no.5 s.52
    • /
    • 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.