Methods for optimum and near optimum disassembly sequencing

International Journal of Production Research

Volumn 46, Issue 11, 2008, Pages 2845-2865

  Lambert, A J D ^a   Gupta, Surendra M ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Disassembly; Heuristics; Modelling; Operational research; Operations planning; Optimization; Sequencing

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION;

MEDIUM SIZED PROBLEMS; OPTIMUM SOLUTIONS;

PROBLEM SOLVING;

EID: 41849102340     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540601120484     Document Type: Article

References (18)

1. Bourjault, A., Contribution à une approche méthodologique de l'assemblage automatisé: elaboration automatique des séquences opératoires. PhD thesis, Université de Franche-Comté, 1984. (In French).
2. Caccia, C. and Pozzetti, A., A genetic algorithm for disassembly strategy definition, in Proceedings of SPIE Conference on Environmentally Conscious Manufacturing, 2000, pp. 68-77.
3. Gungor, A. and Gupta, S.M., An evaluation methodology for disassembly processes. Comp. Indus. Eng., 1997, 33, 329-332.
4. Gungor, A. and Gupta, S.M., Disassembly sequence plan generation using a branch-and-bound algorithm. Int. J. Prod. Res., 2001, 39, 481-509.
5. Gupta, S.M., Erbis, E. and McGovern, S.M., Disassembly sequencing problem: a case study of a cell phone, in Proceedings of the SPIE Conference on Environmentally Conscious Manufacturing IV, 2004, pp. 43-52.
6. Johnson, M.R. and Wang, M.H., Economical evaluation of disassembly operations for recycling, remanufacturing, and reuse. Int. J. Prod. Res., 1998, 36, 3227-3252.
7. Jünger, M., Reinelt, G. and Rinaldi, G., The Travelling Salesman Problem. In Network Models, edited by M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser, Chapter 4, 1995 (Elsevier: Amsterdam).
8. Kang, J.G., Lee, D.H., Xirouchakis, P. and Persson, J.G., Parallel disassembly sequencing with sequence-dependent operation times. Ann. CIRP, 2001, 50, 343-346.
9. Lambert, A.J.D., Exact methods in disassembly sequencing as a benchmark for heuristic algorithms, in Proceedings of the SPIE Conference on Environmentally Conscious Manufacturing IV, Philadelphia, PA, October 2004, Vol. 5583, pp. 1-11.
10. Lambert, A.J.D., Exact method for disassembly sequence optimization subjected to sequence dependent costs. Int. J. Oper. Quant. Manag., 2005, 11, 91-114.
11. Lambert, A.J.D., Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs. Omega, 2006, 34, 538-549.
12. Lambert, A.J.D., Optimizing disassembly processes subjected to sequence dependent cost. Comp. Oper. Res., 2007, 34, 536-551.
13. Lambert, A.J.D. and Gupta, S.M., Disassembly Modelling for Assembly, Maintenance, Reuse, and Recycling, 2005a (CRC Press: Boca Raton, FL).
14. Lambert, A.J.D. and Gupta, S.M., Determining optimum and suboptimum disassembly sequences with an application to a cell phone, in Proceedings of the 6th IEEE International Symposium on Assembly and Task Planning, 2005b, pp. 260-265.
15. Roseli, J., Munoz, N. and Gambin, A., Robot tasks sequence planning using Petri nets, in Proceedings of the 5th IEEE International Symposium on Assembly and Task Planning, 2003, pp. 151-156.
16. Santochi, M., Dini, G. and Failli, F., Computer aided disassembly planning: state of the art and perspectives. Ann. CIRP, 2001, 50, 507-529.
17. Uchiyama, N., Arai, E. and Ingoshi, M., Generation of mechanical assembly sequences considering different evaluation viewpoints. In Advancement of Intelligent Production, edited by E. Usui, pp. 703-706, 1994 (Elsevier Science/The Japan Society for Precision Engineering).
18. Yee, S.T. and Ventura, J.A., A Petri net model to determine optimal assembly sequences with assembly operation constraints. J. Manuf Sys., 1999, 18, 203-213.