폐기물 처분과 유한 재생산률을 고려한 동적 폐기물 회수계획 및 다종제품 재생산계획 문제

다국어 초록 (Multilingual Abstract)

This paper considers a withdrawing and remanufacturing planning problem, in which wastes can be withdrew at a period and also remanufactured at a period by any value in the set {0, P} where the rate P is the capacity of a remanufacturing facility. The withdrawal fee is occurred as a profit term that is proportional to the withdrawing container size(W). The inventory amounts of wastes can be disposal at the end of a period by incurring a disposal cost. The multiple products are remanufactured by each taking a fixed portion (0〈αi〈1) of the input wastes to satisfy dynamic demands of each product over a discrete and finite time horizon. Also, a start-up cost is only incurred at the first period of a remanufacturing block which is consecutively remanufactured. It is assumed that the related cost (inventory holding cost of the wastes, the remanufacturing and inventory holding costs of the remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to simultaneously determine the optimal withdrawing and remanufacturing plans that minimize the total cost to satisfy dynamic demands of the multiple products. In this paper, the optimal solution properties are characterized and then, based on these properties, a dynamic programming algorithm is presented to find the optimal plan. Also, a network model is proposed to efficiently find the optimal solution to (u,v)- subproblems.

목차 (Table of Contents)

• Abstract
• 1. 서론
• 2. 수리모형
• 3. 최적해의 성질
• 4. 동적계획법 알고리즘
• 5. 결론
• 참고문헌