Home > Research > Publications & Outputs > Heuristics for the economic lot scheduling prob...

Research

Electronic data

Links

Text available via DOI:

Keywords

View graph of relations

Heuristics for the economic lot scheduling problem with returns

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Heuristics for the economic lot scheduling problem with returns. / Teunter, Ruud; Tang, Ou; Kaparis, Konstantinos.
In: International Journal of Production Economics, Vol. 118, No. 1, 03.2009, p. 323-330.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Teunter, R, Tang, O & Kaparis, K 2009, 'Heuristics for the economic lot scheduling problem with returns', International Journal of Production Economics, vol. 118, no. 1, pp. 323-330. https://doi.org/10.1016/j.ijpe.2008.08.036

APA

Teunter, R., Tang, O., & Kaparis, K. (2009). Heuristics for the economic lot scheduling problem with returns. International Journal of Production Economics, 118(1), 323-330. https://doi.org/10.1016/j.ijpe.2008.08.036

Vancouver

Teunter R, Tang O, Kaparis K. Heuristics for the economic lot scheduling problem with returns. International Journal of Production Economics. 2009 Mar;118(1):323-330. doi: 10.1016/j.ijpe.2008.08.036

Author

Teunter, Ruud ; Tang, Ou ; Kaparis, Konstantinos. / Heuristics for the economic lot scheduling problem with returns. In: International Journal of Production Economics. 2009 ; Vol. 118, No. 1. pp. 323-330.

Bibtex

@article{c355a98d708c45ac9d91d2c8f7bd1603,
title = "Heuristics for the economic lot scheduling problem with returns",
abstract = "We study the multi-item economic lot scheduling problem (ELSP) with two sources of production: manufacturing of new items and remanufacturing of returned items. Manufacturing and remanufacturing operations are performed on the same production line. Tang and Teunter [2006. Economic lot scheduling problem with returns. Production and Operations Management 15 (4), 488–497.] recently presented a complex algorithm for this problem that determines the optimal solution within the class of policies with a common cycle time and a single (re)manufacturing lot for each item in each cycle. This algorithm is rather complex and time consuming, combining a large MIP formulation with a search procedure, and may therefore not always be practical. In this paper, we deal with this type of problems and propose simple heuristics that are very fast and can be applied in a spreadsheet package. A large numerical study shows that the heuristics provide close to optimal solutions.",
keywords = "ELSP, Returns , Remanufacturing , Reverse logistics",
author = "Ruud Teunter and Ou Tang and Konstantinos Kaparis",
year = "2009",
month = mar,
doi = "10.1016/j.ijpe.2008.08.036",
language = "English",
volume = "118",
pages = "323--330",
journal = "International Journal of Production Economics",
issn = "0925-5273",
publisher = "Elsevier Science B.V.",
number = "1",

}

RIS

TY - JOUR

T1 - Heuristics for the economic lot scheduling problem with returns

AU - Teunter, Ruud

AU - Tang, Ou

AU - Kaparis, Konstantinos

PY - 2009/3

Y1 - 2009/3

N2 - We study the multi-item economic lot scheduling problem (ELSP) with two sources of production: manufacturing of new items and remanufacturing of returned items. Manufacturing and remanufacturing operations are performed on the same production line. Tang and Teunter [2006. Economic lot scheduling problem with returns. Production and Operations Management 15 (4), 488–497.] recently presented a complex algorithm for this problem that determines the optimal solution within the class of policies with a common cycle time and a single (re)manufacturing lot for each item in each cycle. This algorithm is rather complex and time consuming, combining a large MIP formulation with a search procedure, and may therefore not always be practical. In this paper, we deal with this type of problems and propose simple heuristics that are very fast and can be applied in a spreadsheet package. A large numerical study shows that the heuristics provide close to optimal solutions.

AB - We study the multi-item economic lot scheduling problem (ELSP) with two sources of production: manufacturing of new items and remanufacturing of returned items. Manufacturing and remanufacturing operations are performed on the same production line. Tang and Teunter [2006. Economic lot scheduling problem with returns. Production and Operations Management 15 (4), 488–497.] recently presented a complex algorithm for this problem that determines the optimal solution within the class of policies with a common cycle time and a single (re)manufacturing lot for each item in each cycle. This algorithm is rather complex and time consuming, combining a large MIP formulation with a search procedure, and may therefore not always be practical. In this paper, we deal with this type of problems and propose simple heuristics that are very fast and can be applied in a spreadsheet package. A large numerical study shows that the heuristics provide close to optimal solutions.

KW - ELSP

KW - Returns

KW - Remanufacturing

KW - Reverse logistics

U2 - 10.1016/j.ijpe.2008.08.036

DO - 10.1016/j.ijpe.2008.08.036

M3 - Journal article

VL - 118

SP - 323

EP - 330

JO - International Journal of Production Economics

JF - International Journal of Production Economics

SN - 0925-5273

IS - 1

ER -