Modelling and solving profit-oriented U-shaped partial disassembly line balancing problem
•Profit-oriented U-shaped partial disassembly line balancing problem is studied.•Mixed-integer linear programming model is developed for the proposed problem.•The proposed model solves the small-size problems optimally.•The cuckoo search algorithm is developed and improved for the considered problem...
Uložené v:
| Vydané v: | Expert systems with applications Ročník 183; s. 115431 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Elsevier Ltd
30.11.2021
Elsevier BV |
| Predmet: | |
| ISSN: | 0957-4174, 1873-6793 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •Profit-oriented U-shaped partial disassembly line balancing problem is studied.•Mixed-integer linear programming model is developed for the proposed problem.•The proposed model solves the small-size problems optimally.•The cuckoo search algorithm is developed and improved for the considered problem.•Experimental tests demonstrate the superiority of the proposed algorithm.
Disassembly lines are utilized frequently to disassemble the end-of-life products completely or partially to retain the valuable components for remanufacturing or recycling. This research introduces and solves the profit-oriented U-shaped partial disassembly line balancing problem (PUPDLBP) for the first time. A 0–1 integer linear programming model is formulated to tackle the PUPDLBP with AND/OR precedence, which is capable of solving the small-size instances optimally. As the considered problem is NP-hard, a novel discrete cuckoo search (DCS) algorithm is implemented and improved to solve the considered problem. The proposed DCS employs a two-phase decoding procedure to handle the precedence constraint, and new population update and new method to select and replace the abandoned individuals to achieve the proper balance between exploitation and exploration. Case studies demonstrate that the U-shaped line might obtain the larger total profit than a straight line. The comparative study shows that the improvements enhance the performance of DCS by a significant margin. The proposed algorithm outperforms CPLEX solver when solving large-sized instances and produce competing performance in comparison with 11 other algorithms. |
|---|---|
| AbstractList | •Profit-oriented U-shaped partial disassembly line balancing problem is studied.•Mixed-integer linear programming model is developed for the proposed problem.•The proposed model solves the small-size problems optimally.•The cuckoo search algorithm is developed and improved for the considered problem.•Experimental tests demonstrate the superiority of the proposed algorithm.
Disassembly lines are utilized frequently to disassemble the end-of-life products completely or partially to retain the valuable components for remanufacturing or recycling. This research introduces and solves the profit-oriented U-shaped partial disassembly line balancing problem (PUPDLBP) for the first time. A 0–1 integer linear programming model is formulated to tackle the PUPDLBP with AND/OR precedence, which is capable of solving the small-size instances optimally. As the considered problem is NP-hard, a novel discrete cuckoo search (DCS) algorithm is implemented and improved to solve the considered problem. The proposed DCS employs a two-phase decoding procedure to handle the precedence constraint, and new population update and new method to select and replace the abandoned individuals to achieve the proper balance between exploitation and exploration. Case studies demonstrate that the U-shaped line might obtain the larger total profit than a straight line. The comparative study shows that the improvements enhance the performance of DCS by a significant margin. The proposed algorithm outperforms CPLEX solver when solving large-sized instances and produce competing performance in comparison with 11 other algorithms. Disassembly lines are utilized frequently to disassemble the end-of-life products completely or partially to retain the valuable components for remanufacturing or recycling. This research introduces and solves the profit-oriented U-shaped partial disassembly line balancing problem (PUPDLBP) for the first time. A 0–1 integer linear programming model is formulated to tackle the PUPDLBP with AND/OR precedence, which is capable of solving the small-size instances optimally. As the considered problem is NP-hard, a novel discrete cuckoo search (DCS) algorithm is implemented and improved to solve the considered problem. The proposed DCS employs a two-phase decoding procedure to handle the precedence constraint, and new population update and new method to select and replace the abandoned individuals to achieve the proper balance between exploitation and exploration. Case studies demonstrate that the U-shaped line might obtain the larger total profit than a straight line. The comparative study shows that the improvements enhance the performance of DCS by a significant margin. The proposed algorithm outperforms CPLEX solver when solving large-sized instances and produce competing performance in comparison with 11 other algorithms. |
| ArticleNumber | 115431 |
| Author | Janardhanan, Mukund Nilakantan Li, Zixiang |
| Author_xml | – sequence: 1 givenname: Zixiang surname: Li fullname: Li, Zixiang organization: Key Laboratory of Metallurgical Equipment and Control Technology, Wuhan University of Science and Technology, China – sequence: 2 givenname: Mukund Nilakantan surname: Janardhanan fullname: Janardhanan, Mukund Nilakantan email: mukund.janardhanan@leicester.ac.uk organization: School of Engineering, University of Leicester, Leicester, United Kingdom |
| BookMark | eNp9kLtOwzAUhi1UJNrCCzBFYk6wc3MisaCKmwRioQOT5dgn4Mi1i-0W9e1xlE4Mnc4Z_u9cvgWaGWsAoWuCM4JJfTtk4H95luOcZIRUZUHO0Jw0tEhr2hYzNMdtRdOS0PICLbwfMCYUYzpHn29WgtbKfCXcyMRbvR_7rbO9Cql1CkwAmaxT_823sdlyFxTXiVSeew-bTh-SSEPScc2NOLKdhs0lOu-59nB1rEu0fnz4WD2nr-9PL6v711QUeRNSKkhNBMhGAEguoCk7WZRFjynuoK8AOlH28fC-4FQ00Dc5CGgrgjEnZd2IYoluprlx788OfGCD3TkTV7K8om0ZU3UVU_mUEs5676BnW6c23B0YwWxUyAY2KmSjQjYpjFDzDxIq8KCsCY4rfRq9m1CIr-8VOOZFdBkfVQ5EYNKqU_gfs9CQuQ |
| CitedBy_id | crossref_primary_10_1016_j_apm_2023_06_009 crossref_primary_10_3390_electronics14112290 crossref_primary_10_3390_info15030168 crossref_primary_10_1016_j_engappai_2022_105479 crossref_primary_10_3390_math12081218 crossref_primary_10_1109_TII_2023_3348811 crossref_primary_10_1016_j_asoc_2025_113273 crossref_primary_10_1016_j_aei_2024_102418 crossref_primary_10_1016_j_cie_2023_109704 crossref_primary_10_1155_2023_8847164 crossref_primary_10_3390_pr13061675 crossref_primary_10_1016_j_aei_2023_102237 crossref_primary_10_1016_j_engappai_2023_107416 crossref_primary_10_1016_j_jclepro_2022_131708 crossref_primary_10_1016_j_jmsy_2023_11_011 crossref_primary_10_3390_math11020298 crossref_primary_10_1016_j_jii_2025_100817 crossref_primary_10_1016_j_aei_2024_102750 crossref_primary_10_1109_ACCESS_2021_3117070 crossref_primary_10_1016_j_eswa_2023_120589 crossref_primary_10_1080_0951192X_2024_2335984 crossref_primary_10_1093_jcde_qwac134 crossref_primary_10_1109_TII_2023_3241583 crossref_primary_10_1080_00207543_2025_2452385 crossref_primary_10_1002_aisy_202400826 crossref_primary_10_1109_TASE_2024_3418898 crossref_primary_10_1016_j_asoc_2022_109759 crossref_primary_10_1016_j_rcim_2025_103081 crossref_primary_10_1016_j_rcim_2023_102650 crossref_primary_10_1038_s41598_022_19783_4 crossref_primary_10_1016_j_jmsy_2025_02_004 crossref_primary_10_1016_j_engappai_2025_110211 crossref_primary_10_1016_j_neucom_2023_127145 crossref_primary_10_1016_j_asoc_2024_111415 crossref_primary_10_1016_j_ijpe_2023_108928 crossref_primary_10_1016_j_jmsy_2025_09_006 crossref_primary_10_3390_math12244000 crossref_primary_10_1016_j_asoc_2025_112728 crossref_primary_10_1109_TCSS_2022_3217101 crossref_primary_10_1016_j_eswa_2023_121681 |
| Cites_doi | 10.1080/00207543.2018.1428775 10.1080/00207543.2018.1471238 10.1080/00207543.2014.965348 10.1080/00207540701476281 10.3390/su9020309 10.1016/j.eswa.2013.06.067 10.1016/j.cie.2017.07.005 10.1016/j.jclepro.2017.10.308 10.1016/j.cie.2018.06.037 10.1016/j.eswa.2017.05.053 10.1080/09537287.2013.782949 10.1287/mnsc.40.10.1378 10.1016/j.cie.2019.106056 10.1007/s00521-017-2855-5 10.1016/j.cie.2019.03.017 10.1080/00207540601137207 10.1080/00207543.2013.795251 10.1016/j.asoc.2011.05.008 10.1080/00207540110052157 10.1080/00207543.2017.1418987 10.1080/002075499191481 10.1016/j.ejor.2018.01.055 10.1080/00207540110051905 10.1016/j.jclepro.2018.11.114 10.1016/j.jmsy.2016.09.002 10.1080/00207543.2011.616915 10.1007/s10479-014-1641-3 10.1108/17410381311318909 10.1080/00207543.2019.1630774 10.1080/07408170802510390 10.1007/s00170-013-4990-1 10.1016/j.ejor.2005.03.055 10.1080/00207543.2018.1428774 10.1016/j.asoc.2014.05.036 10.1007/s00170-018-2183-7 10.1016/j.asoc.2014.12.010 10.1080/00207540600943985 10.1007/s00170-009-2303-5 10.1016/j.cie.2013.03.014 10.1080/00207540210135622 10.1007/s00170-005-0037-6 10.3390/e19110596 10.1016/j.jmsy.2014.11.015 10.1080/00207543.2017.1341066 10.1007/s00521-013-1402-2 10.1016/j.cor.2019.01.003 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier Ltd Copyright Elsevier BV Nov 30, 2021 |
| Copyright_xml | – notice: 2021 Elsevier Ltd – notice: Copyright Elsevier BV Nov 30, 2021 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.eswa.2021.115431 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-6793 |
| ExternalDocumentID | 10_1016_j_eswa_2021_115431 S0957417421008484 |
| GroupedDBID | --K --M .DC .~1 0R~ 13V 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABBOA ABFNM ABMAC ABMVD ABUCO ABYKQ ACDAQ ACGFS ACHRH ACNTT ACRLP ACZNC ADBBV ADEZE ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGJBL AGUBO AGUMN AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM AXJTR BJAXD BKOJK BLXMC BNSAS CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W JJJVA KOM LG9 LY1 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSL SST SSV SSZ T5K TN5 ~G- 29G 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABJNI ABKBG ABUFD ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB G-2 HLZ HVGLF HZ~ R2- SBC SET SEW WUQ XPP ZMT ~HD 7SC 8FD AFXIZ AGCQF AGRNS BNPGV JQ2 L7M L~C L~D SSH |
| ID | FETCH-LOGICAL-c328t-7c161ced8ceedace84bd343f070bef5eebc4f417f3a7c8ef82ece95100a1468c3 |
| ISICitedReferencesCount | 45 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000691812900006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0957-4174 |
| IngestDate | Mon Jul 14 10:45:27 EDT 2025 Sat Nov 29 07:04:39 EST 2025 Tue Nov 18 20:55:30 EST 2025 Fri Feb 23 02:41:53 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Integer programming U-shaped partial disassembly line Recycling Cuckoo search algorithm Disassembly line balancing Metaheuristics |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c328t-7c161ced8ceedace84bd343f070bef5eebc4f417f3a7c8ef82ece95100a1468c3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2579414665 |
| PQPubID | 2045477 |
| ParticipantIDs | proquest_journals_2579414665 crossref_primary_10_1016_j_eswa_2021_115431 crossref_citationtrail_10_1016_j_eswa_2021_115431 elsevier_sciencedirect_doi_10_1016_j_eswa_2021_115431 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-11-30 |
| PublicationDateYYYYMMDD | 2021-11-30 |
| PublicationDate_xml | – month: 11 year: 2021 text: 2021-11-30 day: 30 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Expert systems with applications |
| PublicationYear | 2021 |
| Publisher | Elsevier Ltd Elsevier BV |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier BV |
| References | Aydemir-Karadag, Turkbey (b0030) 2013; 65 Kalayci, Polat, Gupta (b0110) 2016; 242 McGovern, Gupta (b0170) 2006; 30 Zhang, Wang, Zhu, Wang (b0265) 2017; 86 Wang, Li, Gao (b0245) 2019; 211 Gonzalez, Castro, Melin, Castillo (b0050) 2015 Miltenburg, Wijngaard (b0190) 1994; 40 Yang, Suash (b0260) 2009 Mete, Çil, Özceylan, Ağpak, Battaïa (b0185) 2018; 56 Xiao, Wang, Yu, Nie (b0255) 2017; 19 Ding, Feng, Tan, Gao (b0040) 2010; 48 Li, Dey, Ashour, Tang (b0130) 2018; 30 Mete, Çil, Ağpak, Özceylan, Dolgui (b0180) 2016; 41 Paksoy, Güngör, Özceylan, Hancilar (b0205) 2013; 51 Ren, Zhang, Zhao, Triebe, Meng (b0225) 2018 Sanchez, Castillo, Castro (b0235) 2015; 27 Ren, Zhang, Zhao, Xiao, Tian (b0230) 2018; 269 Bentaha, Dolgui, Battaïa, Riggs, Hu (b0035) 2018; 56 Li, Çil, Mete, Kucukkoc (b0125) 2020; 58 Altekin, Akkan (b0010) 2012; 50 Ren, Zhang, Zhao, Tian, Lin, Meng, Li (b0220) 2018; 174 Altekin, Kandiller, Ozdemirel (b0015) 2008; 46 Scholl, Klein (b0240) 1999; 37 Özceylan, Kalayci, Güngör, Gupta (b0200) 2018; 57 Koc, Sabuncuoglu, Erel (b0115) 2009; 41 Zhu, Zhang, Wang (b0270) 2018; 56 Li, Kucukkoc, Zhang (b0140) 2018; 124 Gungor, Gupta (b0065) 2001; 39 Kalayci, Gupta (b0085) 2013; 24 McGovern, Gupta (b0175) 2007; 179 Ren, Yu, Zhang, Tian, Meng, Zhou (b0215) 2017; 55 Erel, Sabuncuoglu, Aksu (b0045) 2001; 39 Li, Chen, Zhu, Yang, Chu (b0120) 2019; 105 Agrawal, Tiwari (b0005) 2008; 46 Mcgovern, Gupta (b0160) 2007; 45 Kalayci, Gupta (b0095) 2013; 69 Kalayci, Gupta (b0090) 2013; 40 Güngör, Gupta (b0070) 1999 Ouaarab, Ahiod, Yang (b0195) 2014; 24 Li, Kucukkoc, Tang (b0135) 2017; 112 Avikal, Jain, Mishra (b0020) 2013; 3 Rajabioun (b0210) 2011; 11 McGovern, Gupta (b0165) 2003 Güngör, Gupta (b0075) 2002; 40 Guerrero, Castillo, García (b0060) 2015 Kalayci, Hancilar, Gungor, Gupta (b0105) 2015; 37 Liu, Wang (b0150) 2017; 9 Hezer, Kara (b0080) 2015; 53 Kalayci, Gupta (b0100) 2014; 25 Avikal, Mishra (b0025) 2012; 1 Gonzalez, Melin, Castro, Castillo, Mendoza (b0055) 2016; 47 Wang, Li, Gao (b0250) 2019; 130 Li, Kucukkoc, Zhang (b0145) 2019; 137 Liu, Zhou, Pham, Xu, Yan, Liu, Liu (b0155) 2018; 97 Miltenburg (10.1016/j.eswa.2021.115431_b0190) 1994; 40 Kalayci (10.1016/j.eswa.2021.115431_b0110) 2016; 242 Ren (10.1016/j.eswa.2021.115431_b0230) 2018; 269 Yang (10.1016/j.eswa.2021.115431_b0260) 2009 Kalayci (10.1016/j.eswa.2021.115431_b0105) 2015; 37 Güngör (10.1016/j.eswa.2021.115431_b0070) 1999 Li (10.1016/j.eswa.2021.115431_b0120) 2019; 105 Ouaarab (10.1016/j.eswa.2021.115431_b0195) 2014; 24 Zhu (10.1016/j.eswa.2021.115431_b0270) 2018; 56 Wang (10.1016/j.eswa.2021.115431_b0250) 2019; 130 Liu (10.1016/j.eswa.2021.115431_b0155) 2018; 97 Li (10.1016/j.eswa.2021.115431_b0135) 2017; 112 Kalayci (10.1016/j.eswa.2021.115431_b0095) 2013; 69 Ren (10.1016/j.eswa.2021.115431_b0215) 2017; 55 Mete (10.1016/j.eswa.2021.115431_b0185) 2018; 56 Ding (10.1016/j.eswa.2021.115431_b0040) 2010; 48 Gungor (10.1016/j.eswa.2021.115431_b0065) 2001; 39 Wang (10.1016/j.eswa.2021.115431_b0245) 2019; 211 Li (10.1016/j.eswa.2021.115431_b0125) 2020; 58 Gonzalez (10.1016/j.eswa.2021.115431_b0055) 2016; 47 Mete (10.1016/j.eswa.2021.115431_b0180) 2016; 41 Özceylan (10.1016/j.eswa.2021.115431_b0200) 2018; 57 Kalayci (10.1016/j.eswa.2021.115431_b0085) 2013; 24 Avikal (10.1016/j.eswa.2021.115431_b0025) 2012; 1 Kalayci (10.1016/j.eswa.2021.115431_b0090) 2013; 40 Erel (10.1016/j.eswa.2021.115431_b0045) 2001; 39 Ren (10.1016/j.eswa.2021.115431_b0225) 2018 McGovern (10.1016/j.eswa.2021.115431_b0170) 2006; 30 McGovern (10.1016/j.eswa.2021.115431_b0165) 2003 Xiao (10.1016/j.eswa.2021.115431_b0255) 2017; 19 Li (10.1016/j.eswa.2021.115431_b0145) 2019; 137 Guerrero (10.1016/j.eswa.2021.115431_b0060) 2015 Zhang (10.1016/j.eswa.2021.115431_b0265) 2017; 86 Avikal (10.1016/j.eswa.2021.115431_b0020) 2013; 3 Agrawal (10.1016/j.eswa.2021.115431_b0005) 2008; 46 Sanchez (10.1016/j.eswa.2021.115431_b0235) 2015; 27 Altekin (10.1016/j.eswa.2021.115431_b0010) 2012; 50 Koc (10.1016/j.eswa.2021.115431_b0115) 2009; 41 Güngör (10.1016/j.eswa.2021.115431_b0075) 2002; 40 Scholl (10.1016/j.eswa.2021.115431_b0240) 1999; 37 Li (10.1016/j.eswa.2021.115431_b0140) 2018; 124 Hezer (10.1016/j.eswa.2021.115431_b0080) 2015; 53 Ren (10.1016/j.eswa.2021.115431_b0220) 2018; 174 Paksoy (10.1016/j.eswa.2021.115431_b0205) 2013; 51 Kalayci (10.1016/j.eswa.2021.115431_b0100) 2014; 25 Aydemir-Karadag (10.1016/j.eswa.2021.115431_b0030) 2013; 65 Altekin (10.1016/j.eswa.2021.115431_b0015) 2008; 46 Gonzalez (10.1016/j.eswa.2021.115431_b0050) 2015 McGovern (10.1016/j.eswa.2021.115431_b0175) 2007; 179 Liu (10.1016/j.eswa.2021.115431_b0150) 2017; 9 Rajabioun (10.1016/j.eswa.2021.115431_b0210) 2011; 11 Bentaha (10.1016/j.eswa.2021.115431_b0035) 2018; 56 Li (10.1016/j.eswa.2021.115431_b0130) 2018; 30 Mcgovern (10.1016/j.eswa.2021.115431_b0160) 2007; 45 |
| References_xml | – volume: 112 start-page: 107 year: 2017 end-page: 121 ident: b0135 article-title: New MILP model and station-oriented ant colony optimization algorithm for balancing U-type assembly lines publication-title: Computers & Industrial Engineering – volume: 56 start-page: 7220 year: 2018 end-page: 7242 ident: b0035 article-title: Profit-oriented partial disassembly line design: Dealing with hazardous parts and task processing times uncertainty publication-title: International Journal of Production Research – volume: 24 start-page: 413 year: 2013 end-page: 427 ident: b0085 article-title: Ant colony optimization for sequence-dependent disassembly line balancing problem publication-title: Journal of Manufacturing Technology Management – volume: 37 start-page: 721 year: 1999 end-page: 736 ident: b0240 article-title: ULINO: Optimally balancing U-shaped JIT assembly lines publication-title: International Journal of Production Research – volume: 47 start-page: 631 year: 2016 end-page: 643 ident: b0055 article-title: Optimization of interval type-2 fuzzy systems for image edge detection publication-title: Applied Soft Computing – volume: 69 start-page: 197 year: 2013 end-page: 209 ident: b0095 article-title: A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem publication-title: The International Journal of Advanced Manufacturing Technology – volume: 137 start-page: 106056 year: 2019 ident: b0145 article-title: Iterated local search method and mathematical model for sequence-dependent U-shaped disassembly line balancing problem publication-title: Computers & Industrial Engineering – volume: 174 start-page: 1475 year: 2018 end-page: 1486 ident: b0220 article-title: Disassembly line balancing problem using interdependent weights-based multi-criteria decision making and 2-Optimal algorithm publication-title: Journal of Cleaner Production – volume: 50 start-page: 4955 year: 2012 end-page: 4976 ident: b0010 article-title: Task-failure-driven rebalancing of disassembly lines publication-title: International Journal of Production Research – volume: 40 start-page: 7231 year: 2013 end-page: 7241 ident: b0090 article-title: Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem publication-title: Expert Systems with Applications – volume: 65 start-page: 413 year: 2013 end-page: 425 ident: b0030 article-title: Multi-objective optimization of stochastic disassembly line balancing with station paralleling publication-title: Computers & Industrial Engineering – volume: 39 start-page: 3003 year: 2001 end-page: 3015 ident: b0045 article-title: Balancing of U-type assembly systems using simulated annealing publication-title: International Journal of Production Research – start-page: 71 year: 2003 end-page: 84 ident: b0165 article-title: 2-opt heuristic for the disassembly line balancing problem publication-title: Proceedings of the SPIE International Conference on Environmentally Conscious Manufacturing III, Providence, RI – volume: 211 start-page: 115 year: 2019 end-page: 133 ident: b0245 article-title: Modeling and optimization of multi-objective partial disassembly line balancing problem considering hazard and profit publication-title: Journal of Cleaner Production – volume: 48 start-page: 761 year: 2010 end-page: 771 ident: b0040 article-title: A new multi-objective ant colony algorithm for solving the disassembly line balancing problem publication-title: The International Journal of Advanced Manufacturing Technology – volume: 46 start-page: 2675 year: 2008 end-page: 2693 ident: b0015 article-title: Profit-oriented disassembly-line balancing publication-title: International Journal of Production Research – volume: 11 start-page: 5508 year: 2011 end-page: 5518 ident: b0210 article-title: Cuckoo optimization algorithm publication-title: Applied Soft Computing – volume: 39 start-page: 1427 year: 2001 end-page: 1467 ident: b0065 article-title: A solution approach to the disassembly line balancing problem in the presence of task failures publication-title: International Journal of Production Research – volume: 55 start-page: 7302 year: 2017 end-page: 7316 ident: b0215 article-title: An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem publication-title: International Journal of Production Research – volume: 58 start-page: 3220 year: 2020 end-page: 3234 ident: b0125 article-title: A fast branch, bound and remember algorithm for disassembly line balancing problem publication-title: International Journal of Production Research – volume: 86 start-page: 165 year: 2017 end-page: 176 ident: b0265 article-title: A Pareto improved artificial fish swarm algorithm for solving a multi-objective fuzzy disassembly line balancing problem publication-title: Expert Systems with Applications – volume: 9 start-page: 309 year: 2017 ident: b0150 article-title: Balancing disassembly line in product recovery to promote the coordinated development of economy and environment publication-title: Sustainability – volume: 97 start-page: 3937 year: 2018 end-page: 3962 ident: b0155 article-title: An improved multi-objective discrete bees algorithm for robotic disassembly line balancing problem in remanufacturing publication-title: International Journal of Advanced Manufacturing Technology – volume: 51 start-page: 6082 year: 2013 end-page: 6096 ident: b0205 article-title: Mixed model disassembly line balancing problem with fuzzy goals publication-title: International Journal of Production Research – start-page: 449 year: 2015 end-page: 455 ident: b0050 article-title: Cuckoo search algorithm for the optimization of type-2 fuzzy image edge detection systems publication-title: 2015 IEEE Congress on Evolutionary Computation (CEC) – volume: 41 start-page: 866 year: 2009 end-page: 881 ident: b0115 article-title: Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph publication-title: IIE Transactions – volume: 179 start-page: 692 year: 2007 end-page: 708 ident: b0175 article-title: A balancing method and genetic algorithm for disassembly line balancing publication-title: European Journal of Operational Research – start-page: 210 year: 2009 end-page: 214 ident: b0260 article-title: Cuckoo Search via Lévy flights publication-title: Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on – volume: 1 start-page: 2277 year: 2012 end-page: 7261 ident: b0025 article-title: A new U-shaped heuristic for disassembly line balancing problems publication-title: Internaional Journal of Science – start-page: 1 year: 2018 end-page: 14 ident: b0225 article-title: An MCDM-based multiobjective general variable neighborhood search approach for disassembly line balancing problem publication-title: IEEE Transactions on Systems, Man, and Cybernetics: Systems – volume: 57 start-page: 4805 year: 2018 end-page: 4827 ident: b0200 article-title: Disassembly line balancing problem: A review of the state of the art and future directions publication-title: International Journal of Production Research – volume: 45 start-page: 4485 year: 2007 end-page: 4511 ident: b0160 article-title: Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem publication-title: International Journal of Production Research – volume: 25 start-page: 149 year: 2014 end-page: 160 ident: b0100 article-title: A tabu search algorithm for balancing a sequence-dependent disassembly line publication-title: Production Planning & Control – volume: 40 start-page: 2569 year: 2002 end-page: 2589 ident: b0075 article-title: Disassembly line in product recovery publication-title: International Journal of Production Research – start-page: 441 year: 2015 end-page: 448 ident: b0060 article-title: Fuzzy dynamic parameters adaptation in the Cuckoo Search Algorithm using fuzzy logic publication-title: 2015 IEEE Congress on Evolutionary Computation (CEC) – volume: 19 start-page: 596 year: 2017 ident: b0255 article-title: An entropy-based adaptive hybrid particle swarm optimization for disassembly line balancing problems publication-title: Entropy – volume: 24 start-page: 1659 year: 2014 end-page: 1669 ident: b0195 article-title: Discrete cuckoo search algorithm for the travelling salesman problem publication-title: Neural Computing and Applications – volume: 41 start-page: 188 year: 2016 end-page: 200 ident: b0180 article-title: A solution approach based on beam search algorithm for disassembly line balancing problem publication-title: Journal of Manufacturing Systems – volume: 124 start-page: 24 year: 2018 end-page: 35 ident: b0140 article-title: Branch, bound and remember algorithm for U-shaped assembly line balancing problem publication-title: Computers & Industrial Engineering – volume: 37 start-page: 672 year: 2015 end-page: 682 ident: b0105 article-title: Multi-objective fuzzy disassembly line balancing using a hybrid discrete artificial bee colony algorithm publication-title: Journal of Manufacturing Systems – volume: 242 start-page: 321 year: 2016 end-page: 354 ident: b0110 article-title: A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem publication-title: Annals of Operations Research – volume: 46 start-page: 1405 year: 2008 end-page: 1429 ident: b0005 article-title: A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem publication-title: International Journal of Production Research – volume: 269 start-page: 647 year: 2018 end-page: 660 ident: b0230 article-title: An asynchronous parallel disassembly planning based on genetic algorithm publication-title: European Journal of Operational Research – volume: 105 start-page: 47 year: 2019 end-page: 57 ident: b0120 article-title: A branch, bound, and remember algorithm for the simple disassembly line balancing problem publication-title: Computers & Operations Research – volume: 27 start-page: 602 year: 2015 end-page: 609 ident: b0235 article-title: Information granule formation via the concept of uncertainty-based information with Interval Type-2 Fuzzy Sets representation and Takagi–Sugeno–Kang consequents optimized with Cuckoo search publication-title: Applied Soft Computing – volume: 130 start-page: 634 year: 2019 end-page: 649 ident: b0250 article-title: A multi-objective discrete flower pollination algorithm for stochastic two-sided partial disassembly line balancing problem publication-title: Computers & Industrial Engineering – start-page: 193 year: 1999 end-page: 195 ident: b0070 article-title: Disassembly line balancing publication-title: Proceedings of the Annual Meeting of the Northeast Decision Sciences Institute, Newport, RI – volume: 53 start-page: 1849 year: 2015 end-page: 1865 ident: b0080 article-title: A network-based shortest route model for parallel disassembly line balancing problem publication-title: International Journal of Production Research – volume: 56 start-page: 7354 year: 2018 end-page: 7374 ident: b0270 article-title: A Pareto firefly algorithm for multi-objective disassembly line balancing problems with hazard evaluation publication-title: International Journal of Production Research – volume: 40 start-page: 1378 year: 1994 end-page: 1388 ident: b0190 article-title: The U-line line balancing problem publication-title: Management Science – volume: 56 start-page: 7375 year: 2018 end-page: 7389 ident: b0185 article-title: An optimisation support for the design of hybrid production lines including assembly and disassembly tasks publication-title: International Journal of Production Research – volume: 30 start-page: 481 year: 2006 end-page: 496 ident: b0170 article-title: Ant colony optimization for disassembly sequencing with multiple objectives publication-title: The International Journal of Advanced Manufacturing Technology – volume: 3 start-page: 51 year: 2013 end-page: 56 ident: b0020 article-title: A heuristic for U-shaped disassembly line balancing problems publication-title: MIT International Journal of Mechanical Engineering – volume: 30 start-page: 2685 year: 2018 end-page: 2696 ident: b0130 article-title: Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem publication-title: Neural Computing & Applications – volume: 57 start-page: 4805 year: 2018 ident: 10.1016/j.eswa.2021.115431_b0200 article-title: Disassembly line balancing problem: A review of the state of the art and future directions publication-title: International Journal of Production Research doi: 10.1080/00207543.2018.1428775 – volume: 56 start-page: 7354 issue: 24 year: 2018 ident: 10.1016/j.eswa.2021.115431_b0270 article-title: A Pareto firefly algorithm for multi-objective disassembly line balancing problems with hazard evaluation publication-title: International Journal of Production Research doi: 10.1080/00207543.2018.1471238 – volume: 53 start-page: 1849 issue: 6 year: 2015 ident: 10.1016/j.eswa.2021.115431_b0080 article-title: A network-based shortest route model for parallel disassembly line balancing problem publication-title: International Journal of Production Research doi: 10.1080/00207543.2014.965348 – volume: 45 start-page: 4485 issue: 18-19 year: 2007 ident: 10.1016/j.eswa.2021.115431_b0160 article-title: Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem publication-title: International Journal of Production Research doi: 10.1080/00207540701476281 – volume: 9 start-page: 309 issue: 2 year: 2017 ident: 10.1016/j.eswa.2021.115431_b0150 article-title: Balancing disassembly line in product recovery to promote the coordinated development of economy and environment publication-title: Sustainability doi: 10.3390/su9020309 – volume: 40 start-page: 7231 issue: 18 year: 2013 ident: 10.1016/j.eswa.2021.115431_b0090 article-title: Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2013.06.067 – volume: 112 start-page: 107 year: 2017 ident: 10.1016/j.eswa.2021.115431_b0135 article-title: New MILP model and station-oriented ant colony optimization algorithm for balancing U-type assembly lines publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2017.07.005 – volume: 174 start-page: 1475 year: 2018 ident: 10.1016/j.eswa.2021.115431_b0220 article-title: Disassembly line balancing problem using interdependent weights-based multi-criteria decision making and 2-Optimal algorithm publication-title: Journal of Cleaner Production doi: 10.1016/j.jclepro.2017.10.308 – volume: 124 start-page: 24 year: 2018 ident: 10.1016/j.eswa.2021.115431_b0140 article-title: Branch, bound and remember algorithm for U-shaped assembly line balancing problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2018.06.037 – volume: 86 start-page: 165 year: 2017 ident: 10.1016/j.eswa.2021.115431_b0265 article-title: A Pareto improved artificial fish swarm algorithm for solving a multi-objective fuzzy disassembly line balancing problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2017.05.053 – volume: 25 start-page: 149 issue: 2 year: 2014 ident: 10.1016/j.eswa.2021.115431_b0100 article-title: A tabu search algorithm for balancing a sequence-dependent disassembly line publication-title: Production Planning & Control doi: 10.1080/09537287.2013.782949 – start-page: 441 year: 2015 ident: 10.1016/j.eswa.2021.115431_b0060 article-title: Fuzzy dynamic parameters adaptation in the Cuckoo Search Algorithm using fuzzy logic – start-page: 210 year: 2009 ident: 10.1016/j.eswa.2021.115431_b0260 article-title: Cuckoo Search via Lévy flights – volume: 40 start-page: 1378 issue: 10 year: 1994 ident: 10.1016/j.eswa.2021.115431_b0190 article-title: The U-line line balancing problem publication-title: Management Science doi: 10.1287/mnsc.40.10.1378 – volume: 137 start-page: 106056 year: 2019 ident: 10.1016/j.eswa.2021.115431_b0145 article-title: Iterated local search method and mathematical model for sequence-dependent U-shaped disassembly line balancing problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2019.106056 – volume: 30 start-page: 2685 issue: 9 year: 2018 ident: 10.1016/j.eswa.2021.115431_b0130 article-title: Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem publication-title: Neural Computing & Applications doi: 10.1007/s00521-017-2855-5 – volume: 130 start-page: 634 year: 2019 ident: 10.1016/j.eswa.2021.115431_b0250 article-title: A multi-objective discrete flower pollination algorithm for stochastic two-sided partial disassembly line balancing problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2019.03.017 – volume: 46 start-page: 2675 issue: 10 year: 2008 ident: 10.1016/j.eswa.2021.115431_b0015 article-title: Profit-oriented disassembly-line balancing publication-title: International Journal of Production Research doi: 10.1080/00207540601137207 – volume: 51 start-page: 6082 issue: 20 year: 2013 ident: 10.1016/j.eswa.2021.115431_b0205 article-title: Mixed model disassembly line balancing problem with fuzzy goals publication-title: International Journal of Production Research doi: 10.1080/00207543.2013.795251 – volume: 11 start-page: 5508 issue: 8 year: 2011 ident: 10.1016/j.eswa.2021.115431_b0210 article-title: Cuckoo optimization algorithm publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2011.05.008 – volume: 39 start-page: 1427 issue: 7 year: 2001 ident: 10.1016/j.eswa.2021.115431_b0065 article-title: A solution approach to the disassembly line balancing problem in the presence of task failures publication-title: International Journal of Production Research doi: 10.1080/00207540110052157 – volume: 56 start-page: 7220 issue: 24 year: 2018 ident: 10.1016/j.eswa.2021.115431_b0035 article-title: Profit-oriented partial disassembly line design: Dealing with hazardous parts and task processing times uncertainty publication-title: International Journal of Production Research doi: 10.1080/00207543.2017.1418987 – volume: 37 start-page: 721 issue: 4 year: 1999 ident: 10.1016/j.eswa.2021.115431_b0240 article-title: ULINO: Optimally balancing U-shaped JIT assembly lines publication-title: International Journal of Production Research doi: 10.1080/002075499191481 – volume: 269 start-page: 647 issue: 2 year: 2018 ident: 10.1016/j.eswa.2021.115431_b0230 article-title: An asynchronous parallel disassembly planning based on genetic algorithm publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.01.055 – volume: 39 start-page: 3003 issue: 13 year: 2001 ident: 10.1016/j.eswa.2021.115431_b0045 article-title: Balancing of U-type assembly systems using simulated annealing publication-title: International Journal of Production Research doi: 10.1080/00207540110051905 – start-page: 449 year: 2015 ident: 10.1016/j.eswa.2021.115431_b0050 article-title: Cuckoo search algorithm for the optimization of type-2 fuzzy image edge detection systems – volume: 211 start-page: 115 year: 2019 ident: 10.1016/j.eswa.2021.115431_b0245 article-title: Modeling and optimization of multi-objective partial disassembly line balancing problem considering hazard and profit publication-title: Journal of Cleaner Production doi: 10.1016/j.jclepro.2018.11.114 – volume: 41 start-page: 188 year: 2016 ident: 10.1016/j.eswa.2021.115431_b0180 article-title: A solution approach based on beam search algorithm for disassembly line balancing problem publication-title: Journal of Manufacturing Systems doi: 10.1016/j.jmsy.2016.09.002 – volume: 1 start-page: 2277 year: 2012 ident: 10.1016/j.eswa.2021.115431_b0025 article-title: A new U-shaped heuristic for disassembly line balancing problems publication-title: Internaional Journal of Science – volume: 50 start-page: 4955 issue: 18 year: 2012 ident: 10.1016/j.eswa.2021.115431_b0010 article-title: Task-failure-driven rebalancing of disassembly lines publication-title: International Journal of Production Research doi: 10.1080/00207543.2011.616915 – start-page: 71 year: 2003 ident: 10.1016/j.eswa.2021.115431_b0165 article-title: 2-opt heuristic for the disassembly line balancing problem – volume: 242 start-page: 321 issue: 2 year: 2016 ident: 10.1016/j.eswa.2021.115431_b0110 article-title: A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem publication-title: Annals of Operations Research doi: 10.1007/s10479-014-1641-3 – start-page: 1 year: 2018 ident: 10.1016/j.eswa.2021.115431_b0225 article-title: An MCDM-based multiobjective general variable neighborhood search approach for disassembly line balancing problem publication-title: IEEE Transactions on Systems, Man, and Cybernetics: Systems – volume: 3 start-page: 51 year: 2013 ident: 10.1016/j.eswa.2021.115431_b0020 article-title: A heuristic for U-shaped disassembly line balancing problems publication-title: MIT International Journal of Mechanical Engineering – volume: 24 start-page: 413 issue: 3 year: 2013 ident: 10.1016/j.eswa.2021.115431_b0085 article-title: Ant colony optimization for sequence-dependent disassembly line balancing problem publication-title: Journal of Manufacturing Technology Management doi: 10.1108/17410381311318909 – volume: 58 start-page: 3220 issue: 11 year: 2020 ident: 10.1016/j.eswa.2021.115431_b0125 article-title: A fast branch, bound and remember algorithm for disassembly line balancing problem publication-title: International Journal of Production Research doi: 10.1080/00207543.2019.1630774 – volume: 41 start-page: 866 issue: 10 year: 2009 ident: 10.1016/j.eswa.2021.115431_b0115 article-title: Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph publication-title: IIE Transactions doi: 10.1080/07408170802510390 – volume: 69 start-page: 197 issue: 1-4 year: 2013 ident: 10.1016/j.eswa.2021.115431_b0095 article-title: A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem publication-title: The International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-013-4990-1 – start-page: 193 year: 1999 ident: 10.1016/j.eswa.2021.115431_b0070 article-title: Disassembly line balancing – volume: 179 start-page: 692 issue: 3 year: 2007 ident: 10.1016/j.eswa.2021.115431_b0175 article-title: A balancing method and genetic algorithm for disassembly line balancing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.03.055 – volume: 56 start-page: 7375 issue: 24 year: 2018 ident: 10.1016/j.eswa.2021.115431_b0185 article-title: An optimisation support for the design of hybrid production lines including assembly and disassembly tasks publication-title: International Journal of Production Research doi: 10.1080/00207543.2018.1428774 – volume: 27 start-page: 602 year: 2015 ident: 10.1016/j.eswa.2021.115431_b0235 article-title: Information granule formation via the concept of uncertainty-based information with Interval Type-2 Fuzzy Sets representation and Takagi–Sugeno–Kang consequents optimized with Cuckoo search publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2014.05.036 – volume: 97 start-page: 3937 issue: 9-12 year: 2018 ident: 10.1016/j.eswa.2021.115431_b0155 article-title: An improved multi-objective discrete bees algorithm for robotic disassembly line balancing problem in remanufacturing publication-title: International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-018-2183-7 – volume: 47 start-page: 631 year: 2016 ident: 10.1016/j.eswa.2021.115431_b0055 article-title: Optimization of interval type-2 fuzzy systems for image edge detection publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2014.12.010 – volume: 46 start-page: 1405 issue: 6 year: 2008 ident: 10.1016/j.eswa.2021.115431_b0005 article-title: A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem publication-title: International Journal of Production Research doi: 10.1080/00207540600943985 – volume: 48 start-page: 761 issue: 5-8 year: 2010 ident: 10.1016/j.eswa.2021.115431_b0040 article-title: A new multi-objective ant colony algorithm for solving the disassembly line balancing problem publication-title: The International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-009-2303-5 – volume: 65 start-page: 413 issue: 3 year: 2013 ident: 10.1016/j.eswa.2021.115431_b0030 article-title: Multi-objective optimization of stochastic disassembly line balancing with station paralleling publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2013.03.014 – volume: 40 start-page: 2569 issue: 11 year: 2002 ident: 10.1016/j.eswa.2021.115431_b0075 article-title: Disassembly line in product recovery publication-title: International Journal of Production Research doi: 10.1080/00207540210135622 – volume: 30 start-page: 481 issue: 5-6 year: 2006 ident: 10.1016/j.eswa.2021.115431_b0170 article-title: Ant colony optimization for disassembly sequencing with multiple objectives publication-title: The International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-005-0037-6 – volume: 19 start-page: 596 issue: 11 year: 2017 ident: 10.1016/j.eswa.2021.115431_b0255 article-title: An entropy-based adaptive hybrid particle swarm optimization for disassembly line balancing problems publication-title: Entropy doi: 10.3390/e19110596 – volume: 37 start-page: 672 year: 2015 ident: 10.1016/j.eswa.2021.115431_b0105 article-title: Multi-objective fuzzy disassembly line balancing using a hybrid discrete artificial bee colony algorithm publication-title: Journal of Manufacturing Systems doi: 10.1016/j.jmsy.2014.11.015 – volume: 55 start-page: 7302 issue: 24 year: 2017 ident: 10.1016/j.eswa.2021.115431_b0215 article-title: An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem publication-title: International Journal of Production Research doi: 10.1080/00207543.2017.1341066 – volume: 24 start-page: 1659 issue: 7-8 year: 2014 ident: 10.1016/j.eswa.2021.115431_b0195 article-title: Discrete cuckoo search algorithm for the travelling salesman problem publication-title: Neural Computing and Applications doi: 10.1007/s00521-013-1402-2 – volume: 105 start-page: 47 year: 2019 ident: 10.1016/j.eswa.2021.115431_b0120 article-title: A branch, bound, and remember algorithm for the simple disassembly line balancing problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2019.01.003 |
| SSID | ssj0017007 |
| Score | 2.5636907 |
| Snippet | •Profit-oriented U-shaped partial disassembly line balancing problem is studied.•Mixed-integer linear programming model is developed for the proposed... Disassembly lines are utilized frequently to disassemble the end-of-life products completely or partially to retain the valuable components for remanufacturing... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 115431 |
| SubjectTerms | Balancing Comparative studies Cuckoo search algorithm Disassembly line balancing Dismantling End of life Integer programming Linear programming Metaheuristics Precedence constraints Recycling Remanufacturing Search algorithms Straight lines U-shaped partial disassembly line |
| Title | Modelling and solving profit-oriented U-shaped partial disassembly line balancing problem |
| URI | https://dx.doi.org/10.1016/j.eswa.2021.115431 https://www.proquest.com/docview/2579414665 |
| Volume | 183 |
| WOSCitedRecordID | wos000691812900006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-6793 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017007 issn: 0957-4174 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLdg48AFxpc22JAP3CZXTeLUznFCQ4CgQmJDhYvl2A7rVrJqSUf573kvttOtggmQuERRFNuJ3y_Pvzy_D0JejAqdF7bMmOTWMi6qIdNVVTCpc5E4U3Db7Z5_eifGYzmZFB9CxHXTlRMQdS2Xy2L-X0UN10DYGDr7F-LuO4ULcA5ChyOIHY5_JHisbuYTbXub-OzSB5xDpy07x7TGSDKPWXOi53Ayxy78Tg3waPetnP3Y76hniU6PJrTFojPXjPiYIbkNeaBjhNyVvfDez6dzFvgyXQIKv_beOroGXJ7oUBr5_eJsAU86ns70Gcg5wDVYItIkZkCM5rEYIrPyR_J2RsF44kvxDJzXslJkbCR8acSVGs5-qdK9deF04JrvmCcqTQaYQSgsHddTZX_EwXCsNOnqBPDbZDMVeQEKe_PgzeHkbb-_JIY-kD4-XAin8p5_6yP9jrKsLd4dIznaIvfCrwQ98BB4QG65-iG5H8t00KC1H5HPPSIoIIIGRNA1RNCICBoQQa8ggiIiaI8IGhDxmBy_Ojx6-ZqFihrMZKlsmTBA8I2zEqmRNk7y0mY8q0Dvl67KnSsNr2A-qkwLI10lU2cccvChxhA9kz0hG_V57bYJBd5sreB5WmpsATQ34baEv_uhEU5meockcdKUCenmserJTEW_wlOFE61wopWf6B2y37eZ-2QrN96dR1moQBc9DVQAnRvb7UbBqfDdNgpWroLDO47yp__Y7TNyd_VR7JKN9mLh9sgdc9lOm4vnAYA_AXDrnbw |
| linkProvider | Elsevier |
| 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=Modelling+and+solving+profit-oriented+U-shaped+partial+disassembly+line+balancing+problem&rft.jtitle=Expert+systems+with+applications&rft.au=Li%2C+Zixiang&rft.au=Janardhanan%2C+Mukund+Nilakantan&rft.date=2021-11-30&rft.pub=Elsevier+Ltd&rft.issn=0957-4174&rft.eissn=1873-6793&rft.volume=183&rft_id=info:doi/10.1016%2Fj.eswa.2021.115431&rft.externalDocID=S0957417421008484 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0957-4174&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0957-4174&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0957-4174&client=summon |