Effective management policies for remnant inventory supply chains

被引:3
作者
Rajgopal, Jayant [1 ]
Wang, Zhouyan [1 ]
Schaefer, Andrew [1 ]
Prokopyev, Oleg [1 ]
机构
[1] Univ Pittsburgh, Dept Ind Engn, Pittsburgh, PA 15261 USA
基金
美国国家科学基金会;
关键词
Remnant inventory; cutting stock problem; supply chain management; CUTTING-STOCK PROBLEM; PACKING;
D O I
10.1080/07408170802516298
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A remnant inventory distribution system is considered where a set of geographically dispersed distribution centers meet stochastic demand for a one-dimensional product. This demand arises from some other set of geographically dispersed locations. The product is replenished at the centers in a limited number of standard sizes, while the demand is for various smaller sizes of the product and arrives over time according to a Poisson process. There are costs associated with cutting and transportation and scrap can be profitably reclaimed. The combined production (cutting) and distribution problem is modeled as a network. A linear programming formulation is solved for a deterministic version of this problem using mean demand rates and the optimal dual multipliers are used to assign inherent values to remnants of various sizes. These values are then used to develop a price-directed policy that can be used in a stochastic environment. A simulation study shows that this policy significantly outperforms heuristic policies from the literature as well as other heuristic policies that have been used in the steel industry for a similar problem. Theoretical insights into the structure of the proposed optimization problem are provided along with proofs of several important results. [Supplementary materials are available for this article. Go to the publisher's online edition of IIE Transactions for the following free supplemental resource: Appendix].
引用
收藏
页码:437 / 447
页数:11
相关论文
共 15 条
[1]  
Adelman D., 1999, Manufacturing & Service Operations Management, V1, P21, DOI 10.1287/msom.1.1.21
[2]   Price-directed control of remnant inventory systems [J].
Adelman, D ;
Nemhauser, GL .
OPERATIONS RESEARCH, 1999, 47 (06) :889-898
[3]   THE CUTTING STOCK PROBLEM - A SURVEY [J].
CHENG, CH ;
FEIRING, BR ;
CHENG, TCE .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1994, 36 (03) :291-305
[4]   ON OPTIMAL PACKING OF RANDOMLY ARRIVING OBJECTS [J].
COURCOUBETIS, C ;
ROTHBLUM, UG .
MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (01) :176-194
[5]  
De Carvalho J. M. V., 1998, International Transactions in Operational Research, V5, P35, DOI 10.1016/S0969-6016(97)00044-0
[6]   A TYPOLOGY OF CUTTING AND PACKING PROBLEMS [J].
DYCKHOFF, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 44 (02) :145-159
[7]   A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1961, 9 (06) :849-859
[8]   A dynamic stochastic stock-cutting problem [J].
Krichagina, EV ;
Rubio, R ;
Taksar, MI ;
Wein, LM .
OPERATIONS RESEARCH, 1998, 46 (05) :690-701
[9]  
*NCDENR, 1998, MET AL CANS SCRAP CO
[10]  
ROBERTSON S, 2004, AM METAL MARKET, V112, P4