TY - UNPB

T1 - Economic lot scheduling problem with returns

AU - Tang, O

AU - Teunter, R H

PY - 2006

Y1 - 2006

N2 - Motivated by a case study of a company that produces car parts, we study the multi-product economic lot scheduling problem for a hybrid production line with manufacturing of new products and remanufacturing of returned products. For this economic lot scheduling problem with returns (ELSPR), we consider policies with a common cycle time for all products, and with one manufacturing lot and one remanufacturing lot for each product during a cycle. For a given cycle time, the problem is formulated as a mixed integer linear programming (MIP) problem, which provides the basis for an exact algorithm. The application of this algorithm for one of the core products of the case study company indicates a 16% reduction in cost compared to the current lot scheduling policy.

AB - Motivated by a case study of a company that produces car parts, we study the multi-product economic lot scheduling problem for a hybrid production line with manufacturing of new products and remanufacturing of returned products. For this economic lot scheduling problem with returns (ELSPR), we consider policies with a common cycle time for all products, and with one manufacturing lot and one remanufacturing lot for each product during a cycle. For a given cycle time, the problem is formulated as a mixed integer linear programming (MIP) problem, which provides the basis for an exact algorithm. The application of this algorithm for one of the core products of the case study company indicates a 16% reduction in cost compared to the current lot scheduling policy.

KW - ELSP

KW - returns

KW - remanufacturing

KW - reverse logistics

M3 - Working paper

T3 - Management Science Working Paper Series

BT - Economic lot scheduling problem with returns

PB - The Department of Management Science

CY - Lancaster University

ER -