다수의 유한 재생산률과 다종의 컨테이너를 고려한 동적 폐기물 회수계획 및 다종제품 재생산계획 문제
이운식 · 대한산업공학회 추계학술대회 논문집 · 2015
This paper considers a withdrawing and remanufacturing planning problem, in which wastes are withdrew by multiple container types and can be remanufactured at each period by any value in the set 0, , ,mP} where the rate P is the increment of a remanufacturing capacity and m is a nonnegative integer. Each container type has a type-dependent carrying capacity and the freight cost is proportional to the number of containers types used. The multiple products are remanufactured by each taking a fixed portion (0 related cost (withdrawing and inventory holding costs of the wastes, and 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.
Cited by 0 works.