A computational study of lower bounds for the economic lot-sizing with remanufacturing and joint setups

This paper investigates economic lot-sizing problem with remanufacturing and joint setup, where new and remanufactured are produced on a single production line. In each time period, the known quantities of used products are returned from customers and restored to like-new conditions. Customer demand...

Full description

Saved in:
Bibliographic Details
Main Authors: Ali, Sharifah Aishah Syed, Anuar, Mohd Syazwan Mohamad, Majid, Khairani Abdul
Format: Conference Proceeding
Language:English
Subjects:
Customer satisfaction
Customers
Lot sizing
Lower bounds
Production scheduling
Remanufacturing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper investigates economic lot-sizing problem with remanufacturing and joint setup, where new and remanufactured are produced on a single production line. In each time period, the known quantities of used products are returned from customers and restored to like-new conditions. Customer demands can be satisfied by both remanufactured and new products. As this problem falls into the NP-hard class, there is a need to find efficient solution technique to solve this problem. Therefore, we examine different approaches to obtain better lower bounds (a) an extended formulations, namely a facility location (FL) reformulation; and (b) a strengthened (ℓ, S) – like inequalities. In order to test the effectiveness of these formulations, we perform a computational study, comparing each of the formulations on a large number of data sets available in the literature. The numerical results show that the lower bounds of the strengthened formulation outperforms all other tested approaches. Finally, we suggest some directions for future research.
ISSN:0094-243X
1551-7616
DOI:10.1063/1.5136375