Economic lot-sizing with remanufacturing options

被引：26

作者：

Golany, B ^{[1
]}

Yang, J

Yu, G

机构：

[1] Technion Israel Inst Technol, Fac Ind Engn & Management, IL-32000 Haifa, Israel

[2] New Jersey Inst Technol, Dept Ind & Mfg Engn, Newark, NJ 07102 USA

[3] Univ Texas, Dept Management Sci & Informat Syst, Austin, TX 78712 USA

[4] Univ Texas, Ctr Management Operat & Logist, Austin, TX 78712 USA

来源：

IIE TRANSACTIONS | 2001年 / 33卷 / 11期

关键词：

D O I：

10.1080/07408170108936890

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We study a production planning problem with remanufacturing. We provide the problem's general formulation and assess its computational complexity under various cost structures. We prove that the problem is NP-complete for general concave-cost structures. When costs are linear, we obtain an O(T-3) algorithm based on transforming the problem into the transportation problem in a special way. Finally, we suggest linearizing costs as an alternative for solving the problem in the real world.

引用

页码：995 / 1003

页数：9

共 18 条

[1] IMPROVED ALGORITHMS FOR ECONOMIC LOT-SIZE PROBLEMS [J].

AGGARWAL, A ;

PARK, JK .

OPERATIONS RESEARCH, 1993, 41 (03) :549-571

[2] COMPUTATIONAL-COMPLEXITY OF THE CAPACITATED LOT SIZE PROBLEM [J].

BITRAN, GR ;

YANASSE, HH .

MANAGEMENT SCIENCE, 1982, 28 (10) :1174-1186

[3] APPROXIMATION FORMULATIONS FOR THE SINGLE-PRODUCT CAPACITATED LOT SIZE PROBLEM [J].

BITRAN, GR ;

MATSUO, H .

OPERATIONS RESEARCH, 1986, 34 (01) :63-74

[4] A SIMPLE FORWARD ALGORITHM TO SOLVE GENERAL DYNAMIC LOT SIZING MODELS WITH N PERIODS IN 0(N LOG N) OR 0(N) TIME [J].

FEDERGRUEN, A ;

TZUR, M .

MANAGEMENT SCIENCE, 1991, 37 (08) :909-925

[5] Quantitative models for reverse logistics: A review [J].

Fleischmann, M ;

BloemhofRuwaard, JM ;

Dekker, R ;

vanderLaan, E ;

vanNunen, JAEE ;

VanWassenhove, LN .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 103 (01) :1-17

[6] DETERMINISTIC PRODUCTION PLANNING - ALGORITHMS AND COMPLEXITY [J].

FLORIAN, M ;

LENSTRA, JK ;

RINNOOYKAN, AHG .

MANAGEMENT SCIENCE, 1980, 26 (07) :669-679

[7] AN O(N2(M+NLOGN)LOGN) MIN-COST FLOW ALGORITHM [J].

GALIL, Z ;

TARDOS, E .

JOURNAL OF THE ACM, 1988, 35 (02) :374-386

[8] A FULLY POLYNOMIAL-APPROXIMATION SCHEME FOR SINGLE-PRODUCT SCHEDULING IN A FINITE-CAPACITY FACILITY [J].

GAVISH, B ;

JOHNSON, RE .

OPERATIONS RESEARCH, 1990, 38 (01) :70-83

[9] Production planning and control for remanufacturing: industry practice and research needs [J].

Guide, VDR .

JOURNAL OF OPERATIONS MANAGEMENT, 2000, 18 (04) :467-483

[10] Supply-chain management for recoverable manufacturing systems [J].

Guide, VDR ;

Jayaraman, V ;

Srivastava, R ;

Benton, WC .

INTERFACES, 2000, 30 (03) :125-142

← 1 2 →