Economic lot sizing with remanufacturing: Structural properties and polynomial-time heuristics

Onur A. Kilic and Wilco van den Heuvel

IISE Transactions, 2019, vol. 51, issue 12, 1318-1331

Abstract: We consider the economic lot sizing problem with remanufacturing, an NP-hard problem which appears in integrated manufacturing and remanufacturing systems. We identify the network flow structure of the problem and derive important properties of its optimal solution. These properties are used to decompose the problem and to show that the resulting subproblems can be solved in polynomial-time. However, the number of subproblems to be solved is exponential, which we overcome by evaluating a limited set of subproblems such that the overall complexity is kept polynomial. This approach leads to a class of polynomial-time heuristics, where the time complexity depends on how the set of subproblems are chosen and how individual subproblems are solved. As a result, a trade-off can be made between computation time and solution quality. A numerical study, where we compare several heuristics within our class of heuristics, shows that our heuristics provide almost optimal solutions and significantly outperform earlier heuristics.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/24725854.2019.1593555 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:51:y:2019:i:12:p:1318-1331

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/24725854.2019.1593555

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().