A Capacitated Production Planning Problem for Closed-Loop Supply Chain

摘要

This paper addresses a dynamic Capacitated Production Planning (CPP) problem in steel enterprise employing a closed-loop supply chain strategy, in which a remanufacturing process is adopted. We develop a model in which all demands are met by production or remanufacturing without backlogs, under the context that both the production and remanufacturing setup cost functions are arbitrary and time-varying. We also develop a corresponding genetic algorithm (GA) heuristic approach, and run a numerical simulation to test our algorithm's efficiency by comparing with Branch and Bound method. The simulation results illustrate our algorithm's accuracy and efficiency in large scale problems.