×

zbMATH — the first resource for mathematics

Heuristics for demand-driven disassembly planning. (English) Zbl 1109.90012
Summary: Remanufacturing of used products has become accepted as an advantageous disposition option within the field of reverse logistics. Remanufacturing, where a firm takes returned products at the end of their life and disassembles them to obtain parts which are reassembled into “good as new” products, may require so-called demand-driven- disassembly, where a specific amount of returned products must be disassembled to yield parts which are either demanded externally, or used in the remanufacturing operation. While in its simplest form, the solution can be merely calculated, more realistically complex product structures require a more powerful solution method. The first choice, integer programming (IP) can be used to arrive at an optimal solution, with the disadvantage that the time required to solve the problem explodes with increasingly complex product structures and longer time horizons.
Another possible method, heuristics which were presented in a previous work on this problem [K. N. Taleb and S. M. Gupta, Comp. Ind. Eng. 32, No. 4, 949–961 (1997)], offer a faster, easier solution with the disadvantage that it is not necessarily optimal, and under certain circumstances may deliver an infeasible result. In this work, this problem was corrected and the heuristic was extended in several important ways to deal with holding costs and external procurement of items. The methodology is illustrated by an example. Another advantage of the heuristic is that it can be programmed into code and executed via spreadsheet application, which will facilitate its application. A performance study reveals that the new heuristic performs quite well for a wide spectrum of randomly generated problem test instances.

MSC:
90B06 Transportation, logistics and supply chain management
90C59 Approximation methods and heuristics in mathematical programming
90B30 Production models
90B35 Deterministic scheduling theory in operations research
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Rogers D, Tibbe-Lembke RS. Going backwards: reverse logistics trends and practices. Reno: Reverse Logistics Education Council, 1998.
[2] European Commission Directorate General. Study on investment and employment related to EU policy on air, water, and waste, EC 4739/a.1/11452-0, 2000.
[3] Preston, L., Sustainability at hewlett-packard: from theory to practice, California management review, 43, 3, 26-37, (2001)
[4] Navin-Chandra, D., The recovery problem in product design, Journal of engineering design, 5, 1, 65-86, (1994)
[5] Thierry, M.; Salomon, M.; Van Nunen, J.; Van Wassenhove, L., Strategic issues in product recovery management, California management review, 37, 2, 114-135, (1995)
[6] Manufacturing: once is not enough. Business Week, 16 April 2001.
[7] Westkaemper, E.; Feldmann, K.; Reinhart, G.; Seiliger, G., Integrated development of assembly and disassembly, Annals of the CIRP, 48, 2, 557-565, (1999)
[8] Grogan P. Not your father’s Oldsmobile. BioCycle, November 2000.
[9] Junkyard Dog, Forbes, 16 April 2001.
[10] The innovator’s rule book. Inc Magazine, April 2002.
[11] Guide, V.D.R., Production planning control for remanufacturing: industry practice and research needs, Journal of operations management, 18, 467-483, (2000)
[12] Taleb, K.N.; Gupta, S.M., Disassembly of multiple product structures, Computers & industrial engineering, 32, 4, 949-961, (1997)
[13] Ferrer G, Whybark DC. From garbage to goods: Successful remanufacturing systems and skills, Business Horizons. November-December: 2000.
[14] Das, S.K.; Naik, S., Process planning for product disassembly, International journal of production research, 40, 6, 1335-1355, (2002)
[15] Ferguson, N.; Browne, J., Issues in end-of-life product recovery and reuse logistics, Production planning & control, 12, 5, 534-547, (2001)
[16] Clegg J, Williams DJ, Uzsoy R. Production planning for companies with remanufacturing capability. Proceedings of the third IEEE international symposium of electronics and the environment, Orlando, May 1995. p. 186-91.
[17] Guide, V.D.R.; Jayaraman, V.; Srivastava, R.; Benton, W.C., Supply chain management for recoverable manufacturing systems, Interfaces, 30, 3, 125-142, (2000)
[18] Uzsoy, R.; Venkatachalam, G., Supply chain management for companies with product recovery and remanufacturing capability, International journal of environmentally conscious design & manufacturing, 7, 1, 59-72, (1998)
[19] Hoshino, T.; Yura, K.; Hitomi, K., Optimization analysis for recycle-oriented manufacturing systems, International journal of production research, 33, 8, 2069-2078, (1995) · Zbl 0913.90076
[20] Kongar, E.; Gupta, S.M., A multi-criteria decision making approach for disassembly-to-order systems, Journal of electronics manufacturing, 11, 2, 171-183, (2002)
[21] Veerakamolmal, P.; Gupta, S.M., Optimal analysis of lot-size balancing for multiproducts selective disassembly, International journal of flexible automation and integrated manufacturing, 8, 3-4, 245-269, (1998)
[22] Veerakamolmal P, Gupta SM. Optimizing the supply chain in reverse logistics. Proceedings of the SPIE international conference on environmentally conscious manufacturing, vol. 4193, 2000. p. 157-66.
[23] Gupta SM, Lee YJ, Xanthopulos Z, Veerakamolmal P. An optimization approach for a reverse logistics supply chain. Proceedings of the 2000 world symposium on group technology/cellular manufacturing, 2000. p. 227-32.
[24] Lambert, A.J.D.; Gupta, S.M., Demand-driven disassembly optimization for electronic products, Journal of electronics manufacturing, 11, 2, 121-135, (2002)
[25] Gupta, S.M.; Taleb, K.N., Scheduling disassembly, International journal of production research, 32, 8, 1857-1866, (1994) · Zbl 0896.90118
[26] Taleb, K.N.; Gupta, S.M.; Brennan, L., Disassembly of complex product structures with parts and materials commonality, Production planning & control, 8, 3, 255-269, (1997)
[27] Meacham, A.; Uzsoy, R.; Venkatadri, U., Optimal disassembly configurations for single and multiple products, Journal of manufacturing systems, 18, 5, 311-322, (1999)
[28] Neuendorf, K.P.; Lee, D.H.; Kiritsis, D.; Xirouchakis, P., Disassembly scheduling with parts commonality using Petri nets with time stamps, Fundamenta informaticae, 47, 295-306, (2001) · Zbl 1066.68091
[29] Moore, K.E.; Gungor, A.; Gupta, S.M., Petri net approach to disassembly process planning for products with complex and/or precedence relationships, European journal of operations research, 135, 428-449, (2001) · Zbl 1004.90030
[30] Veerakamolmal, P.; Gupta, S.M., Analysis of design efficiency for the disassembly of modular electronic products, Journal of electronics manufacturing, 9, 1, 79-95, (1999)
[31] Inderfurth, K.; Flapper, S.D.P.; Lambert, A.J.D.; Pappis, C.P.; Voutsinas, T.G., Production planning for product recovery management, ()
[32] Lee, D.H.; Kang, J.G.; Xirouchakis, P., Disassembly planning and scheduling: a review and further research, Proceedings of the I mech E, part B, journal of engineering manufacture, 215, 5, 695-709, (2001)
[33] Lambert, A.J.D., Disassembly sequencing: a survey, International journal of production research, 41, 16, 3721-3759, (2003) · Zbl 1059.90055
[34] Gungor, A.; Gupta, S.M., Issues in environmentally conscious manufacturing and product recovery: a survey, Computers & industrial engineering, 36, 811-853, (1999)
[35] Blackburn, J.D.; Millen, R.A., Heuristic lot-sizing performance in a rolling schedule environment, Decision sciences, 11, 691-701, (1980)
[36] Blackburn, J.D.; Millen, R.A., The impact of a rolling schedule in a multi-level MRP system, Journal of operations management, 2, 2, 125-135, (1982)
[37] Inderfurth, K.; Langella, I.M., An approach for solving disassembly-to-order problems under stochastic yields, (), 309-331
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.