Lot sizing in reverse MRP for scheduling disassembly

Gupta and Taleb (1994. Scheduling disassembly. International Journal of Production Research , 32(8), 1857–1866) presented an algorithm for reverse MRP that can be applied to a product structure in which there is a certain demand for components and a need to know the number of products to disassemble...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production economics Vol. 111; no. 2; pp. 741 - 751
Main Authors Barba-Gutiérrez, Y., Adenso-Díaz, B., Gupta, S.M.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.02.2008
Elsevier
Elsevier Sequoia S.A
SeriesInternational Journal of Production Economics
Subjects
Algorithms
Components
Lot sizing
Material requirements planning
MRP
Reverse logistics
Scheduling
Studies
MRP
Lot sizing
Reverse logistics
Online AccessGet full text

Cover

More Information
Summary:Gupta and Taleb (1994. Scheduling disassembly. International Journal of Production Research , 32(8), 1857–1866) presented an algorithm for reverse MRP that can be applied to a product structure in which there is a certain demand for components and a need to know the number of products to disassemble in order to fulfil the demand for those components. However, that algorithm did not consider lot sizing at all. Incorporating lot sizing makes the problem a great deal more challenging in disassembly situations because of the disparity between the number of components present in the product and the demand of the components. This is because the demand for the components is often not in the same proportion as their existence in the product structure causing excess inventories for the components with low demand compared to their brother items. In this paper we present an algorithm for reverse MRP to facilitate the use of lot sizing. An example is presented and its implementation is analysed.
ISSN:0925-5273
1873-7579
DOI:10.1016/j.ijpe.2007.03.017