• 제목/요약/키워드: Disassembly Path

검색결과 4건 처리시간 0.019초

페트리네트를 이용한 분해경로 생성에 관한 연구 (A Study on Disassembly Path Generation Using Petri Net)

  • 이화조;주해호;경기현
    • 한국정밀공학회지
    • /
    • 제17권2호
    • /
    • pp.176-184
    • /
    • 2000
  • Possible representation methods for the product structure have been compared and analyzed to determine optimal disassembly path of a product. Petri net is selected as the most optimal method to represent disassembly path of the product. In this method, a reachability tree for the product is generated and disassembly time for each path is calculated. A path with the smallest disassembly time is selected as the optimal path. A software far DPN(Disassembly Petri Net) has been developed and applied to search the optimal disassembly path for a ballpoint pen disassembly process as an example.

  • PDF

불확실성 하에서 최대후회 최소화 분해 계획 (Minmax Regret Approach to Disassembly Sequence Planning with Interval Data)

  • 강준규
    • 산업경영시스템학회지
    • /
    • 제32권4호
    • /
    • pp.192-202
    • /
    • 2009
  • Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde's heuristic algorithm.

Virtual Disassembly

  • Mo, Jianzhong;Zhang, Qiong;Gadh, Rajit
    • International Journal of CAD/CAM
    • /
    • 제2권1호
    • /
    • pp.29-37
    • /
    • 2002
  • De-manufacturing is an entire process of collecting, disassembling, reusing, refurbishing, recycling, and/or disposing products that are obsolete or un-repairable. Designing the products for inexpensive and efficient disassembly enhances the ease of de-manufacturing. Virtual disassembly addresses the difficulty and the methods to disassemble a product in design stage rather than really disassemble a product at the end of its life cycle. Based on the virtual disassembly analysis results, design will be improved for better assembling/disassembling. This paper presents a systematic virtual disassembly methodology such as disassembly relation modeling, path/sequence automatic generation and evaluation. This paper also presents a new virtual disassembly interface paradigm via virtual reality technology for disassembly simulation in virtual environment.

작업시간이 순서 의존적인 경우 조립상태를 나타내는 유방향그래프를 이용한 최적 제품 분해순서 결정 (Optimal Disassembly Sequencing with Sequence-Dependent Operation Times Based on the Directed Graph of Assembly States)

  • 강준규;이동호
    • 대한산업공학회지
    • /
    • 제28권3호
    • /
    • pp.264-273
    • /
    • 2002
  • This paper focuses on disassembly sequencing, which is the problem of determining the optimum disassembly level and the corresponding disassembly sequence for a product at its end-of-life with the objective of maximizing the overall profit. In particular, sequence-dependent operation times, which frequently occur in practice due to tool-changeover, part reorientation, etc, are considered in the parallel disassembly environment. To represent the problem, a modified directed graph of assembly states is suggested as an extension of the existing extended process graph. Based on the directed graph, the problem is transformed into the shortest path problem and formulated as a linear programming model that can be solved straightforwardly with standard techniques. A case study on a photocopier was done and the results are reported.