A concave-cost production planning problem with remanufacturing options

Document Type

Article

Publication Date

8-1-2005

Abstract

We focus on the concave-cost version of a production planning problem where a manufacturer can meet demand by either producing new items or by remanufacturing used items. Unprocessed used items are disposed. We show the NP-hardness of the problem even when all the costs are stationary. Utilizing the special structure of the extreme-point optimal solutions for the minimum concave-cost problem with a network flow type feasible region, we develop a polynomial-time heuristic for the problem. Our computational study indicates that the heuristic is a very efficient way to solve the problem as far as solution speed and quality are concerned. © 2005 Wiley Periodicals, Inc.

Identifier

24144492367 (Scopus)

Publication Title

Naval Research Logistics

External Full Text Location

https://doi.org/10.1002/nav.20089

ISSN

0894069X

First Page

443

Last Page

458

Issue

5

Volume

52

This document is currently not available here.

Share

COinS