A sample average approximation algorithm for selective disassembly sequencing with abnormal disassembly operations and random operation times

ORIGINAL ARTICLE
  • 11 Downloads

Abstract

Selective disassembly sequencing is the problem of determining the sequence of disassembly operations to extract one or more target components of a product. This study addresses a stochastic version of the problem in which abnormal disassembly operations and random operation times are considered under the parallel disassembly environment, i.e., one or more components that can be disassembled further remain after a disassembly operation is done. Abnormal disassembly operations are defined as those in which fasteners can be removed by additional random destructive operations without damaging to target components. After representing all possible sequences using the extended process graph, a stochastic integer programming model is developed that minimizes the sum of disassembly and penalty costs, where the disassembly cost consists of sequence-dependent setup and operation costs, and the penalty cost is the expectation of the costs incurred when the total disassembly time exceeds a given threshold value. A sample average approximation algorithm is proposed that incorporates a branch and bound algorithm to solve the deterministic problem under a scenario for abnormal operations and operation times optimally. Finally, the algorithm is illustrated with a hand-light example and a larger instance.

Keywords

Selective disassembly sequencing Abnormal disassembly operations Random operation times Sample average approximation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

Acknowledgements

This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education of Korea Government (grant number: 2015R1D1A1A01057669).

References

  1. 1.
    Boks C, Nilsson J, Masui K, Suzuki K, Rose C, Lee BH (1998) An international comparison of product end-of-life scenarios and legislation for consumer electronics. In: Proceedings of the 1998 I.E. International Symposium on Electronics and the Environment: 19–24Google Scholar
  2. 2.
    Fleischmann M, Bloemhof-Ruwaard JM, Dekker R, van der Laan E, van Nunen JAEE, van Wassenhove LN (1997) Quantitative models for reverse logistics: a review. Eur J Oper Res 103:1–17MATHCrossRefGoogle Scholar
  3. 3.
    Dowlatshahi S (2000) Developing theory of reverse logistics. Interfaces 30:143–151CrossRefGoogle Scholar
  4. 4.
    Srivastava SK (2007) Green supply chain management: a state-of-the-art literature review. Int J Manag Rev 9:53–80CrossRefGoogle Scholar
  5. 5.
    Sasikumar P, Kannan G (2008a) Issues in reverse supply chains, part I: end-of-life product recovery and inventory management—an overview. Int J Sustain Eng 1:154–172CrossRefGoogle Scholar
  6. 6.
    Sasikumar P, Kannan G (2008b) Issues in reverse supply chains, part II: reverse distribution issues—an overview. Int J Sustain Eng 1:234–249CrossRefGoogle Scholar
  7. 7.
    Jovane F, Alting L, Armillotta A, Eversheim W, Feldmann K, Seliger G, Roth N (1993) A key issue in product life cycle: disassembly. Ann CIRP 42:651–658CrossRefGoogle Scholar
  8. 8.
    Zhang HC, Kuo TC, Lu HT, Huang SH (1997) Environmentally conscious design and manufacturing: a state-of-the-art survey. J Manuf Syst 16:352–371CrossRefGoogle Scholar
  9. 9.
    Bogue R (2007) Design for disassembly: a critical twenty-first century discipline. Assem Autom 27:285–289CrossRefGoogle Scholar
  10. 10.
    Soh SL, Ong SK, Nee AYC (2015) Application of design for disassembly from remanufacturing perspective. Procedia CIRP 26:577–582CrossRefGoogle Scholar
  11. 11.
    McGovern SM, Gupta SM (2007) Benchmark data set for evaluation of line balancing algorithms. IFAC Proc Vol 40:48–53CrossRefGoogle Scholar
  12. 12.
    Kalayci CB, Gupta SM (2013) Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem. Expert Syst Appl 40:7231–7241CrossRefGoogle Scholar
  13. 13.
    Bentaha ML, Battaïa O, Dolgui A (2015a) An exact solution approach for disassembly line balancing problem under uncertainty of the task processing times. Int J Prod Res 53:1807–1818CrossRefGoogle Scholar
  14. 14.
    Bentaha ML, Battaïa O, Dolgui A, Hu SJ (2015b) Second order conic approximation for disassembly line design with joint probabilistic constraints. Eur J Oper Res 247:957–967MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Ilgin MA, Akçay H, Araz C (2017) Disassembly line balancing using linear physical programming. Int J Prod Res 55:6108–6119CrossRefGoogle Scholar
  16. 16.
    Kim H-J, Lee D-H, Xirouchakis P (2007) Disassembly scheduling: literature review and further research directions. Int J Prod Res 45:4465–4484MATHCrossRefGoogle Scholar
  17. 17.
    Kang K-W, Doh H-H, Park J-H, Lee D-H (2016) Disassembly leveling and lot-sizing for multiple product types: a basic model and its extension. Int J Adv Manuf Technol 82:1463–1473CrossRefGoogle Scholar
  18. 18.
    Ji X, Zhang Z, Huang S, Li L (2016) Capacitated disassembly scheduling with parts commonality and start-up cost and its industrial application. Int J Prod Res 54:1225–1243CrossRefGoogle Scholar
  19. 19.
    Kim D-H, Doh H-H, Lee D-H (2017) Multi-period disassembly levelling and lot-sizing for multiple product types with parts commonality. Proc Inst Mech Eng B J Eng Manuf.  https://doi.org/10.1177/0954405416661001
  20. 20.
    Kizilkaya E, Gupta SM (1998) Material flow control and scheduling in a disassembly environment. Comput Ind Eng 35:93–96CrossRefGoogle Scholar
  21. 21.
    Hojati M (2016) Minimizing makespan in 2-stage disassembly flow-shop scheduling problem. Comput Ind Eng 94:1–5CrossRefGoogle Scholar
  22. 22.
    Jiang H, Yi J, Chen S, Zhu X (2016) A multi-objective algorithm for task scheduling and resource allocation in cloud-based disassembly. J Manuf Syst 41:239–255CrossRefGoogle Scholar
  23. 23.
    Ilgin MA, Gupta SM (2010) Environmentally conscious manufacturing and product recovery (ECMPRO): a review of the state of the art. J Environ Manag 91:563–591CrossRefGoogle Scholar
  24. 24.
    Ilgin MA, Gupta SM, Battaïa O (2015) Use of MCDM techniques in environmentally conscious manufacturing and product recovery: state of the art. J Manuf Syst 37:746–758CrossRefGoogle Scholar
  25. 25.
    Lee D-H, Kang J-G, Xirouchakis P (2001) Disassembly planning and scheduling: review and further research. Proc Inst Mech Eng B J Eng Manuf 215:695–710CrossRefGoogle Scholar
  26. 26.
    O’Shea B, Grewal SS, Kaebernick H (1998) State of the art literature survey on disassembly planning. Concurr Eng Res Appl A 6:345–357CrossRefGoogle Scholar
  27. 27.
    Santoch M, Dini G, Failli F (2002) Computer aided disassembly planning: state of the art and perspectives. Ann CIRP 51:507–529CrossRefGoogle Scholar
  28. 28.
    Wang H, Xiang D, Rong Y, Zhang L (2013) Intelligent disassembly planning: a review on its fundamental methodology. Assem Autom 33:78–85CrossRefGoogle Scholar
  29. 29.
    Woo TC, Dutta D (1991) Automatic disassembly and total ordering in three dimensions. J Eng Ind 113:207–213CrossRefGoogle Scholar
  30. 30.
    Kang J-G, Lee D-H, Xirouchakis P, Persson J-G (2001) Parallel disassembly sequencing with sequence-dependent operation times. Ann CIRP 50:343–346CrossRefGoogle Scholar
  31. 31.
    Kim H-W, Park C-J, Lee D-H (2018) Selective disassembly sequencing with random operation times in parallel disassembly environment. Int J Prod Res (in press)Google Scholar
  32. 32.
    Lambert AJD (2006) Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs. Omega 34:538–549CrossRefGoogle Scholar
  33. 33.
    Lambert AJD (2003) Disassembly sequencing: a survey. Int J Prod Res 41:3721–3759MATHCrossRefGoogle Scholar
  34. 34.
    Kang J-G, Xirouchakis P (2006) Disassembly sequencing for maintenance: a survey. Proc Inst Mech Eng B J Eng Manuf 220:1697–1716CrossRefGoogle Scholar
  35. 35.
    Gungor A, Gupta SM (1997) An evaluation methodology for disassembly processes. Comput Ind Eng 33:329–332CrossRefGoogle Scholar
  36. 36.
    Hui W, Dong X, Guanghong D (2008) A genetic algorithm for product disassembly sequence planning. Neurocomputing 71:2720–2726CrossRefGoogle Scholar
  37. 37.
    Adenso-Diaz B, Garcia-Carbajal S, Gupta SM (2008) A path-relinking approach for a bi-criteria disassembly sequencing problem. Comput Oper Res 35:3989–3997MATHCrossRefGoogle Scholar
  38. 38.
    Giri R, Kanthababu M (2015) Generating complete disassembly sequences by utilising two-dimensional views. Int J Prod Res 53:5118–5138CrossRefGoogle Scholar
  39. 39.
    Johnson MR, Wang MH (1995) Planning product disassembly for material recovery opportunities. Int J Prod Res 33:3119–3142MATHCrossRefGoogle Scholar
  40. 40.
    Johnson MR, Wang MH (1998) Economical evaluation of disassembly operations for recycling, remanufacturing and reuse. Int J Prod Res 36:3227–3252MATHCrossRefGoogle Scholar
  41. 41.
    Lambert AJD (1999) Linear programming in disassembly/clustering sequence generation. Comput Ind Eng 36:723–738CrossRefGoogle Scholar
  42. 42.
    Gungor A, Gupta SM (2001) Disassembly sequence plan generation using a branch-and-bound algorithm. Int J Prod Res 39:481–509CrossRefGoogle Scholar
  43. 43.
    Kang J-G, Lee D-H, Xirouchakis P, Lambert AJD (2002) Optimal disassembly sequencing with sequence dependent operation times based on the directed graph of assembly states. J Korean Inst Ind Eng 28:264–273Google Scholar
  44. 44.
    Smith S, Hsu LY, Smith GC (2016) Partial disassembly sequence planning based on cost-benefit analysis. J Clean Prod 139:729–739CrossRefGoogle Scholar
  45. 45.
    Pnueli Y, Zussman E (1997) Evaluating the end-of-life value of a product and improving it by redesign. Int J Prod Res 35:921–942MATHCrossRefGoogle Scholar
  46. 46.
    Erdos G, Kis T, Xirouchakis P (2001) Modeling and evaluating product end-of-life options. Int J Prod Res 39:1203–1220MATHCrossRefGoogle Scholar
  47. 47.
    Teunter RH (2006) Determining optimal disassembly and recovery strategies. Omega 34:533–537CrossRefGoogle Scholar
  48. 48.
    Ma Y-S, Jun H-B, Kim H-W, Lee D-H (2011) Disassembly process planning algorithms for end-of-life product recovery and environmentally conscious disposal. Int J Prod Res 49:7007–7027CrossRefGoogle Scholar
  49. 49.
    Meng K, Lou P, Peng X, Prybutok V (2016) An improved co-evolutionary algorithm for green manufacturing by integration of recovery option selection and disassembly planning for end-of-life products. Int J Prod Res 54:5567–5593CrossRefGoogle Scholar
  50. 50.
    Srinivasan H, Gadh R (1998) A geometric algorithm for single selective disassembly using the wave propagation abstraction. Comput Aided Des 30:603–613MATHCrossRefGoogle Scholar
  51. 51.
    Kara S, Pornprasitpol P, Kaebernick H (2005) A selective disassembly methodology for end-of-life products. Assem Autom 25:124–134CrossRefGoogle Scholar
  52. 52.
    Kara S, Pornprasitpol P, Kaebernick H (2006) Selective disassembly sequencing: a methodology for the disassembly of end-of-life products. Ann CIRP 55:37–40CrossRefGoogle Scholar
  53. 53.
    Smith S, Chen WH (2011) Rule-based recursive selective disassembly Sequence planning for green design. Adv Eng Inform 25:77–87CrossRefGoogle Scholar
  54. 54.
    Han H-J, Yu J-M, Lee D-H (2013) Mathematical model and solution algorithms for selective disassembly sequencing with multiple target components and sequence-dependent setups. Int J Prod Res 51:4997–5010CrossRefGoogle Scholar
  55. 55.
    Mitrouchev P, Wang CG, Lu LX, Li GQ (2015) Selective disassembly sequence generation based on lowest level disassembly graph method. Int J Adv Manuf Technol 80:141–159CrossRefGoogle Scholar
  56. 56.
    Smith S, Smith G, Chen WH (2012) Disassembly sequence structure graphs: an optimal approach for multiple-target selective disassembly sequence planning. Adv Eng Inform 26:306–316CrossRefGoogle Scholar
  57. 57.
    Wang JF, Liu JH, Li SQ, Zhong YF (2003) Intelligent selective disassembly using the ant colony algorithm. Artif Intel Eng Des Anal Manuf 17:325–333CrossRefGoogle Scholar
  58. 58.
    Wang JF, Li SQ, Liu JH (2007) Selective disassembly planning for product green manufacturing. Comput Integr Manuf Syst 13:1097–1102Google Scholar
  59. 59.
    Luo Y, Peng Q, Gu P (2016) Integrated multi-layer representation and ant colony search for product selective disassembly planning. Comput Ind 75:13–26CrossRefGoogle Scholar
  60. 60.
    Li WD, Xia K, Cao L, Chao K-M (2013) Selective disassembly planning for waste electrical and electronic equipment with case studies on liquid crystal displays. Robot Comput Integr Manuf 29:248–260CrossRefGoogle Scholar
  61. 61.
    Chung C, Peng Q (2005) An integrated approach to selective-disassembly sequence planning. Robot Comput Integr Manuf 21:475–485CrossRefGoogle Scholar
  62. 62.
    Chung C, Peng Q (2006) A hybrid approach to selective-disassembly sequence planning for de-manufacturing and its implementation on the internet. Int J Adv Manuf Technol 30:521–529CrossRefGoogle Scholar
  63. 63.
    Smith S, Hung PY (2015) A novel selective parallel disassembly planning method for green design. J Eng Des 26:283–301CrossRefGoogle Scholar
  64. 64.
    Kim H-W, Lee D-H (2017) An optimal algorithm for selective disassembly sequencing with sequence-dependent setups in parallel disassembly environment. Int J Prod Res 55:7317–7333CrossRefGoogle Scholar
  65. 65.
    Gungor A, Gupta SM (1998) Disassembly sequence planning for products with defective parts in product recovery. Comput Ind Eng 35:161–164CrossRefGoogle Scholar
  66. 66.
    Kang J-G, Lee D-H, Xirouchakis P (2003) Disassembly sequencing with imprecise data: a case study. Int J Ind Eng Theory Appl Pract 10:407–412Google Scholar
  67. 67.
    Tang Y, Zhou M, Gao M (2006) Fuzzy-petri-net based disassembly planning considering human factors. IEEE Trans Syst Man Cybern Syst Hum 36:718–726CrossRefGoogle Scholar
  68. 68.
    Tian G, Liu Y, Tian Q, Chu J (2012a) Evaluation model and algorithm of product disassembly process with stochastic feature. Clean Techn Environ Policy 14:345–356CrossRefGoogle Scholar
  69. 69.
    Tian G, Zhou M, Chu J, Liu Y (2012b) Probability evaluation models of product disassembly cost subject to random removal time and different removal labor cost. IEEE Trans Autom Sci Eng 9:288–295CrossRefGoogle Scholar
  70. 70.
    Tian G, Zhou M, Chu J (2013) A chance constrained programming approach to determine the optimal disassembly sequence. IEEE Trans Autom Sci Eng 10:1004–1013CrossRefGoogle Scholar
  71. 71.
    Liu R, Tian G, Zhang X, Zhao A, Wang X, Niu Q (2011) Disassembly sequence optimization for automotive product based on probabilistic planning method. In: Proceedings of the International Conference on Consumer Electronics, Communications and Networks, Xianning, ChinaGoogle Scholar
  72. 72.
    Deng H, Qiang T, Guo X, Zhao Y (2015) Probability evaluation modeling and planning of product disassembly profit. Int J u- e-Serv, Sci Technol 8:327–340CrossRefGoogle Scholar
  73. 73.
    Kleywegt AJ, Shapiro A, Homem-de-Mello T (2001) The sample average approximation method for stochastic discrete optimization. SIAM J Optim 12:479–502MathSciNetMATHCrossRefGoogle Scholar
  74. 74.
    Mak WK, Morton DP, Wood RK (1999) Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper Res Lett 24:47–56MathSciNetMATHCrossRefGoogle Scholar
  75. 75.
    Norkin VI, Pflug GC, Ruszczyński A (1998) A branch and bound method for stochastic global optimization. Math Program 83:425–450MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag London Ltd., part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Industrial EngineeringHanyang UniversitySeoulRepublic of Korea

Personalised recommendations