An Exact Algorithm for Two-Level Disassembly Scheduling
暂无分享,去创建一个
Disassembly scheduling is the problem of determining the quantity and timing of disassembling used or end-of-life products while satisfying the demand of their parts or components over a given planning horizon. This paper considers the two-level disassembly structure that describes a direct relationship between the used product and its parts or components. To formulate the problem mathematically, we first suggest an integer programming model, and then reformulate it to a dynamic programming model after characterizing properties of optimal solutions. Based on the dynamic programming model, we develop a polynomial exact algorithm and illustrate it with an example problem.
[1] 박종호,et al. 철강 코일제품 수송 팔레트의 설계 최적화 , 2008 .
[2] 정재윤,et al. 자취 군집화를 통한 프로세스 마이닝의 성능 개선 , 2008 .