Remanufacturing planning on a single facility

This paper considers remanufacturing planning problems under deterministic environments. As increasing the environmental pressures in manufacturing, various methods for reducing wastes or postponing the time to be waste are considerd. This paper considers remanufacturing planning problems on a single facility, where the wastes (or used products) are remanufactured to satisfy the given demand on the remanufactured product. The objective is to find the optimal remanufacturing and purchasing planning of the wastes which minimize total cost subject to satisfaction of all the given demand on the remanufactured products. Two problems that the amount of wastes is a given constant or a decision variable are considered, respectively. For the problems, the extreme point solutions are characterized, and dynamic programming algorithms are developed with numerical examples.