##
**A label correcting algorithm for partial disassembly sequences in the production planning for end-of-life products.**
*(English)*
Zbl 1264.90084

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.

PDF
BibTeX
XML
Cite

\textit{P.-F. Tsai}, Math. Probl. Eng. 2012, Article ID 569429, 13 p. (2012; Zbl 1264.90084)

Full Text:
DOI

### References:

[1] | H. Griese, H. Poetter, K. Schischke, O. Ness, and H. Reichl, “Reuse and lifetime extension strategies in the context of technology innovations, global markets, and environmental legislation,” in Proceedings of the IEEE International Symposium on Electronics and the Environment, pp. 173-178, Washington, DC, USA, May 2004. |

[2] | E. J. Grenchus, R. A. Keene, and C. R. Nobs, “A decade of processing end of life IT equipment-lessons learned at the IBM\(^{TM}\) endicott asset recovery center,” in Proceedings of the IEEE International Symposium on Electronics and the Environment, pp. 195-198, Washington, DC, USA, May 2004. |

[3] | M. Fleischmann, Quantitative Models for Reverse Logistics, Springer, New York, NY, USA, 2001. · Zbl 0966.90037 |

[4] | E. Grenchus, S. Johnson, and D. McDonnell, “Improving environmental performance through reverse logistics at IBM,” in Proceedings of the IEEE International Symposium on Electronics and the Environment, pp. 236-240, May 2001. |

[5] | V. D. R. Guide Jr., “Production planning and control for remanufacturing: industry practice and research needs,” Journal of Operations Management, vol. 18, no. 4, pp. 467-483, 2000. |

[6] | A. Kasmara, M. Muraki, S. Matsuoka, A. Sukoyo, and K. Suryadi, “Production planning in remanufacturing/ manufacturing production system,” in Proceedings of the 2nd International Symposium on Environmentally Conscious Design and Inverse Manufacturing, pp. 708-713, 2001. |

[7] | A. J. Clegg, D. J. Williams, and R. Uzsoy, “Production planning for companies with remanufacturing capability,” in Proceedings of the IEEE International Symposium on Electronics and the Environment (ISEE ’95), pp. 186-191, May 1995. |

[8] | V. D. R. Guide Jr., “Scheduling using drum-buffer-rope in a remanufacturing environment,” International Journal of Production Research, vol. 34, no. 4, pp. 1081-1091, 1996. · Zbl 0947.90529 |

[9] | V. D. R. Guide Jr. and M. S. Spencer, “Rough-cut capacity planning for remanufacturing firms,” Production Planning and Control, vol. 8, no. 3, pp. 237-244, 1997. |

[10] | V. Daniel, V. D. R. Guide Jr., and R. Srivastava, “An evaluation of order release strategies in a remanufacturing environment,” Computers and Operations Research, vol. 24, no. 1, pp. 37-47, 1997. · Zbl 0881.90064 |

[11] | V. D. R. Guide Jr., R. Srivastava, and M. E. Kraus, “Product structure complexity and scheduling of operations in recoverable manufacturing,” International Journal of Production Research, vol. 35, no. 11, pp. 3179-3199, 1997. · Zbl 0942.90538 |

[12] | V. D. R. Guide Jr., M. E. Kraus, and R. Srivastava, “Scheduling policies for remanufacturing,” International Journal of Production Economics, vol. 48, no. 2, pp. 187-204, 1997. |

[13] | M. E. Ketzenberg, G. C. Souza, and V. D. R. Guide Jr., “Mixed assembly and disassembly operations for remanufacturing,” Production and Operations Management, vol. 12, no. 3, pp. 320-335, 2003. |

[14] | P. Dewhurst, “Product design for manufacture: design for disassembly,” Industrial Engineering, vol. 25, no. 9, pp. 26-28, 1993. |

[15] | K. N. Taleb and S. M. Gupta, “Disassembly of multiple product structures,” Computers and Industrial Engineering, vol. 32, no. 4, pp. 949-961, 1997. |

[16] | I. M. Langella, “Heuristics for demand-driven disassembly planning,” Computers and Operations Research, vol. 34, no. 2, pp. 552-577, 2007. · Zbl 1109.90012 |

[17] | A. Gungor and S. M. Gupta, “An evaluation methodology for disassembly processes,” Computers and Industrial Engineering, vol. 33, no. 1-2, pp. 329-332, 1997. |

[18] | D. Navin-Chandra, “The recovery problem in product design,” Journal of Engineering Design, vol. 5, no. 1, pp. 65-86, 1994. |

[19] | S. C. Sarin, H. D. Sherali, and A. Bhootra, “A precedence-constrained asymmetric traveling salesman model for disassembly optimization,” IIE Transactions, vol. 38, no. 3, pp. 223-237, 2006. |

[20] | M. R. Johnson and M. H. Wang, “Economical evaluation of disassembly operations for recycling, remanufacturing and reuse,” International Journal of Production Research, vol. 36, no. 12, pp. 3227-3252, 1998. · Zbl 0946.90507 |

[21] | A. J. D. Lambert, “Optimizing disassembly processes subjected to sequence-dependent cost,” Computers and Operations Research, vol. 34, no. 2, pp. 536-551, 2007. · Zbl 1113.90029 |

[22] | T. L. De Fazio and D. E. Whitney, “Simplified generation of all mechanical assembly sequences,” IEEE Journal of Robotics and Automation, vol. 3, no. 6, pp. 640-658, 1987. |

[23] | H. C. Zhang and T. C. Kuo, “Graph-based approach to disassembly model for end-of-life product recycling,” in Proceedings of the IEEE/CPMT 19th International Electronics Manufacturing Technology Symposium, pp. 247-254, October 1996. |

[24] | T. C. Kuo, “Disassembly sequence and cost analysis for electromechanical products,” Robotics and Computer-Integrated Manufacturing, vol. 16, no. 1, pp. 43-54, 2000. |

[25] | L. S. Homem de Mello and A. C. Sanderson, “AND/OR graph representation of assembly plans,” IEEE Transactions on Robotics and Automation, vol. 6, no. 2, pp. 188-199, 1990. |

[26] | L. S. Homem de Mello and A. C. Sanderson, “A correct and complete algorithm for the generation of mechanical assembly sequences,” IEEE Transactions on Robotics and Automation, vol. 7, no. 2, pp. 228-240, 1991. |

[27] | A. J. D. Lambert, “Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs,” Omega, vol. 34, no. 6, pp. 538-549, 2006. |

[28] | C. L. Chang and J. R. Slagle, “An admissible and optimal algorithm for searching AND/OR graphs,” Artificial Intelligence, vol. 2, no. 2, pp. 117-128, 1971. · Zbl 0227.68016 |

[29] | G. Levi and F. Sirovich, “Generalized and/or graphs,” Artificial Intelligence, vol. 7, no. 3, pp. 243-259, 1976. · Zbl 0333.68063 |

[30] | R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, USA, 1993. · Zbl 1201.90001 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.