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

• 영문명: Minmax Regret Approach to Disassembly Sequence Planning with Interval Data
• 발행기관: 한국산업경영시스템학회
• 저자명: 강준규(Jun-Gyu Kang)
• 간행물 정보: 『산업경영시스템학회지』제32권 제4호, 192~202쪽, 전체 11쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2009.12.30

영문 초록

Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling of remanufacturing, since most products should be disassembled before being recycled of remanufactured as secondary parts or materials In disassembly sequence planning of EOL products, considered are the uncertainty issues, ie, defective parts or joints in an incoming product, disassemble damage, and imprecise net profits and costs The paper deal 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

키워드

Assembly/Disassembly Sequence Minmax Regret Robust Shortest Path Interval Data