Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 949527, 10 pages
http://dx.doi.org/10.1155/2014/949527
Research Article

A Heuristic for Disassembly Planning in Remanufacturing System

Department of Information & Industrial Engineering, Yonsei University, 50 Yonsei-ro, Sinchon-dong, Seoul 120-749, Republic of Korea

Received 24 January 2014; Accepted 11 March 2014; Published 23 April 2014

Academic Editors: E. K. Aydoğan, J. G. Barbosa, and D. Oron

Copyright © 2014 Jinmo Sung and Bongju Jeong. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. 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. View at Publisher · View at Google Scholar · View at Scopus
  2. 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. View at Publisher · View at Google Scholar · View at Scopus
  3. A. J. D. Lambert, “Optimal disassembly of complex products,” International Journal of Production Research, vol. 35, no. 9, pp. 2509–2523, 1997. View at Google Scholar · View at Scopus
  4. S. M. Gupta and K. N. Taleb, “Scheduling disassembly,” International Journal of Production Research, vol. 32, no. 8, pp. 1857–1866, 1994. View at Google Scholar
  5. T. F. Go, D. A. Wahab, M. N. A. Rahman, R. Ramli, and C. H. Azhari, “Disassemblability of end-of-life vehicle: a critical review of evaluation methods,” Journal of Cleaner Production, vol. 19, no. 13, pp. 1536–1546, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. A. J. D. Lambert, “Linear programming in disassembly/clustering sequence generation,” Computers and Industrial Engineering, vol. 36, no. 4, pp. 723–738, 1999. View at Publisher · View at Google Scholar · View at Scopus
  7. F. J. D. Lambert, “Optimum disassembly sequence generation,” in Environmentally Concious Manufacturing, vol. 4193 of Proceedings of SPIE, pp. 56–67, Society of Photographic Instrumentation Engineers, Boston, Mass, USA, February 2001. View at Publisher · View at Google Scholar · View at Scopus
  8. A. J. D. Lambert, “Optimizing disassembly processes subjected to sequence-dependent cost,” Computers and Operations Research, vol. 34, no. 2, pp. 536–551, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. Y. Barba-Gutiérrez, B. Adenso-Díaz, and S. M. Gupta, “Lot sizing in reverse MRP for scheduling disassembly,” International Journal of Production Economics, vol. 111, no. 2, pp. 741–751, 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. P. Veerakamolmal and S. M. Gupta, “Design of an integrated component recovery system,” in Proceedings of the IEEE International Symposium on Electronics and the Environment (ISEE '98), pp. 264–269, May 1998. View at Scopus
  11. P. Veerakamolmal and S. M. Gupta, “High-mix/low-volume batch of electronic equipment disassembly,” Computers and Industrial Engineering, vol. 35, no. 1-2, pp. 65–68, 1998. View at Google Scholar · View at Scopus
  12. P. Veerakamolmal and S. M. Gupta, “Analysis of design efficiency for the disassembly of modular electronic products,” Journal of Electronics Manufacturing, vol. 9, no. 1, pp. 79–95, 2000. View at Google Scholar · View at Scopus
  13. D.-H. Lee and P. Xirouchakis, “A two-stage heuristic for disassembly scheduling with assembly product structure,” Journal of the Operational Research Society, vol. 55, no. 3, pp. 287–297, 2004. View at Publisher · View at Google Scholar · View at Scopus
  14. H. Kim, D. Lee, and P. Xirouchakis, “A Lagrangean relaxation approach for capacitated disassembly scheduling,” in Proceedings of the International Conference on Computational Science and Its Applications (ICCSA '05), pp. 722–732, May 2005. View at Scopus
  15. H.-J. Kim, D.-H. Lee, P. Xirouchakis, and O. K. Kwon, “A branch and bound algorithm for disassembly scheduling with assembly product structure,” Journal of the Operational Research Society, vol. 60, no. 3, pp. 419–430, 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. F. Modigliani and F. E. Hohn, “Production planning over time,” Econometrica, vol. 23, no. 1, pp. 46–66, 1955. View at Google Scholar
  17. S. Chand, V. N. Hsu, and S. Sethi, “Forecast, solution, and rolling horizons in operations management problems: a classified bibliography,” Manufacturing and Service Operations Management, vol. 4, no. 1, pp. 25–43, 2002. View at Google Scholar · View at Scopus
  18. L. B. Schwarz, “A note on the near optimality of 5-EOQ’s worth forecast horizons,” Operations Research, vol. 25, pp. 533–536, 1977. View at Google Scholar
  19. J. Blackburn and R. Millen, “Heuristic lot-sizing performance in a rolling schedule environment,” Decision Sciences, vol. 11, pp. 691–701, 1980. View at Google Scholar
  20. S. Chand, “A note on dynamic lot sizing in rolling horizon environments,” Decision Sciences, vol. 13, pp. 113–119, 1982. View at Google Scholar
  21. A. Federgruen and M. Tzur, “Dynamic lot-sizing model with backlogging. A simple O(n log n) algorithm and minimal forecast horizon procedure,” Naval Research Logistics, vol. 40, no. 4, pp. 459–478, 1993. View at Google Scholar · View at Scopus
  22. K. Kim, I. Song, J. Kim, and B. Jeong, “Supply planning model for remanufacturing system in reverse logistics environment,” Computers and Industrial Engineering, vol. 51, no. 2, pp. 279–287, 2006. View at Publisher · View at Google Scholar · View at Scopus
  23. 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. View at Publisher · View at Google Scholar · View at Scopus