Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1007/978-3-642-13498-2_32 | ICSI |
Keywords | Field | DocType |
dynamic capacitated production planning,corresponding genetic algorithm,capacitated production planning problem,simulation result,heuristic approach,large scale problem,numerical simulation,remanufacturing setup cost function,closed-loop supply chain strategy,bound method,remanufacturing process,genetic algorithm,genetic algorithms,inventory,cost function | Heuristic,Mathematical optimization,Computer simulation,Computer science,Production planning,Supply chain,Branch and bound method,Remanufacturing,Genetic algorithm | Conference |
Volume | ISSN | ISBN |
6146 | 0302-9743 | 3-642-13497-1 |
Citations | PageRank | References |
3 | 0.43 | 3 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jian Zhang | 1 | 6 | 2.50 |
Xiao LIU | 2 | 59 | 8.40 |