Capacitated multi-objective disassembly scheduling with fuzzy processing time via a fruit fly optimization algorithm.
Disassembly
Fruit fly algorithm
Fuzzy processing time
Remanufacturing
Scheduling
Journal
Environmental science and pollution research international
ISSN: 1614-7499
Titre abrégé: Environ Sci Pollut Res Int
Pays: Germany
ID NLM: 9441769
Informations de publication
Date de publication:
31 Jan 2022
31 Jan 2022
Historique:
received:
09
10
2021
accepted:
21
01
2022
entrez:
31
1
2022
pubmed:
1
2
2022
medline:
1
2
2022
Statut:
aheadofprint
Résumé
This work proposes a capacitated fuzzy disassembly scheduling model with cycle time and environmental cost as parameters, which has broad applications in remanufacturing and many other production systems. Disassembly scheduling is not always given accurately as a time quota in a production system, particularly in the obsolete product remanufacturing process. It is important to study novel models and algorithms based on uncertainty processing time to solve uncertainty disassembly scheduling problems. In this paper, a mixed-integer mathematical programming model is proposed to minimize the cycle time and environmental cost, whilst a metaheuristic approach based on a fruit fly optimization algorithm (FOA) is developed to find a fuzzy disassembly scheduling scheme. To estimate the effectiveness of the proposed method, the proposed algorithm is tested with different size cases of product disassembly scheduling. Furthermore, experiments are conducted to compare with other multi-objective optimization algorithms. The computational results demonstrate the proposed algorithm outperforms other algorithms on computational efficiency and applicability to different problems. Finally, a case study is described to illustrate the proposed method. The main contribution of this current work shows the proposed algorithm to solve the problem of disassembly scheduling in an uncertain environment practically and efficiently.
Identifiants
pubmed: 35099698
doi: 10.1007/s11356-022-18883-y
pii: 10.1007/s11356-022-18883-y
doi:
Types de publication
Journal Article
Langues
eng
Sous-ensembles de citation
IM
Subventions
Organisme : National Natural Science Foundation of China
ID : 52075303
Organisme : National Natural Science Foundation of China
ID : 51775238
Informations de copyright
© 2022. The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.
Références
Barba GY, Adenso DB, Gupta SM (2008) Lot sizing in reverse MRP for scheduling disassembly. Int J Prod Econ 111(2):741–751
Chen CH, Lee LH (2011) Stochastic simulation optimization: an optimal computing budget allocation. World scientific, Singapore
De-Smet N, Minner S, Aghezzaf E, Desmet B (2020) A linearisation approach to the stochastic dynamic capacitated lotsizing problem with sequence-dependent changeovers. Int J Prod Res 58(16):4980–5005
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197
Fang Y, Liu Q, Li M, Laili Y, Pham DT (2019) Evolutionary many-objective optimization for mixed-model disassembly line balancing with multi-robotic workstations. Eur J Oper Res 276(1):160–174
Feng YX, Gao Y, Tian G, Li Z, Hu H, Zheng H (2019) Flexible process planning and end-of-life decision-making for product recovery optimization based on hybrid disassembly. IEEE Trans Autom Sci Eng 16(1):311–326
Feng Y, Ji Z, Gao Y, Zheng H, Tan J (2021) An energy-saving optimization method for cyclic pick-and-place tasks based on flexible joint configurations. Robot Comput Integr Manuf 67:102037
Fu Y, Zhou M, Guo X, Qi L (2021) Stochastic multi-objective integrated disassembly-reprocessing-reassembly scheduling via fruit fly optimization algorithm. J Clean Prod 278:123364
Güngör A, Gupta SM (1998) Disassembly sequence planning for products with defective parts in product recovery. Comput Ind Eng 35(1):161–164
Guo X, Zhou MC, Liu S, Qi L (2021) Multiresource-constrained selective disassembly with maximal profit and minimal energy consumption. IEEE Trans Autom Sci Eng 18(2):804–816
Gong G, Deng Q, Chiong R, Gong X, Huang H, Han W (2020) Remanufacturing-oriented process planning and scheduling: mathematical modelling and evolutionary optimisation. Int J Prod Res 58(12):3781–3799
Gao M, Zhou M, Caudill RJ (2002) Integration of disassembly leveling and bin assignment for demanufacturing automation. IEEE Trans Robot Autom 18(6):867–874
Grosfeld NA, Gerchak Y (2004) Multiple lotsizing in production to order with random yields: review of recent advances. Ann Oper Res 126(1):43–69
Gupta SM, Taleb KN (1994) Scheduling disassembly. Int J Prod Res 32(8):1857–1866
Helber S, Sahling F, Schimmelpfeng K (2013) Dynamic capacitated lot sizing with random demand and dynamic safety stocks. Or Spectrum 35(1):75–105
Han S, Pan W, Zhou Y, Liu Z (2018) Construct the prediction model for China agricultural output value based on the optimization neural network of fruit fly optimization algorithm. Futur Gener Comput Syst 86:663–669
Inderfurth K, Vogelgesang S, Langella IM (2015) How yield process misspecification affects the solution of disassemble-to-order problems. Int J Prod Econ 169:56–67
Inderfurth K, Langella IM (2006) Heuristics for solving disassemble-to-order problems with stochastic yields. Or Spectrum 28(1):73–99
Ilgin MA, Gupta SM (2010) Environmentally conscious manufacturing and product recovery (ECMPRO): a review of the state of the art. J Environ Manage 91(3):563–591
Jia S, Hu Z (2014) Path-relinking tabu search for the multi-objective flexible job shop scheduling problem. Comput Oper Res 47:11–26
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(4):1225–1243
Kalayci CB, Polat O, Gupta SM (2014) A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem. Ann Oper Res 217:1–34
Kalaycılar EG, Azizoğlu M, Yeralan S (2016) A disassembly line balancing problem with fixed number of workstations. Eur J Oper Res 249(2):592–604
Kang K, Doh H, Park J, Lee D (2016) Disassembly leveling and lot sizing for multiple product types: a basic model and its extension. Int J Adv Manuf Technol 82(9):1463–1473
Kim D, Lee D (2011) A heuristic for multi-period disassembly leveling and scheduling. Paper presented at the p. 762–767. https://doi.org/10.1109/SII.2011.6147544
Kim D, Doh H, Lee D (2018) Multi-period disassembly leveling and lot-sizing for multiple product types with parts commonality. Proc IME B J Eng Manufact 232(5):867–878
Kim H, Lee D, Xirouchakis P (2007) Disassembly scheduling: literature review and future research directions. Int J Prod Res 45(18–19):4465–4484
Kim H, Lee D, Xirouchakis P, Züst R (2003) Disassembly scheduling with multiple product types. CIRP Ann Manufact Technol 52(1):403–406
Kim H, Lee D, Xirouchakis P (2006) A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints. J Oper Res Soc 57(10):1231–1240
Kim H, Xirouchakis P (2010) Capacitated disassembly scheduling with random demand. Int J Prod Res 48(23):7177–7194
Kongar E, Gupta SM (2006) Disassembly to order system under uncertainty. Omega 34(6):550–561
Lee D, Xirouchakis P, Zust R (2002) Disassembly scheduling with capacity constraints. CIRP Ann 51(1):387–390
Lee D, Xirouchakis P (2004) A two-stage heuristic for disassembly scheduling with assembly product structure. J Oper Res Soc 55(3):287–297
Liu K, Zhang Z (2018) Capacitated disassembly scheduling under stochastic yield and demand. Eur J Oper Res 269(1):244–257
Lou S, Feng Y, Zheng H, Gao Y, Tan J (2020) Data-driven customer requirements discernment in the product lifecycle management via intuitionistic fuzzy sets and electroencephalogram. J Intell Manuf 31(7):1721–1736
Murugan P, Kannan S, Baskar S (2009) Application of NSGA-II algorithm to single-objective transmission constrained generation expansion planning. IEEE Trans Power Syst 24(4):1790–1797
Morgan SD, Gagnon RJ (2013) A systematic literature review of remanufacturing scheduling. Int J Prod Res 51(16):1–27
Özceylan E, Kalayci CB, Güngör A, Gupta SM (2019) Disassembly line balancing problem: a review of the state of the art and future directions. Int J Prod Res 57(15–16):4805–4827
Prakash PK, Ceglarek SD, Tiwari MK (2012) Constraint-based simulated annealing (CBSA) approach to solve the disassembly scheduling problem. Int J Adv Manufact Technol 60(9–12):1125–1137
Pan WT (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl-Based Syst 26(2):69–74
Ren Y, Zhang C, Zhao F, Xiao H, Tian G (2018) An asynchronous parallel disassembly planning based on genetic algorithm. Eur J Oper Res 269(2):647–660
Rickli JL, Camelio JA (2014) Partial disassembly sequencing considering acquired end-of-life product age distributions. Int J Prod Res 52(24):7496–7512
Rossi R, Kilic OA, Tarim SA (2015) Piecewise linear approximations for the static–dynamic uncertainty strategy in stochastic lot-sizing. Omega 50:126–140
Sakawa M, Kubota R (2000) Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms. Eur J Oper Res 120(2):393–407
Tempelmeier H, Herpers S (2011) Dynamic uncapacitated lot sizing with random demand under a fillrate constraint. Eur J Oper Res 212(3):497–507
Taleb KN, Gupta SM (1997) Disassembly of multiple product structures. Comput Ind Eng 32(4):949–961
Tarim SA, Dogru MK, Özen U, Rossi R (2011) An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints. Eur J Oper Res 215(3):563–571
Tian GD, Zhou MC, Li PG (2018) Disassembly sequence planning considering fuzzy component quality and varying operational cost. IEEE Trans Autom Sci Eng 15(2):748–760
Tian GD, Ren YP, Feng YX, Zhou MC, Zhang HH, Tan JR (2019) Modeling and planning for dual-objective selective disassembly using and/or graph and discrete artificial bee colony. IEEE Trans Industr Inf 15(4):2456–2468
Tian X, Zhang Z (2019) Capacitated disassembly scheduling and pricing of returned products with price-dependent yield. Omega 84:160–174
Ullerich C, Buscher U (2013) Flexible disassembly planning considering product conditions. Int J Prod Res 51(20):6209–6228
Wang HF, Huang YS (2013) A two-stage robust programming approach to demand-driven disassembly planning for a closed-loop supply chain system. Int J Prod Res 51(8):2414–2432
Wang K, Li X, Gao L, Li P (2020) Energy consumption and profit-oriented disassembly line balancing for waste electrical and electronic equipment. J Clean Prod 265:121829
Wang W, Tian G, Yuan G, Pham DT (2021) Energy-time trade-offs for remanufacturing system scheduling using an invasive weed optimization algorithm. J Intell Manuf. https://doi.org/10.1007/s10845-021-01837-5
doi: 10.1007/s10845-021-01837-5
Yano CA, Lee HL (1995) Lot sizing with random yields: a review. Oper Res 43(2):311–334
Yang Y, Yuan G, Zhuang Q, Tian G (2019) Multi-objective low-carbon disassembly line balancing for agricultural machinery using MDFOA and fuzzy AHP. J Clean Prod 233:1465–1474
Yuan H, Bi J, Zhou M, Liu Q, Ammari AC (2021) Biobjective task scheduling for distributed green data centers. IEEE Trans Autom Sci Eng 18(2):731–742
Yuan G, Yang Y, Tian G, Zhuang Q (2020) Comprehensive evaluation of disassembly performance based on the ultimate cross-efficiency and extension-gray correlation degree. J Clean Prod 245:118800
Xu W, Tang Q, Liu J, Liu Z, Zhou Z, Pham DT (2020) Disassembly sequence planning using discrete bees algorithm for human-robot collaboration in remanufacturing. Robot Comput Integr Manuf 62:101860
Zhang J, Wang C, Zang D, Zhou M (2016) Incorporation of optimal computing budget allocation for ordinal optimization into learning automata. IEEE Trans Autom Sci Eng 13(2):1008–1017
Zhu Q, Zhou M, Qiao Y, Wu N, Hou Y (2020) Multiobjective scheduling of dual-blade robotic cells in wafer fabrication. IEEE Trans Syst Man Cybern Syst 50(12):5015–5023
Zhu ZT, Guo X, Li W (2017) Research on new fruit fly optimization algorithm. Comput Eng Appl 53(6):40–45
Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271