Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

Minmax Regret Approach to Disassembly Sequence Planning with Interval Data

불확실성 하에서 최대후회 최소화 분해 계획

  • Kang, Jun-Gyu (Department of Industrial Engineering, Sungkyul University)
  • 강준규 (성결대학교 산업경영공학부)
  • Published : 2009.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde's heuristic algorithm.

Keywords

References

  1. 유호현; “일본 사례를 통해 본 도시광산의 미래”, LG Business Insight：LG경제연구원, 1038：48-54, 2009
  2. Aissi, H., Bazgan, C., and Vanderpooten, D.; “Min-max and min-max regret versions of combinatorial optimization problems：A survey,” European Journal of Operational Research, 197(2)：427-438, 2009 https://doi.org/10.1016/j.ejor.2008.09.012
  3. Assavapokee, T. and Realff, M. J.; “Min-Max Regret Robust Optimization Approach on Interval Data Uncertainty,” Journal of Optimization Theory and Applications, 137(2)：297-316, 2008 https://doi.org/10.1007/s10957-007-9334-6
  4. Averbakh, I. and Lebedev, V.; “Interval data minmax regret network optimization problems,” Discrete Applied Mathematics, 138：289-301, 2004 https://doi.org/10.1016/S0166-218X(03)00462-1
  5. Averbakh, I. and Lebedev, V.; “On the complexity of minmax regret linear programming,” European Journal of Operational Research, 160(1)：227-231, 2005 https://doi.org/10.1016/j.ejor.2003.07.007
  6. Bourjault, A.; “Contribution à une approche méthodologique de l'assemblage automatisé：elaboration automatique des séquences opératoires.” Besançon：Université de Franche-Comté, Ph.D. thesis, 1984
  7. Chanas, S. and Zieliński, P.; “The computational complexity of the criticality problems in a network with interval activity times,” European Journal Of Operational Research, 136(3)：541-550, 2002 https://doi.org/10.1016/S0377-2217(01)00048-0
  8. Chanas, s. and Zieliński, P.; “On the hardness of evaluating criticality of activities in a planar network with duration intervals,” Operations Research Letters, 31(1)：53-59, 2003 https://doi.org/10.1016/S0167-6377(02)00174-8
  9. Chevron, D., Binder, Z., Perret, R., and Horacek, P.; “Disassembling Process Modelling and Operations Planning under Imprecise Operation Time,” 13th IFAC World Congress, san Francisco, 367-372, 1996
  10. Conde, E.; “A minmax regret approach to the critical path method with task interval times,” European Journal of Operational Research, 197(1)：235-242, 2009 https://doi.org/10.1016/j.ejor.2008.06.022
  11. Eppstein, D.; “Finding the k shortest paths,” SIAM Journal on Computing, 28(2)：652-673, 1998 https://doi.org/10.1137/S0097539795290477
  12. Erdös, G. and Kis, T.; “Disassembly sequence planning for products with defective parts in product recovery,” International Journal of Production Research, 39：1203-1220, 2001 https://doi.org/10.1080/713845985
  13. Homem De Mello, L. S. and Sanderson, A. C.; "A Correct and Compete Algorithm for the generation of Mechanical Assembly sequences," IEEE Transactions on Robotics and Automation, 7：228-240, 1991 https://doi.org/10.1109/70.75905
  14. Inuiguchi, M. and Sakawa, M.; “Minimax Regret Solution To Linear-Programming Problems with An Interval Objective Function,” European Journal Of Operational Research, 86(3)：526-536, 1995 https://doi.org/10.1016/0377-2217(94)00092-Q
  15. Johnson, M. R. and Wang, M. H.; “Economical evaluation of disassembly operations for recycling, remanufacturing and reuse,” International Journal of Production Research, 36(12)：3227-3252, 1998 https://doi.org/10.1080/002075498192049
  16. Kang, J.-G., Lee, D.-H., and Xirouchakis, P.; “Optimal Disassembly Sequencing with Sequence-Dependent Operation Times based on the Directed Graph of Assembly states,” Journal of the Korean Institute of Industrial Engineers, 28(3)：264-173, 2002
  17. Kang, J.-G., Lee, D.-H., and Xirouchakis, P.; “Disassembly Sequencing with Imprecise Data：a Case Study,” International Journal of Industrial Engineering-Theory, Applications and Practice, 10(4)：407-412, 2003
  18. Kang, J.-G.; “Robust Disassembly Sequencing with Interval Data,” Proceedings of 6th Global Conference on Sustainable Product Development and Life Cycle Engineering, Busan, Korea, 109-113, 2008
  19. Kang, J.-G.; “A heuristic algorithm to find the minimax regret longest path problem with interval lengths,” Journal of the Korean Management Engineers society, 14(3)：35-46, 2009
  20. Kang, J.-G. and Xirouchakis, P.; “Disassembly sequencing for maintenance：a survey,” Proceedings of the Institution of Mechanical Engineers, Part B：Journal of Engineering Manufacture, 220(10)：1697-1716, 2006 https://doi.org/10.1243/09544054JEM596
  21. Karaşan, O. E., Pinar, M. Ç., and Yaman, H.; “The Robust shortest Path Problem with Interval Data,” available online at
  22. Kim, H., Han, D., Jeong, H., and Lee, S.; 'Design of RFID-based Integration System for Collection and Recycling Process of EOL Household Electric Appliances in Korea,' Journal of the society of Korea Industrial and Systems Engineering, 32(2)：120-131, 2009
  23. Lambert, A. J. D.; “Optimal disassembly Sequence generation for combined material recycling and part reuse,” Proceedings of IEEE International Symposium on Assembly and Task Planning, 146-151, 1999
  24. Lim, S.; “A Study on a Solution Approach to Fuzzy Linear Programs and Its Application to Fuzzy DEA Models,” Journal of the Society of Korea Industrial and Systems Engineering, 31(2)：51-60, 2008
  26. Montemanni, R. and Gambardella, L. M.; “An Exact Algorithm for the Robust Shortest Path Problem with Interval Data,” Computers and Operations Research, 31(10)：1667-1680, 2004 https://doi.org/10.1016/S0305-0548(03)00114-X
  27. Montemanni, R., Gambardella, L. M., and Donati, A. V.; “A branch and bound algorithm for the robust Shortest path problem with interval data,” Operations Research Letters, 32(3)：225-232, 2004 https://doi.org/10.1016/j.orl.2003.08.002
  28. Montemanni, R. and Gambardella, L. M.; “The robust Shortest path problem with interval data via Benders decomposition,” 4OR, 3(4)：315-328, 2005 https://doi.org/10.1007/s10288-005-0066-x
  29. Park, H. S., Choi, H. W., Mok, H. S., Moon, K. S., and Sung, J. H.; “Method for Generating Optimal Disassembly Sequence of End-of-Life Car's Parts,” Journal of the Korean Society of Precision Engineering, 20(9)：188-196, 2003
  30. Seo, K. K., Park, J. H., and Jang, D. S.; “Optimal disassembly Sequence using genetic algorithms considering economic and environmental aspects,” International Journal of Advanced Manufacturing Technology, 18(5)：371-380, 2001 https://doi.org/10.1007/s001700170061
  31. Tang, O., Grubbstrom, R. W., and Zanoni, S.; “Economic evaluation of disassembly processes in remanufacturing Systems,” International Journal of Production Research, 42(17)：3603-3617, 2004 https://doi.org/10.1080/00207540410001699435
  32. Tripathi, M., Agrawal, S., Pandey, M. K., Shankar, R., and Tiwari, M. K.; “Real world disassembly modeling and Sequencing problem：Optimization by Algorithm of Self-Guided Ants (AsGA),” Robotics and Computer-Integrated Manufacturing, 25(3)：483-496, 2009 https://doi.org/10.1016/j.rcim.2008.02.004
  34. Zieliński, P.; “The computational complexity of the relative robust Shortest path problem with interval data,” European Journal of Operational Research, 158(3)： 570-576, 2004 https://doi.org/10.1016/S0377-2217(03)00373-4