A concave-cost production planning problem with remanufacturing options

Jian Yang, Boaz Golany, Gang Yu

Research output: Contribution to journalReview articlepeer-review

43 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)443-458
Number of pages16
JournalNaval Research Logistics
Issue number5
StatePublished - Aug 2005
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research


  • Heuristics
  • Production planning
  • Remanufacturing

Fingerprint Dive into the research topics of 'A concave-cost production planning problem with remanufacturing options'. Together they form a unique fingerprint.

Cite this