Scheduling disassembly
International Journal of Production ResearchPublished 1 August 1994
Surendra M. Gupta, Karim N. Taleb
Citations224
SJR quartileQ1
SJR score2.24
SNIP2.56
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We present an algorithm for scheduling the disassembly of discrete parts products characterized by a well defined product structure. As opposed to MRP where the demand occurs at the end item level, the demand in the disassembly case is motivated by the component level of the product structure. Even though the objective in the disassembly case is the reverse of that of MRP, the algorithm itself is not the reverse of the MRP algorithm. It is considerably more complicated. An example is presented and its implementation in a spreadsheet is described.
Keywords
EngineeringBusiness, Management and Accounting
Production and Operations Analysis
1,233 Citations1992Steven Nahmias
Chapter 1 Strategy and Competition Chapter 2 Forecasting Chapter 3 Aggregate Planning Supplement 1 Linear Programming Chapter 4 Inventory Control Subject to Known Demand Chapter 5 Inventory Control subject to Uncertain Demand Chapter 6 Supply Chain Management Chapter 7 Push and Pull Production Control Systems: MRP and JIT.