Abstract
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.
Similar content being viewed by others
References
Hammond D, Beullens P (2007) Closed-loop supply chain network equilibrium under legislation. Eur J Oper Res 22:895–908
Fleischmann M, Bloemhof-Ruwaard JM, Dekker R, van derLaan E, van Nunen JAEE, van Wassenhove LN (1997) Quantitative models for reverse logistics: a review. Eur J Oper Res 103(1):1–17
Guide VDR, Van Wassenhove LN (2001) Managing product returns for remanufacturing. Production Oper Management 10:142–154
Guide VDR, Jayaraman V, Linton JD (2003) Building contingency planning for closed-loop supply chains with product recovery. J Oper Manage 21(3):259–279
Wagner HM, Whitin T (1958) Dynamic version of the economic lot size model. Manage Sci 5:89–96
Florian M, Klein M (1971) Deterministic production planning with concave costs and capacity constraints. Manage Sci 18(1):12–20
Van Hoesel CPM, Wagelmans APM (1996) An O(T3) algorithm for the economic lot-sizing problem with constant capacities. Manage Sci 42:142–150
Florian M, Lenstra JK, Rinnooy KAHG (1980) Deterministic production planning: algorithm and complexity. Manage Sci 26(7):669–679
Liu X, Tu YL, Zhang J, Watson LG (2008) A genetic algorithm heuristic approach to general outsourcing capacitated production planning problems. Int J Prod Res 46(18):5059–5074
Savaskan RC, Bhattacharya S, Van Wassenhove LN (2004) Closed-loop supply chain models with product remanufacturing. Manage Sci 50(2):239–252
Souza GC, Ketzenberg ME, Guide VER (2002) Capacitated remanufacturing with service level constraints. Prod Oper Manag 11(2):231–248
Beltran JL, Krass D (2002) Dynamic lot sizing with returning items and disposals. IIE Trans 34:437–448
Nagurney A, Toyasaki F (2005) Reverse supply chain management and electronic waste recycling: a multi tiered network equilibrium framework for e-cycling. Trans Res Part E 41:1–28
Dellaert NP, Jeunet J (2000) Solving large unconstrained multi-level lot sizing problems using a hybrid genetic algorithm. Int J Prod Res 38(5):1083–1099
Fleischmann M, Krikke HR, Dekker R, Flapper SDP (2000) A characterization of logistics networks for product recovery. Omega 28(6):653–666
van Hop N, Tabucanon MT (2005) Adaptive genetic algorithm for lot-sizing problem with self-adjustment operation rate. Int J Prod Econ 98(2):129–135
Hung YF, Chien KL (2000) A multi-class multi-level capacitated lot sizing model. J Oper Res Soc 51(11):1309–1318
Jayaraman V, Guide VDR, Srivastava R (1999) A closed-loop logistics model for remanufacturing. J Oper Res Soc 50(5):497–508
Nsakanda AL, Moustapha D, Price WL (2006) Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings. Eur J Oper Res 171(3):1051–1071
Michalewicz Z (1996) Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, J., Liu, X. & Tu, Y.L. A capacitated production planning problem for closed-loop supply chain with remanufacturing. Int J Adv Manuf Technol 54, 757–766 (2011). https://doi.org/10.1007/s00170-010-2948-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-010-2948-0