A capacitated production planning problem for closed-loop supply chain with remanufacturing

This paper addresses a dynamic capacitated production planning problem in steel enterprise employing a closed-loop supply chain strategy, in which the remanufacturing process is applied. Particularly, the remanufacturing problem considered in this paper is obviously different from the typical lot-sizing problems, within which all demands are met by production or remanufacturing without backlogs; the production, inventory, and remanufacturing levels all have limits; both the production and remanufacturing setup cost functions are arbitrary and time-varying; the objective is to minimize the total cost. Firstly, the closed-loop supply chain with remanufacturing model is formulated. Then, the genetic algorithm heuristic approaches are proposed to solve the NP-hard problem. Finally, a computational experiment is presented which can solve the 200 size problem efficiently. Furthermore, the comparisons against the branch and bound method show the effectiveness and efficiency of the proposed approach for solving the large size remanufacturing problem.