불확실성 하에서 최대후회 최소화 분해 계획

• 영문명: Minmax Regret Approach to Disassembly Sequence Planning with Interval Data
• 발행기관: 한국산업경영시스템학회
• 저자명: 강준규
• 간행물 정보: 『한국산업경영시스템학회 학술대회』2009년 추계학술대회 논문집, 69~76쪽, 전체 8쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2009.07.30

영문 초록

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 since the problem is NP-hard, a heuristic algorithm is developed to find a path with the minimum worst case regret. 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.

목차

1. 서 론

2. 문제 정의

3. A Heuristic Algorithm

4. 모의실험에 의한 검증

5. 결론

키워드

Assembly/Disassembly Sequence Minmax Regret Interval Data