A Label Correcting Algorithm for Partial Disassembly Sequences in the Production Planning for End-of-Life Products

Remanufacturing of used products has become a strategic issue for cost-sensitive businesses. Due to the nature of uncertain supply of end-of-life (EoL) products, the reverse logistic can only be sustainable with a dynamic production planning for disassembly process. This research investigates the se...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical Problems in Engineering 2012-01, Vol.2012 (2012), p.1031-1043-359
Main Author: Tsai, Pei-Fang (Jennifer)
Format: Article
Language:English
Subjects:
Algorithms
Disassembly
Disassembly sequences
Dismantling
End of life
Engineering
Graphical representations
Heuristic
Labels
Mathematical models
Operations research
Optimization
Polynomials
Production planning
Remanufacturing
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Remanufacturing of used products has become a strategic issue for cost-sensitive businesses. Due to the nature of uncertain supply of end-of-life (EoL) products, the reverse logistic can only be sustainable with a dynamic production planning for disassembly process. This research investigates the sequencing of disassembly operations as a single-period partial disassembly optimization (SPPDO) problem to minimize total disassembly cost. AND/OR graph representation is used to include all disassembly sequences of a returned product. A label correcting algorithm is proposed to find an optimal partial disassembly plan if a specific reusable subpart is retrieved from the original return. Then, a heuristic procedure that utilizes this polynomial-time algorithm is presented to solve the SPPDO problem. Numerical examples are used to demonstrate the effectiveness of this solution procedure.
ISSN:1024-123X
1563-5147
DOI:10.1155/2012/569429