Economic lot-sizing with remanufacturing options

Document Type

Article

Publication Date

1-1-2001

Abstract

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 0(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. © 2001, Taylor & Francis Group, LLC.

Identifier

77953626347 (Scopus)

Publication Title

IIE Transactions Institute of Industrial Engineers

External Full Text Location

https://doi.org/10.1080/07408170108936890

e-ISSN

15458830

ISSN

0740817X

First Page

995

Last Page

1003

Issue

11

Volume

33

This document is currently not available here.

Share

COinS