Title
Capacitated dynamic lot sizing problems in closed-loop supply chain
Abstract
In this paper, we address the capacitated dynamic lot sizing problem arising in closed-loop supply chain where returned products are collected from customers. These returned products can either be disposed or be remanufactured to be sold as new ones again; hence the market demands can be satisfied by either newly produced products or remanufactured ones. The capacities of production, disposal and remanufacturing are limited, and backlogging is not allowed. A general model of this problem is formulated, and several useful properties of the problem are characterized when cost functions are concave. Moreover, this problem is analyzed and solved to optimality using dynamic programming algorithms under different scenarios. It is shown that the problem with only disposal or remanufacturing can be converted into a traditional capacitated lot sizing problem and be solved by a polynomial algorithm if the capacities are constant. A pseudo-polynomial algorithm is proposed for the problem with both capacitated disposal and remanufacturing. The problem with capacitated production and remanufacturing and the problem with uncapacitated production and capacitated remanufacturing are also analyzed and solved. Through numerical experiments we show that the proposed algorithms perform well when solving problems of practical sizes. From the experimental results also indicates that it is worthwhile to expand the remanufacturing capacity only when returned products exist in a relatively long planning horizon, and production capacities have little effect on the remanufacturing plan when the demand is mainly satisfied by the production.
Year
DOI
Venue
2009
10.1016/j.ejor.2008.10.018
European Journal of Operational Research
Keywords
Field
DocType
Closed-loop supply chain,Capacitated dynamic lot sizing problem,Production,Remanufacturing,Disposal
Production manager,Dynamic programming,Mathematical optimization,Time horizon,Concave function,Production planning,Supply chain,Sizing,Remanufacturing,Operations management,Mathematics
Journal
Volume
Issue
ISSN
198
3
0377-2217
Citations 
PageRank 
References 
9
0.63
4
Authors
3
Name
Order
Citations
PageRank
Zhendong Pan1532.52
J. F. Tang2685.38
Ou Liu359824.53