A Two-Stage Heuristic for Capacitated Disassembly Scheduling

자원제약을 고려한 분해 일정계획 문제에 대한 2 단계 발견적 기법

Disassembly scheduling is the problem of determining the quantity and timing of disassembling used products while satisfying the demand of their parts or components over a planning horizon. The case of single product type with assembly structure is considered for the objective of minimizing the sum of disassembly operation and inventory holding costs. In particular, the resource capacity constraint is explicitly considered. The problem is formulated as an integer programming model, and a two-stage heuristic with construction and improvement algorithms is suggested in this paper. To show the performance of the heuristic, computational experiments are done on a number of randomly generated problems, and the test results show that the algorithm can give near optimal solutions within a very short amount of computation time.