A bi-objective salp swarm algorithm with sine cosine operator for resource constrained multi-manned disassembly line balancing problem
Due to the current popularity of product customization and unsuitability of single-person disassembly lines for large-size products, as well as considering the needs for supporting resources (machines/tools), this paper investigates the resource-constraint mixed-model multi-manned disassembly line b...
Saved in:
| Published in | Applied soft computing Vol. 131; p. 109759 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
01.12.2022
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1568-4946 1872-9681 |
| DOI | 10.1016/j.asoc.2022.109759 |
Cover
| Abstract | Due to the current popularity of product customization and unsuitability of single-person disassembly lines for large-size products, as well as considering the needs for supporting resources (machines/tools), this paper investigates the resource-constraint mixed-model multi-manned disassembly line balancing problem (RCMMDLBP), which needs to achieve task-worker-workstation assignment and sequencing under the constraints of AND/OR precedence relationship, worker idle, resource availability, and resource quantity limitation at the same time. Besides, the cycle time and the overall number of workers are considered as dual objectives to provide flexible application scenarios for managers. To solve this problem, a mixed-integer programming model is established and the epsilon constraint method is used to obtain the exact solutions for small-scale cases. Simultaneously, due to the NP-hard nature, a multi-objective optimization algorithm called self-adaptive salp swarm algorithm with sine cosine algorithm (SSSASCA) is proposed. The encoding and decoding are specifically designed with repairing and simulated annealing strategies corresponding to the properties of RCMMDLBP. Moreover, Cauchy mutation and Logistic chaotic mapping strategies are introduced to increase the population diversity and help to jump out of local optimum. Finally, computational experiments are performed to show the superiority of the SSSASCA by comparing it with MSSA, NSGAII, and MAOS. The results show that SSSASCA stably achieves better Pareto front solutions in 59/60 RCMMDLBP instances under the four evaluation indexes of NS, DPO, IGD, and HV. In addition, a specific example is applied for the discussion of managerial applications and to illustrate the practicality of the proposed model and solution method.
•Studies a resource constrained mixed-model multi-manned disassembly line balancing problem.•Besides the resource quantity constraints, the resource availability constraint is also considered.•Considers the cycle time and the overall number of workers as dual objectives.•Proposes a self-adaptive salp swarm algorithm with sine cosine algorithm.•Provides specific encoding and decoding mechanisms and involves several helpful operators. |
|---|---|
| AbstractList | Due to the current popularity of product customization and unsuitability of single-person disassembly lines for large-size products, as well as considering the needs for supporting resources (machines/tools), this paper investigates the resource-constraint mixed-model multi-manned disassembly line balancing problem (RCMMDLBP), which needs to achieve task-worker-workstation assignment and sequencing under the constraints of AND/OR precedence relationship, worker idle, resource availability, and resource quantity limitation at the same time. Besides, the cycle time and the overall number of workers are considered as dual objectives to provide flexible application scenarios for managers. To solve this problem, a mixed-integer programming model is established and the epsilon constraint method is used to obtain the exact solutions for small-scale cases. Simultaneously, due to the NP-hard nature, a multi-objective optimization algorithm called self-adaptive salp swarm algorithm with sine cosine algorithm (SSSASCA) is proposed. The encoding and decoding are specifically designed with repairing and simulated annealing strategies corresponding to the properties of RCMMDLBP. Moreover, Cauchy mutation and Logistic chaotic mapping strategies are introduced to increase the population diversity and help to jump out of local optimum. Finally, computational experiments are performed to show the superiority of the SSSASCA by comparing it with MSSA, NSGAII, and MAOS. The results show that SSSASCA stably achieves better Pareto front solutions in 59/60 RCMMDLBP instances under the four evaluation indexes of NS, DPO, IGD, and HV. In addition, a specific example is applied for the discussion of managerial applications and to illustrate the practicality of the proposed model and solution method.
•Studies a resource constrained mixed-model multi-manned disassembly line balancing problem.•Besides the resource quantity constraints, the resource availability constraint is also considered.•Considers the cycle time and the overall number of workers as dual objectives.•Proposes a self-adaptive salp swarm algorithm with sine cosine algorithm.•Provides specific encoding and decoding mechanisms and involves several helpful operators. |
| ArticleNumber | 109759 |
| Author | Zhou, Binghai Bian, Jingrao |
| Author_xml | – sequence: 1 givenname: Binghai orcidid: 0000-0001-7276-8850 surname: Zhou fullname: Zhou, Binghai email: bhzhou@tongji.edu.cn – sequence: 2 givenname: Jingrao surname: Bian fullname: Bian, Jingrao email: 2130228@tongji.edu.cn |
| BookMark | eNp9kEtuwyAQQFGVSk3SXqArLuAUExsbqZso6k-K1E27RoDHKRaGCJxEuUDPXdx01UUWwwzMPARvhibOO0DoPieLnOTsoVvI6PWCEkrTAa9KfoWmeV3RjLM6n6S6ZHVW8ILdoFmMHUkQp_UUfa-wMplXHejBHABHaXc4HmXosbRbH8zw1eNjWnE0DrD2v8nvIMjBB9ymCBD9Puix6eIQZBpocL-3g8l66cZNY6KMEXplT9iOvJJWOm3cFu-CVxb6W3TdShvh7i_P0efz08f6Ndu8v7ytV5tM0yUZsiUpG1q1TBUlA-BcQalyDqougPI250XB6hYoq5WSbVUxQmRRyCqJaEpdNu1yjurzvTr4GAO0QptBDsa78eFW5ESMPkUnRp9i9CnOPhNK_6G7YHoZTpehxzME6VMHA0FEbcBpaExIxkXjzSX8ByG5lQQ |
| CitedBy_id | crossref_primary_10_1016_j_cie_2024_110621 crossref_primary_10_1016_j_ijpe_2024_109257 crossref_primary_10_1016_j_cie_2023_109704 crossref_primary_10_1515_jisys_2023_0262 crossref_primary_10_1016_j_engappai_2023_107416 crossref_primary_10_1016_j_jclepro_2025_144695 crossref_primary_10_1016_j_prime_2024_100420 crossref_primary_10_1016_j_aei_2024_102974 crossref_primary_10_1016_j_apenergy_2023_122341 crossref_primary_10_1016_j_aei_2024_102895 crossref_primary_10_1080_21681015_2024_2420988 crossref_primary_10_1007_s10845_024_02443_x crossref_primary_10_1016_j_asoc_2024_111415 crossref_primary_10_1016_j_cie_2023_109294 crossref_primary_10_1016_j_clscn_2023_100129 |
| Cites_doi | 10.1007/s10479-020-03902-3 10.1016/j.eswa.2017.05.053 10.1016/j.asoc.2020.106445 10.1109/TASE.2021.3133601 10.1080/00207543.2019.1587190 10.1007/s00521-014-1811-x 10.1016/j.asoc.2021.107773 10.1080/00207543.2019.1630774 10.1080/00207543.2018.1476786 10.1016/j.ifacol.2016.07.893 10.1109/ACCESS.2020.2994065 10.1016/j.eswa.2019.113103 10.1016/j.engappai.2022.105479 10.1016/j.cor.2022.105915 10.1007/s00170-013-4990-1 10.1016/j.apm.2020.12.021 10.1016/j.asoc.2019.105833 10.1080/00207543.2019.1656841 10.1080/00207543.2013.795251 10.1007/s00607-018-00693-1 10.1080/00207543.2019.1602290 10.1109/4235.585893 10.3390/su11082304 10.1016/j.ejor.2018.12.035 10.1016/j.rcim.2017.09.013 10.1080/00207543.2017.1324225 10.1080/00207543.2017.1341066 10.1007/s00170-009-2303-5 10.1016/j.cie.2013.03.014 10.1007/s00500-021-05889-w 10.1080/00207540600943985 10.1016/j.asoc.2020.106739 10.1007/s40684-016-0016-4 10.1007/s11081-019-09465-y 10.1016/j.asoc.2020.106172 10.1016/j.apm.2021.07.013 10.1080/00207543.2021.1881648 10.1016/j.cie.2019.03.017 10.1016/j.ejor.2015.09.004 10.1016/j.apm.2020.05.006 10.1016/j.apm.2021.01.017 10.1007/s10489-022-03899-1 10.1016/j.jmsy.2020.06.006 10.1080/00207543.2022.2069059 10.1016/j.asoc.2021.107513 10.1007/s00170-010-3120-6 10.1016/j.rcim.2021.102251 10.1109/TCYB.2021.3070122 10.1016/j.eswa.2013.06.067 10.1016/j.eswa.2021.115431 10.1080/00207540210135622 10.1016/j.ijpe.2012.10.020 10.1016/j.asoc.2021.107404 10.1016/j.advengsoft.2017.07.002 10.1016/j.jmsy.2018.07.001 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier B.V. |
| Copyright_xml | – notice: 2022 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.asoc.2022.109759 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-9681 |
| ExternalDocumentID | 10_1016_j_asoc_2022_109759 S1568494622008080 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 23M 4.4 457 4G. 53G 5GY 5VS 6J9 7-5 71M 8P~ AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W JJJVA KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SES SEW SPC SPCBC SST SSV SSZ T5K UHS UNMZH ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c230t-305d27f6b456ee99be5b19eb84e29f194468fe268bbaf77600a44a7187d5c5df3 |
| IEDL.DBID | .~1 |
| ISSN | 1568-4946 |
| IngestDate | Wed Oct 29 21:11:45 EDT 2025 Thu Apr 24 22:59:39 EDT 2025 Fri Feb 23 02:42:22 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Salp swarm algorithm Epsilon constraint Resource-constrained Line balancing Multi-manned Mixed-model |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c230t-305d27f6b456ee99be5b19eb84e29f194468fe268bbaf77600a44a7187d5c5df3 |
| ORCID | 0000-0001-7276-8850 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_asoc_2022_109759 crossref_primary_10_1016_j_asoc_2022_109759 elsevier_sciencedirect_doi_10_1016_j_asoc_2022_109759 |
| PublicationCentury | 2000 |
| PublicationDate | December 2022 2022-12-00 |
| PublicationDateYYYYMMDD | 2022-12-01 |
| PublicationDate_xml | – month: 12 year: 2022 text: December 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Applied soft computing |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Gungor, Gupta (b56) 2002; 40 Yin, Zhang, Zhang, Wu, Liang (b25) 2022; 73 Kalayci, Gupta (b35) 2013; 69 Kalayci, Gupta (b59) 2013; 40 Ewees, Al-qaness, Abd Elaziz (b50) 2021; 94 Matsumoto, Yang, Martinsen, Kainuma (b1) 2016; 3 W. Liang, Z.Q. Zhang, Y. Zhang, P.Y. Xu, T. Yin, Improved social spider algorithm for partial disassembly line balancing problem considering the energy consumption involved in tool switching, Int. J. Prod. Res. S. Mete, Z.A. Cil, E. Ozceylan, K. Agpak, Resource Constrained Disassembly Line Balancing Problem, in: 8th IFAC Conference on Manufacturing Modelling, Management and Control (MIM), Troyes, FRANCE, 2016, pp. 921–925. Yuan, Yang, Pham (b29) 2020; 8 Wang, Guo, Liu, Qi, Zhao (b30) 2020 Tirkolaee, Goli, Hematian, Sangaiah, Han (b54) 2019; 101 Liu, Chu, Zheng, Chu, Liu (b16) 2022; 60 Kazemi, Ghodsi, Rabbani, Tavakkoli-Moghaddam (b33) 2011; 55 Wang, Li, Gao, Li, Gupta (b34) 2021; 107 A. Gungor, S.M. Gupta, Disassembly line balancing, in: Proc. SPIE, 1999, pp. 193–195. Fang, Xu, Liu, Pham (b24) 2020; 56 Wang, Li, Gao (b12) 2019; 130 Cevikcan, Aslan, Yeni (b18) 2020; 58 Agrawal, Tiwari (b14) 2008; 46 Fang, Liu, Li, Laili, Pham (b23) 2019; 276 Li, Barwood, Rahimifard (b2) 2018; 50 Fang, Ming, Li, Liu, Pham (b4) 2020; 58 M. Abd Elaziz, L. Abualigah, A.A. Ewees, M.A.A. Al-qaness, R.R. Mostafa, D. Yousri, R.A. Ibrahim, Triangular mutation-based manta-ray foraging optimization and orthogonal learning for global optimization and engineering problems, Appl. Intell. El-Ashmawi, Ali (b49) 2020; 94 Xia, Liu, Zhang, Wang, Cao, Liu (b13) 2019; 11 Li, Janardhanan (b10) 2021; 183 Kucukkoc, Li, Li (b20) 2020; 21 Kansal, Dhillon (b46) 2020; 90 . Chen, Cheng, Li (b7) 2018; 48 Ilgin, Akcay, Araz (b15) 2017; 55 Kizilay (b27) 2022; 146 Battaia, Dolgui (b31) 2013; 142 Azizi (b55) 2021; 93 McGovern, Gupta (b9) 2005; 179 K.P. Wang, X.Y. Li, L. Gao, P.G. Li, Modeling and Balancing for Disassembly Lines Considering Workers With Different Efficiencies, IEEE Trans. Cybern. Zhang, Tang, Chica (b6) 2021; 109 Wolpert, Macready (b48) 1997; 1 Ren, Yu, Zhang, Tian, Meng, Zhou (b57) 2017; 55 Ding, Feng, Tan, Gao (b38) 2010; 48 Nilakantan, Ponnambalam, Jawahar, Kanagaraj (b36) 2015; 26 O.F. Yilmaz, B. Yazici, Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches, Ann. Oper. Res. Zhang, Wang, Zhu, Wang (b11) 2017; 86 Al-qaness, Ewees, Abd Elaziz (b44) 2021; 25 Paksoy, Gungor, Ozceylan, Hancilar (b5) 2013; 51 X.W. Guo, Z.W. Zhang, L. Qi, S.X. Liu, Y. Tang, Z.Y. Zhao, Stochastic Hybrid Discrete Grey Wolf Optimizer for Multi-Objective Disassembly Sequencing and Line Balancing Planning in Disassembling Multiple Products, Ieee Trans. Autom. Sci. Eng. Cil, Mete, Serin (b37) 2020; 86 Naderi, Azab, Borooshan (b8) 2019; 57 Aydemir-Karadag, Turkbey (b32) 2013; 65 Liu, Yao, Zhu (b51) 2022; 12 Kalaycilar, Azizoglu, Yeralan (b58) 2016; 249 Neggaz, Ewees, Abd Elaziz, Mafarja (b52) 2020; 145 Gholami, Parvaneh (b47) 2019; 85 He, Chu, Zheng, Liu, Chu (b53) 2020; 58 Cil (b19) 2021; 99 Zhou, Bian (b42) 2022; 116 Liu, Li, Fang, Laili, Lou, Pham (b22) 2019 Mirjalili, Gandomi, Mirjalili, Saremi, Faris, Mirjalili (b45) 2017; 114 Li, Cil, Mete, Kucukkoc (b60) 2020; 58 Zhang, Xu, Zhang (b43) 2021; 98 Zhang, Tang, Qian (b40) 2021; 113 Zhang (10.1016/j.asoc.2022.109759_b11) 2017; 86 Ilgin (10.1016/j.asoc.2022.109759_b15) 2017; 55 Kalayci (10.1016/j.asoc.2022.109759_b59) 2013; 40 Paksoy (10.1016/j.asoc.2022.109759_b5) 2013; 51 10.1016/j.asoc.2022.109759_b26 10.1016/j.asoc.2022.109759_b28 10.1016/j.asoc.2022.109759_b21 He (10.1016/j.asoc.2022.109759_b53) 2020; 58 Gungor (10.1016/j.asoc.2022.109759_b56) 2002; 40 Liu (10.1016/j.asoc.2022.109759_b51) 2022; 12 Yin (10.1016/j.asoc.2022.109759_b25) 2022; 73 Kalayci (10.1016/j.asoc.2022.109759_b35) 2013; 69 Kansal (10.1016/j.asoc.2022.109759_b46) 2020; 90 Fang (10.1016/j.asoc.2022.109759_b23) 2019; 276 Nilakantan (10.1016/j.asoc.2022.109759_b36) 2015; 26 Tirkolaee (10.1016/j.asoc.2022.109759_b54) 2019; 101 Kalaycilar (10.1016/j.asoc.2022.109759_b58) 2016; 249 Fang (10.1016/j.asoc.2022.109759_b4) 2020; 58 McGovern (10.1016/j.asoc.2022.109759_b9) 2005; 179 Liu (10.1016/j.asoc.2022.109759_b16) 2022; 60 Chen (10.1016/j.asoc.2022.109759_b7) 2018; 48 10.1016/j.asoc.2022.109759_b17 Cil (10.1016/j.asoc.2022.109759_b37) 2020; 86 Zhang (10.1016/j.asoc.2022.109759_b43) 2021; 98 Matsumoto (10.1016/j.asoc.2022.109759_b1) 2016; 3 Wang (10.1016/j.asoc.2022.109759_b30) 2020 Zhou (10.1016/j.asoc.2022.109759_b42) 2022; 116 Gholami (10.1016/j.asoc.2022.109759_b47) 2019; 85 Li (10.1016/j.asoc.2022.109759_b60) 2020; 58 Wolpert (10.1016/j.asoc.2022.109759_b48) 1997; 1 Liu (10.1016/j.asoc.2022.109759_b22) 2019 Zhang (10.1016/j.asoc.2022.109759_b40) 2021; 113 El-Ashmawi (10.1016/j.asoc.2022.109759_b49) 2020; 94 Naderi (10.1016/j.asoc.2022.109759_b8) 2019; 57 Yuan (10.1016/j.asoc.2022.109759_b29) 2020; 8 Kazemi (10.1016/j.asoc.2022.109759_b33) 2011; 55 Cil (10.1016/j.asoc.2022.109759_b19) 2021; 99 Azizi (10.1016/j.asoc.2022.109759_b55) 2021; 93 Wang (10.1016/j.asoc.2022.109759_b34) 2021; 107 Mirjalili (10.1016/j.asoc.2022.109759_b45) 2017; 114 Ding (10.1016/j.asoc.2022.109759_b38) 2010; 48 10.1016/j.asoc.2022.109759_b41 Li (10.1016/j.asoc.2022.109759_b2) 2018; 50 Neggaz (10.1016/j.asoc.2022.109759_b52) 2020; 145 Xia (10.1016/j.asoc.2022.109759_b13) 2019; 11 Kucukkoc (10.1016/j.asoc.2022.109759_b20) 2020; 21 Aydemir-Karadag (10.1016/j.asoc.2022.109759_b32) 2013; 65 Ewees (10.1016/j.asoc.2022.109759_b50) 2021; 94 Al-qaness (10.1016/j.asoc.2022.109759_b44) 2021; 25 Agrawal (10.1016/j.asoc.2022.109759_b14) 2008; 46 Zhang (10.1016/j.asoc.2022.109759_b6) 2021; 109 10.1016/j.asoc.2022.109759_b39 10.1016/j.asoc.2022.109759_b3 Wang (10.1016/j.asoc.2022.109759_b12) 2019; 130 Cevikcan (10.1016/j.asoc.2022.109759_b18) 2020; 58 Kizilay (10.1016/j.asoc.2022.109759_b27) 2022; 146 Battaia (10.1016/j.asoc.2022.109759_b31) 2013; 142 Li (10.1016/j.asoc.2022.109759_b10) 2021; 183 Ren (10.1016/j.asoc.2022.109759_b57) 2017; 55 Fang (10.1016/j.asoc.2022.109759_b24) 2020; 56 |
| References_xml | – reference: X.W. Guo, Z.W. Zhang, L. Qi, S.X. Liu, Y. Tang, Z.Y. Zhao, Stochastic Hybrid Discrete Grey Wolf Optimizer for Multi-Objective Disassembly Sequencing and Line Balancing Planning in Disassembling Multiple Products, Ieee Trans. Autom. Sci. Eng. – volume: 146 year: 2022 ident: b27 article-title: A novel constraint programming and simulated annealing for disassembly line balancing problem with AND/OR precedence and sequence dependent setup times publication-title: Comput. Oper. Res. – volume: 249 start-page: 592 year: 2016 end-page: 604 ident: b58 article-title: A disassembly line balancing problem with fixed number of workstations publication-title: European J. Oper. Res. – volume: 90 year: 2020 ident: b46 article-title: Emended salp swarm algorithm for multiobjective electric power dispatch problem publication-title: Appl. Soft. Comput. – reference: W. Liang, Z.Q. Zhang, Y. Zhang, P.Y. Xu, T. Yin, Improved social spider algorithm for partial disassembly line balancing problem considering the energy consumption involved in tool switching, Int. J. Prod. Res. – volume: 179 year: 2005 ident: b9 article-title: A balancing method and genetic algorithm for disassembly line balancing publication-title: European J. Oper. Res. – volume: 276 start-page: 160 year: 2019 end-page: 174 ident: b23 article-title: Evolutionary many-objective optimization for mixed-model disassembly line balancing with multi-robotic workstations publication-title: European J. Oper. Res. – volume: 21 start-page: 611 year: 2020 end-page: 630 ident: b20 article-title: Type-e disassembly line balancing problem with multi-manned workstations publication-title: Optim. Eng. – volume: 93 year: 2021 ident: b55 article-title: Atomic orbital search: A novel metaheuristic algorithm publication-title: Appl. Math. Model. – volume: 130 start-page: 634 year: 2019 end-page: 649 ident: b12 article-title: A multi-objective discrete flower pollination algorithm for stochastic two-sided partial disassembly line balancing problem publication-title: Comput. Ind. Eng. – volume: 94 start-page: 285 year: 2021 end-page: 305 ident: b50 article-title: Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times publication-title: Appl. Math. Model. – volume: 142 start-page: 259 year: 2013 end-page: 277 ident: b31 article-title: A taxonomy of line balancing problems and their solution approaches publication-title: Int. J. Prod. Econ. – volume: 113 year: 2021 ident: b40 article-title: Integration of balancing and preventive maintenance in straight and U-shaped resource-dependent assembly lines: MILP model and memetic algorithm publication-title: Appl. Soft. Comput. – volume: 58 start-page: 649 year: 2020 end-page: 670 ident: b18 article-title: Disassembly line design with multi-manned workstations: a novel heuristic optimisation approach publication-title: Int. J. Prod. Res. – volume: 25 start-page: 9545 year: 2021 end-page: 9557 ident: b44 article-title: Modified whale optimization algorithm for solving unrelated parallel machine scheduling problems publication-title: Soft Comput. – volume: 1 start-page: 67 year: 1997 end-page: 82 ident: b48 article-title: No free lunch theorems for optimization publication-title: IEEE Trans. Evol. Comput. – volume: 55 start-page: 7302 year: 2017 end-page: 7316 ident: b57 article-title: An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem publication-title: Int. J. Prod. Res. – reference: O.F. Yilmaz, B. Yazici, Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches, Ann. Oper. Res. – volume: 26 start-page: 1379 year: 2015 end-page: 1393 ident: b36 article-title: Bio-inspired search algorithms to solve robotic assembly line balancing problems publication-title: Neural Comput. Appl. – volume: 109 year: 2021 ident: b6 article-title: A robust MILP and gene expression programming based on heuristic rules for mixed-model multi-manned assembly line balancing publication-title: Appl. Soft. Comput. – volume: 183 year: 2021 ident: b10 article-title: Modelling and solving profit-oriented U-shaped partial disassembly line balancing problem publication-title: Expert Syst. Appl. – reference: A. Gungor, S.M. Gupta, Disassembly line balancing, in: Proc. SPIE, 1999, pp. 193–195. – volume: 46 start-page: 1405 year: 2008 end-page: 1429 ident: b14 article-title: A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem publication-title: Int. J. Prod. Res. – volume: 99 start-page: 785 year: 2021 end-page: 803 ident: b19 article-title: An exact solution method for multi-manned disassembly line design with AND/OR precedence relations publication-title: Appl. Math. Model. – volume: 94 year: 2020 ident: b49 article-title: A modified salp swarm algorithm for task assignment problem publication-title: Appl. Soft. Comput. – volume: 8 start-page: 88745 year: 2020 end-page: 88758 ident: b29 article-title: Multiobjective ecological strategy optimization for two-stage disassembly line balancing with constrained-resource publication-title: IEEE Access – volume: 60 start-page: 1973 year: 2022 end-page: 1991 ident: b16 article-title: Distributionally robust and risk-averse optimisation for the stochastic multi-product disassembly line balancing problem with workforce assignment publication-title: Int. J. Prod. Res. – volume: 69 start-page: 197 year: 2013 end-page: 209 ident: b35 article-title: A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem publication-title: Int. J. Adv. Manuf. Technol. – reference: K.P. Wang, X.Y. Li, L. Gao, P.G. Li, Modeling and Balancing for Disassembly Lines Considering Workers With Different Efficiencies, IEEE Trans. Cybern. – start-page: 700 year: 2020 end-page: 705 ident: b30 article-title: A stochastic sequence-dependent multi-objective disassembly line balancing model subject to task failure and resource constraint via multi-objective cuckoo search publication-title: IEEE International Conference on Systems, Man, and Cybernetics (SMC), Electr Network – volume: 116 year: 2022 ident: b42 article-title: Multi-mechanism-based modified bi-objective Harris Hawks optimization for sustainable robotic disassembly line balancing problems publication-title: Eng. Appl. Artif. Intell. – volume: 58 start-page: 5721 year: 2020 end-page: 5737 ident: b53 article-title: A multi-objective distribution-free model and method for stochastic disassembly line balancing problem publication-title: Int. J. Prod. Res. – volume: 98 year: 2021 ident: b43 article-title: Balancing and sequencing problem of mixed-model U-shaped robotic assembly line: Mathematical model and dragonfly algorithm based approach publication-title: Appl. Soft. Comput. – volume: 65 start-page: 413 year: 2013 end-page: 425 ident: b32 article-title: Multi-objective optimization of stochastic disassembly line balancing with station paralleling publication-title: Comput. Ind. Eng. – volume: 58 start-page: 3220 year: 2020 end-page: 3234 ident: b60 article-title: A fast branch, bound and remember algorithm for disassembly line balancing problem publication-title: Int. J. Prod. Res. – volume: 40 start-page: 7231 year: 2013 end-page: 7241 ident: b59 article-title: Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem publication-title: Expert Syst. Appl. – volume: 51 start-page: 6082 year: 2013 end-page: 6096 ident: b5 article-title: Mixed model disassembly line balancing problem with fuzzy goals publication-title: Int. J. Prod. Res. – volume: 48 start-page: 107 year: 2018 end-page: 119 ident: b7 article-title: Resource-constrained assembly line balancing problems with multi-manned workstations publication-title: J. Manuf. Syst. – volume: 50 start-page: 203 year: 2018 end-page: 212 ident: b2 article-title: Robotic disassembly for increased recovery of strategically important materials from electrical vehicles publication-title: Robot. Comput.-Integr. Manuf. – reference: S. Mete, Z.A. Cil, E. Ozceylan, K. Agpak, Resource Constrained Disassembly Line Balancing Problem, in: 8th IFAC Conference on Manufacturing Modelling, Management and Control (MIM), Troyes, FRANCE, 2016, pp. 921–925. – volume: 3 start-page: 129 year: 2016 end-page: 142 ident: b1 article-title: Trends and research challenges in remanufacturing publication-title: Int. J. Precis. Eng. Manuf.-Green Technol. – volume: 55 start-page: 6108 year: 2017 end-page: 6119 ident: b15 article-title: Disassembly line balancing using linear physical programming publication-title: Int. J. Prod. Res. – volume: 12 year: 2022 ident: b51 article-title: Hybrid salp swarm algorithm for solving the green scheduling problem in a double-flexible job shop publication-title: Appl. Sci.-Basel – volume: 101 start-page: 547 year: 2019 end-page: 570 ident: b54 article-title: Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms publication-title: Computing – volume: 86 start-page: 165 year: 2017 end-page: 176 ident: b11 article-title: A Pareto improved artificial fish swarm algorithm for solving a multi-objective fuzzy disassembly line balancing problem publication-title: Expert Syst. Appl. – volume: 85 year: 2019 ident: b47 article-title: A mutated salp swarm algorithm for optimum allocation of active and reactive power sources in radial distribution systems publication-title: Appl. Soft. Comput. – volume: 40 start-page: 2569 year: 2002 end-page: 2589 ident: b56 article-title: Disassembly line in product recovery publication-title: Int. J. Prod. Res. – volume: 107 year: 2021 ident: b34 article-title: A genetic simulated annealing algorithm for parallel partial disassembly line balancing problem publication-title: Appl. Soft. Comput. – volume: 86 start-page: 335 year: 2020 end-page: 348 ident: b37 article-title: Robotic disassembly line balancing problem: A mathematical model and ant colony optimization approach publication-title: Appl. Math. Model. – volume: 145 year: 2020 ident: b52 article-title: Boosting salp swarm algorithm by sine cosine algorithm and disrupt operator for feature selection publication-title: Expert Syst. Appl. – reference: . – reference: M. Abd Elaziz, L. Abualigah, A.A. Ewees, M.A.A. Al-qaness, R.R. Mostafa, D. Yousri, R.A. Ibrahim, Triangular mutation-based manta-ray foraging optimization and orthogonal learning for global optimization and engineering problems, Appl. Intell. – volume: 73 year: 2022 ident: b25 article-title: Mixed-integer programming model and hybrid driving algorithm for multi-product partial disassembly line balancing problem with multi-robot workstations publication-title: Robot. Comput.-Integr. Manuf. – volume: 114 start-page: 163 year: 2017 end-page: 191 ident: b45 article-title: Salp swarm algorithm: A bio-inspired optimizer for engineering design problems publication-title: Adv. Eng. Softw. – volume: 58 start-page: 846 year: 2020 end-page: 862 ident: b4 article-title: Multi-objective evolutionary simulated annealing optimisation for mixed-model multi-robotic disassembly line balancing with interval processing time publication-title: Int. J. Prod. Res. – volume: 48 start-page: 761 year: 2010 end-page: 771 ident: b38 article-title: A new multi-objective ant colony algorithm for solving the disassembly line balancing problem publication-title: Int. J. Adv. Manuf. Technol. – volume: 56 start-page: 392 year: 2020 end-page: 413 ident: b24 article-title: Evolutionary optimization using epsilon method for resource-constrained multi-robotic disassembly line balancing publication-title: J. Manuf. Syst. – volume: 55 start-page: 1111 year: 2011 end-page: 1122 ident: b33 article-title: A novel two-stage genetic algorithm for a mixed-model U-line balancing problem with duplicated tasks publication-title: Int. J. Adv. Manuf. Technol. – volume: 11 year: 2019 ident: b13 article-title: A balancing method of mixed-model disassembly line in random working environment publication-title: Sustainability – volume: 57 start-page: 643 year: 2019 end-page: 661 ident: b8 article-title: A realistic multi-manned five-sided mixed-model assembly line balancing and scheduling problem with moving workers and limited workspace publication-title: Int. J. Prod. Res. – start-page: 14 year: 2019 end-page: 21 ident: b22 article-title: Many-objective best-order-sort genetic algorithm for mixed-model multi-robotic disassembly line balancing publication-title: 11th CIRP Conference on Industrial Product-Service Systems – ident: 10.1016/j.asoc.2022.109759_b21 doi: 10.1007/s10479-020-03902-3 – volume: 86 start-page: 165 year: 2017 ident: 10.1016/j.asoc.2022.109759_b11 article-title: A Pareto improved artificial fish swarm algorithm for solving a multi-objective fuzzy disassembly line balancing problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2017.05.053 – volume: 94 year: 2020 ident: 10.1016/j.asoc.2022.109759_b49 article-title: A modified salp swarm algorithm for task assignment problem publication-title: Appl. Soft. Comput. doi: 10.1016/j.asoc.2020.106445 – ident: 10.1016/j.asoc.2022.109759_b17 doi: 10.1109/TASE.2021.3133601 – volume: 58 start-page: 649 year: 2020 ident: 10.1016/j.asoc.2022.109759_b18 article-title: Disassembly line design with multi-manned workstations: a novel heuristic optimisation approach publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2019.1587190 – volume: 26 start-page: 1379 year: 2015 ident: 10.1016/j.asoc.2022.109759_b36 article-title: Bio-inspired search algorithms to solve robotic assembly line balancing problems publication-title: Neural Comput. Appl. doi: 10.1007/s00521-014-1811-x – volume: 113 year: 2021 ident: 10.1016/j.asoc.2022.109759_b40 article-title: Integration of balancing and preventive maintenance in straight and U-shaped resource-dependent assembly lines: MILP model and memetic algorithm publication-title: Appl. Soft. Comput. doi: 10.1016/j.asoc.2021.107773 – volume: 58 start-page: 3220 year: 2020 ident: 10.1016/j.asoc.2022.109759_b60 article-title: A fast branch, bound and remember algorithm for disassembly line balancing problem publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2019.1630774 – volume: 57 start-page: 643 year: 2019 ident: 10.1016/j.asoc.2022.109759_b8 article-title: A realistic multi-manned five-sided mixed-model assembly line balancing and scheduling problem with moving workers and limited workspace publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2018.1476786 – ident: 10.1016/j.asoc.2022.109759_b28 doi: 10.1016/j.ifacol.2016.07.893 – volume: 8 start-page: 88745 year: 2020 ident: 10.1016/j.asoc.2022.109759_b29 article-title: Multiobjective ecological strategy optimization for two-stage disassembly line balancing with constrained-resource publication-title: IEEE Access doi: 10.1109/ACCESS.2020.2994065 – volume: 145 year: 2020 ident: 10.1016/j.asoc.2022.109759_b52 article-title: Boosting salp swarm algorithm by sine cosine algorithm and disrupt operator for feature selection publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2019.113103 – volume: 116 year: 2022 ident: 10.1016/j.asoc.2022.109759_b42 article-title: Multi-mechanism-based modified bi-objective Harris Hawks optimization for sustainable robotic disassembly line balancing problems publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2022.105479 – volume: 146 year: 2022 ident: 10.1016/j.asoc.2022.109759_b27 article-title: A novel constraint programming and simulated annealing for disassembly line balancing problem with AND/OR precedence and sequence dependent setup times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2022.105915 – volume: 69 start-page: 197 year: 2013 ident: 10.1016/j.asoc.2022.109759_b35 article-title: A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-013-4990-1 – volume: 93 year: 2021 ident: 10.1016/j.asoc.2022.109759_b55 article-title: Atomic orbital search: A novel metaheuristic algorithm publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2020.12.021 – volume: 85 year: 2019 ident: 10.1016/j.asoc.2022.109759_b47 article-title: A mutated salp swarm algorithm for optimum allocation of active and reactive power sources in radial distribution systems publication-title: Appl. Soft. Comput. doi: 10.1016/j.asoc.2019.105833 – volume: 58 start-page: 5721 year: 2020 ident: 10.1016/j.asoc.2022.109759_b53 article-title: A multi-objective distribution-free model and method for stochastic disassembly line balancing problem publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2019.1656841 – volume: 51 start-page: 6082 year: 2013 ident: 10.1016/j.asoc.2022.109759_b5 article-title: Mixed model disassembly line balancing problem with fuzzy goals publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2013.795251 – volume: 101 start-page: 547 year: 2019 ident: 10.1016/j.asoc.2022.109759_b54 article-title: Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms publication-title: Computing doi: 10.1007/s00607-018-00693-1 – volume: 58 start-page: 846 year: 2020 ident: 10.1016/j.asoc.2022.109759_b4 article-title: Multi-objective evolutionary simulated annealing optimisation for mixed-model multi-robotic disassembly line balancing with interval processing time publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2019.1602290 – volume: 12 year: 2022 ident: 10.1016/j.asoc.2022.109759_b51 article-title: Hybrid salp swarm algorithm for solving the green scheduling problem in a double-flexible job shop publication-title: Appl. Sci.-Basel – volume: 1 start-page: 67 year: 1997 ident: 10.1016/j.asoc.2022.109759_b48 article-title: No free lunch theorems for optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.585893 – volume: 11 year: 2019 ident: 10.1016/j.asoc.2022.109759_b13 article-title: A balancing method of mixed-model disassembly line in random working environment publication-title: Sustainability doi: 10.3390/su11082304 – volume: 276 start-page: 160 year: 2019 ident: 10.1016/j.asoc.2022.109759_b23 article-title: Evolutionary many-objective optimization for mixed-model disassembly line balancing with multi-robotic workstations publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2018.12.035 – start-page: 14 year: 2019 ident: 10.1016/j.asoc.2022.109759_b22 article-title: Many-objective best-order-sort genetic algorithm for mixed-model multi-robotic disassembly line balancing – volume: 50 start-page: 203 year: 2018 ident: 10.1016/j.asoc.2022.109759_b2 article-title: Robotic disassembly for increased recovery of strategically important materials from electrical vehicles publication-title: Robot. Comput.-Integr. Manuf. doi: 10.1016/j.rcim.2017.09.013 – volume: 55 start-page: 6108 year: 2017 ident: 10.1016/j.asoc.2022.109759_b15 article-title: Disassembly line balancing using linear physical programming publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2017.1324225 – volume: 55 start-page: 7302 year: 2017 ident: 10.1016/j.asoc.2022.109759_b57 article-title: An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2017.1341066 – volume: 48 start-page: 761 year: 2010 ident: 10.1016/j.asoc.2022.109759_b38 article-title: A new multi-objective ant colony algorithm for solving the disassembly line balancing problem publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-009-2303-5 – volume: 65 start-page: 413 year: 2013 ident: 10.1016/j.asoc.2022.109759_b32 article-title: Multi-objective optimization of stochastic disassembly line balancing with station paralleling publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2013.03.014 – volume: 25 start-page: 9545 year: 2021 ident: 10.1016/j.asoc.2022.109759_b44 article-title: Modified whale optimization algorithm for solving unrelated parallel machine scheduling problems publication-title: Soft Comput. doi: 10.1007/s00500-021-05889-w – volume: 46 start-page: 1405 year: 2008 ident: 10.1016/j.asoc.2022.109759_b14 article-title: A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem publication-title: Int. J. Prod. Res. doi: 10.1080/00207540600943985 – volume: 98 year: 2021 ident: 10.1016/j.asoc.2022.109759_b43 article-title: Balancing and sequencing problem of mixed-model U-shaped robotic assembly line: Mathematical model and dragonfly algorithm based approach publication-title: Appl. Soft. Comput. doi: 10.1016/j.asoc.2020.106739 – volume: 3 start-page: 129 year: 2016 ident: 10.1016/j.asoc.2022.109759_b1 article-title: Trends and research challenges in remanufacturing publication-title: Int. J. Precis. Eng. Manuf.-Green Technol. doi: 10.1007/s40684-016-0016-4 – volume: 21 start-page: 611 year: 2020 ident: 10.1016/j.asoc.2022.109759_b20 article-title: Type-e disassembly line balancing problem with multi-manned workstations publication-title: Optim. Eng. doi: 10.1007/s11081-019-09465-y – volume: 90 year: 2020 ident: 10.1016/j.asoc.2022.109759_b46 article-title: Emended salp swarm algorithm for multiobjective electric power dispatch problem publication-title: Appl. Soft. Comput. doi: 10.1016/j.asoc.2020.106172 – ident: 10.1016/j.asoc.2022.109759_b3 – volume: 99 start-page: 785 year: 2021 ident: 10.1016/j.asoc.2022.109759_b19 article-title: An exact solution method for multi-manned disassembly line design with AND/OR precedence relations publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2021.07.013 – volume: 60 start-page: 1973 year: 2022 ident: 10.1016/j.asoc.2022.109759_b16 article-title: Distributionally robust and risk-averse optimisation for the stochastic multi-product disassembly line balancing problem with workforce assignment publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2021.1881648 – volume: 130 start-page: 634 year: 2019 ident: 10.1016/j.asoc.2022.109759_b12 article-title: A multi-objective discrete flower pollination algorithm for stochastic two-sided partial disassembly line balancing problem publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2019.03.017 – volume: 249 start-page: 592 year: 2016 ident: 10.1016/j.asoc.2022.109759_b58 article-title: A disassembly line balancing problem with fixed number of workstations publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2015.09.004 – volume: 86 start-page: 335 year: 2020 ident: 10.1016/j.asoc.2022.109759_b37 article-title: Robotic disassembly line balancing problem: A mathematical model and ant colony optimization approach publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2020.05.006 – volume: 94 start-page: 285 year: 2021 ident: 10.1016/j.asoc.2022.109759_b50 article-title: Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2021.01.017 – ident: 10.1016/j.asoc.2022.109759_b39 doi: 10.1007/s10489-022-03899-1 – volume: 56 start-page: 392 year: 2020 ident: 10.1016/j.asoc.2022.109759_b24 article-title: Evolutionary optimization using epsilon method for resource-constrained multi-robotic disassembly line balancing publication-title: J. Manuf. Syst. doi: 10.1016/j.jmsy.2020.06.006 – ident: 10.1016/j.asoc.2022.109759_b26 doi: 10.1080/00207543.2022.2069059 – volume: 179 year: 2005 ident: 10.1016/j.asoc.2022.109759_b9 article-title: A balancing method and genetic algorithm for disassembly line balancing publication-title: European J. Oper. Res. – volume: 109 year: 2021 ident: 10.1016/j.asoc.2022.109759_b6 article-title: A robust MILP and gene expression programming based on heuristic rules for mixed-model multi-manned assembly line balancing publication-title: Appl. Soft. Comput. doi: 10.1016/j.asoc.2021.107513 – volume: 55 start-page: 1111 year: 2011 ident: 10.1016/j.asoc.2022.109759_b33 article-title: A novel two-stage genetic algorithm for a mixed-model U-line balancing problem with duplicated tasks publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-010-3120-6 – volume: 73 year: 2022 ident: 10.1016/j.asoc.2022.109759_b25 article-title: Mixed-integer programming model and hybrid driving algorithm for multi-product partial disassembly line balancing problem with multi-robot workstations publication-title: Robot. Comput.-Integr. Manuf. doi: 10.1016/j.rcim.2021.102251 – ident: 10.1016/j.asoc.2022.109759_b41 doi: 10.1109/TCYB.2021.3070122 – volume: 40 start-page: 7231 year: 2013 ident: 10.1016/j.asoc.2022.109759_b59 article-title: Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2013.06.067 – start-page: 700 year: 2020 ident: 10.1016/j.asoc.2022.109759_b30 article-title: A stochastic sequence-dependent multi-objective disassembly line balancing model subject to task failure and resource constraint via multi-objective cuckoo search – volume: 183 year: 2021 ident: 10.1016/j.asoc.2022.109759_b10 article-title: Modelling and solving profit-oriented U-shaped partial disassembly line balancing problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2021.115431 – volume: 40 start-page: 2569 year: 2002 ident: 10.1016/j.asoc.2022.109759_b56 article-title: Disassembly line in product recovery publication-title: Int. J. Prod. Res. doi: 10.1080/00207540210135622 – volume: 142 start-page: 259 year: 2013 ident: 10.1016/j.asoc.2022.109759_b31 article-title: A taxonomy of line balancing problems and their solution approaches publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2012.10.020 – volume: 107 year: 2021 ident: 10.1016/j.asoc.2022.109759_b34 article-title: A genetic simulated annealing algorithm for parallel partial disassembly line balancing problem publication-title: Appl. Soft. Comput. doi: 10.1016/j.asoc.2021.107404 – volume: 114 start-page: 163 year: 2017 ident: 10.1016/j.asoc.2022.109759_b45 article-title: Salp swarm algorithm: A bio-inspired optimizer for engineering design problems publication-title: Adv. Eng. Softw. doi: 10.1016/j.advengsoft.2017.07.002 – volume: 48 start-page: 107 year: 2018 ident: 10.1016/j.asoc.2022.109759_b7 article-title: Resource-constrained assembly line balancing problems with multi-manned workstations publication-title: J. Manuf. Syst. doi: 10.1016/j.jmsy.2018.07.001 |
| SSID | ssj0016928 |
| Score | 2.4733765 |
| Snippet | Due to the current popularity of product customization and unsuitability of single-person disassembly lines for large-size products, as well as considering the... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 109759 |
| SubjectTerms | Epsilon constraint Line balancing Mixed-model Multi-manned Resource-constrained Salp swarm algorithm |
| Title | A bi-objective salp swarm algorithm with sine cosine operator for resource constrained multi-manned disassembly line balancing problem |
| URI | https://dx.doi.org/10.1016/j.asoc.2022.109759 |
| Volume | 131 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1872-9681 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection customDbUrl: eissn: 1872-9681 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: ACRLP dateStart: 20010601 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] customDbUrl: eissn: 1872-9681 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: AIKHN dateStart: 20010601 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Science Direct customDbUrl: eissn: 1872-9681 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: .~1 dateStart: 20010601 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-9681 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: AKRWK dateStart: 20010601 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lj9MwELaq7oXLwgIrustWc-CGTBPXefhYVVRdHhUCVuotsh1nN1XaVG3Rai8c-d3MJM4KJNQDysFKMpYSjz0P-5sZxt4EJrVBYAUXuRZcWptwPaZtDuukcDJyIqBA4c-LeH4jPyyjZY9Nu1gYglV62d_K9EZa-ycjP5qjbVmOvqHnkUolY0FH-HhRBLtMqIrBu5-PMI8wVk19VSLmRO0DZ1qMl8YRQB9RiCaTI-Ur_Zdy-kPhzJ6xU28pwqT9mDPWc5vn7GlXhQH8onzBfk3AlLw2q1Z0wV5XW9jf690adHVbo_N_twbabgWCuIOtm6beuuaAHdBohZ3fw8eXlFBWI0EODdSQrzUJYsjLPVrZbm2qByDDFAxBIi3qPfAlaV6ym9n779M599UVuEW348BxoeciKWKDJpRzShkXmVA5k0onVBEq9BPTwok4NUYXCZ3faSk1qrIkj2yUF-Nz1t_UG_eKgcrRTMldYtF3In4YFZtYByaMkiCV42TAwm5YM-tTj9PPVFmHMVtlxIqMWJG1rBiwt499tm3ijaPUUcet7K_pk6FmONLv4j_7XbIndNfiWl6z_mH3w12hdXIww2b6DdnJZPr10xdqrz_OF78BUyvntQ |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELZ4DLDwRry5gQ2ZJq7z8IgQqDwXQGKLbMeBorap2iLEwsjv5i5xEEiIAWWIFJ-lxOfc3Wd_vmPsIDCpDQIruMi14NLahOs2LXNYJ4WTkRMBHRS-vok79_LiIXqYYifNWRiiVXrbX9v0ylr7Jy0_mq1ht9u6ReSRSiVjQVv4eE2zWRmJhBDY0fsXzyOMVVVglaQ5ifuTMzXJS-MQIEgUokrlSAlLf_NO3zzO2RJb8KEiHNdvs8ym3GCFLTZlGMD_lavs4xhMl5fmubZdMNa9IYxf9agPuvdYIvp_6gOttwJx3MGW1a0cumqHHTBqhZFfxMdGyiirUSCHimvI-5osMeTdMYbZrm96b0CRKRjiRFp0fOBr0qyx-7PTu5MO9-UVuEXcMeH4p-ciKWKDMZRzShkXmVA5k0onVBEqBIpp4UScGqOLhDbwtJQafVmSRzbKi_Y6mxmUA7fBQOUYp-QusQieSCFGxSbWgQmjJEhlO9lkYTOsmfW5x-ljellDMnvOSBUZqSKrVbHJDr_6DOvMG39KR422sh_zJ0PX8Ee_rX_222dznbvrq-zq_OZym81TS01y2WEzk9GL28VQZWL2qqn4CYFA57U |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+bi-objective+salp+swarm+algorithm+with+sine+cosine+operator+for+resource+constrained+multi-manned+disassembly+line+balancing+problem&rft.jtitle=Applied+soft+computing&rft.au=Zhou%2C+Binghai&rft.au=Bian%2C+Jingrao&rft.date=2022-12-01&rft.issn=1568-4946&rft.volume=131&rft.spage=109759&rft_id=info:doi/10.1016%2Fj.asoc.2022.109759&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_asoc_2022_109759 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1568-4946&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1568-4946&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1568-4946&client=summon |