Economic lot-sizing with remanufacturing options

Boaz Golany; Jian Yang; Gang Yu

doi:10.1080/07408170108936890

Economic lot-sizing with remanufacturing options

Boaz Golany, Jian Yang, Gang Yu

Data and Decision Sciences

Research output: Contribution to journal › Article › peer-review

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 ³) 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.

Original language	English
Pages (from-to)	995-1003
Number of pages	9
Journal	IIE Transactions (Institute of Industrial Engineers)
Volume	33
Issue number	11
DOIs	https://doi.org/10.1080/07408170108936890
State	Published - 2001

ASJC Scopus subject areas

Industrial and Manufacturing Engineering

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1080/07408170108936890

Cite this

@article{6709d68cb3b2452d8a81a8487d3357a6,

title = "Economic lot-sizing with remanufacturing options",

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.",

author = "Boaz Golany and Jian Yang and Gang Yu",

year = "2001",

doi = "10.1080/07408170108936890",

language = "אנגלית",

volume = "33",

pages = "995--1003",

number = "11",

}

TY - JOUR

T1 - Economic lot-sizing with remanufacturing options

AU - Golany, Boaz

AU - Yang, Jian

AU - Yu, Gang

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77953626347&partnerID=8YFLogxK

U2 - 10.1080/07408170108936890

DO - 10.1080/07408170108936890

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:77953626347

SN - 0740-817X

VL - 33

SP - 995

EP - 1003

JO - IIE Transactions (Institute of Industrial Engineers)

JF - IIE Transactions (Institute of Industrial Engineers)

IS - 11

ER -

Economic lot-sizing with remanufacturing options

Abstract

ASJC Scopus subject areas

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this