Heuristic procedure for the economic lot-sizing problem with remanufacturing and recovery targets

Heuristic procedure for the economic lot-sizing problem with remanufacturing and recovery targets We address a production-remanufacturing planning problem of a single item with recovery targets stated as a lower bound on the numbers of returns that must be remanufactured. This problem can arise in practice if there are legal or market pressures. We show that this problem extension can be considered a generalization of the traditional problem without recovery targets, which is a well-known NP-hard problem even for the cost structure considered in this paper. A polynomial-time heuristic procedure is suggested, with different criteria for determining the periods with positive remanufacturing, which results in two different variants of the heuristic. To evaluate the heuristic, we extend a benchmark set of large instances of the literature in order to include different cost and recovery target settings. The results obtained from the numerical experiment allow us to conclude that the heuristic is cost- and time-effective for many scenarios of cost and recovery targets. However, the performance of the heuristic decreases as recovery targets increase. In addition, we note that our heuristic is able to achieve an optimal solution for many instances, even with a higher remanufacturing rate than the optimal solution obtained by a commercial solver. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Remanufacturing Springer Journals

Heuristic procedure for the economic lot-sizing problem with remanufacturing and recovery targets

Loading next page...
1
 
/lp/springer_journal/heuristic-procedure-for-the-economic-lot-sizing-problem-with-kL0ARpPyR4
Publisher
Springer Netherlands
Copyright
Copyright © 2018 by Springer Science+Business Media B.V., part of Springer Nature
Subject
Engineering; Engineering, general; Sustainable Development; Waste Management/Waste Technology; Business and Management, general; Environmental Management
eISSN
2210-4690
D.O.I.
10.1007/s13243-018-0044-z
Publisher site
See Article on Publisher Site

Abstract

We address a production-remanufacturing planning problem of a single item with recovery targets stated as a lower bound on the numbers of returns that must be remanufactured. This problem can arise in practice if there are legal or market pressures. We show that this problem extension can be considered a generalization of the traditional problem without recovery targets, which is a well-known NP-hard problem even for the cost structure considered in this paper. A polynomial-time heuristic procedure is suggested, with different criteria for determining the periods with positive remanufacturing, which results in two different variants of the heuristic. To evaluate the heuristic, we extend a benchmark set of large instances of the literature in order to include different cost and recovery target settings. The results obtained from the numerical experiment allow us to conclude that the heuristic is cost- and time-effective for many scenarios of cost and recovery targets. However, the performance of the heuristic decreases as recovery targets increase. In addition, we note that our heuristic is able to achieve an optimal solution for many instances, even with a higher remanufacturing rate than the optimal solution obtained by a commercial solver.

Journal

Journal of RemanufacturingSpringer Journals

Published: May 28, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off