Constraint programming approaches to disassembly line balancing problem with sequencing decisions
•A disassembly line balancing problem with sequencing decisions is considered.•The constraint programming model is able solve the problems with up to 35 tasks.•The proposed approach finds new best solutions for all large-sized instances.•The use of warm-start in the models makes the large-sized prob...
Saved in:
| Published in: | Computers & operations research Vol. 126; pp. 105111 - 20 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Elsevier Ltd
01.02.2021
Pergamon Press Inc |
| Subjects: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | •A disassembly line balancing problem with sequencing decisions is considered.•The constraint programming model is able solve the problems with up to 35 tasks.•The proposed approach finds new best solutions for all large-sized instances.•The use of warm-start in the models makes the large-sized problems solvable.
Recovery of products has received much attention in the last decade due to the increase in both environmental awareness and regulations enacted by governments. In product recovery, disassembly of a product into its constituent parts on a line is one of the most significant operations. This paper deals with a disassembly line balancing and sequencing (DLBS) problem subject to balancing issues, hazardousness of parts, demand quantities and direction changes considered in a lexicographic order. Due to the combinatorial nature of this problem, exact methods, e.g., mixed integer linear programming (MILP), are able to solve only small and medium size problems. Therefore, various metaheuristic algorithms are proposed in literature to find near-optimal solutions. In this paper, constraint programming (CP), which is a suitable technique especially for highly-constrained discrete problems, is used to develop models and solution approaches. To the best of author’s knowledge, this study is the first that uses CP for the disassembly line balancing problems. For the DLBS problem, first, a generic CP model is developed. This CP model provides efficient results for small/medium size disassembly problems and benchmark instances. Observing that the generic CP model could not produce even feasible sequence of tasks for some large-sized benchmark instances, a CP-based solution approach is proposed. This approach generates a feasible sequence subject to a fixed assignment of tasks to the workstations by using a CP model and uses this sequence as an initial feasible solution within a warm-start context in CP sequencing models. The computational results show that the proposed CP model improves the several best solutions of medium-sized benchmark instances, while the proposed CP-based solution approach produces excellent results in all large test instances by either improving the best solutions (found so far) or establishing new benchmark solutions. |
|---|---|
| AbstractList | Recovery of products has received much attention in the last decade due to the increase in both environmental awareness and regulations enacted by governments. In product recovery, disassembly of a product into its constituent parts on a line is one of the most significant operations. This paper deals with a disassembly line balancing and sequencing (DLBS) problem subject to balancing issues, hazardousness of parts, demand quantities and direction changes considered in a lexicographic order. Due to the combinatorial nature of this problem, exact methods, e.g., mixed integer linear programming (MILP), are able to solve only small and medium size problems. Therefore, various metaheuristic algorithms are proposed in literature to find near-optimal solutions. In this paper, constraint programming (CP), which is a suitable technique especially for highly-constrained discrete problems, is used to develop models and solution approaches. To the best of author’s knowledge, this study is the first that uses CP for the disassembly line balancing problems. For the DLBS problem, first, a generic CP model is developed. This CP model provides efficient results for small/medium size disassembly problems and benchmark instances. Observing that the generic CP model could not produce even feasible sequence of tasks for some large-sized benchmark instances, a CP-based solution approach is proposed. This approach generates a feasible sequence subject to a fixed assignment of tasks to the workstations by using a CP model and uses this sequence as an initial feasible solution within a warm-start context in CP sequencing models. The computational results show that the proposed CP model improves the several best solutions of medium-sized benchmark instances, while the proposed CP-based solution approach produces excellent results in all large test instances by either improving the best solutions (found so far) or establishing new benchmark solutions. •A disassembly line balancing problem with sequencing decisions is considered.•The constraint programming model is able solve the problems with up to 35 tasks.•The proposed approach finds new best solutions for all large-sized instances.•The use of warm-start in the models makes the large-sized problems solvable. Recovery of products has received much attention in the last decade due to the increase in both environmental awareness and regulations enacted by governments. In product recovery, disassembly of a product into its constituent parts on a line is one of the most significant operations. This paper deals with a disassembly line balancing and sequencing (DLBS) problem subject to balancing issues, hazardousness of parts, demand quantities and direction changes considered in a lexicographic order. Due to the combinatorial nature of this problem, exact methods, e.g., mixed integer linear programming (MILP), are able to solve only small and medium size problems. Therefore, various metaheuristic algorithms are proposed in literature to find near-optimal solutions. In this paper, constraint programming (CP), which is a suitable technique especially for highly-constrained discrete problems, is used to develop models and solution approaches. To the best of author’s knowledge, this study is the first that uses CP for the disassembly line balancing problems. For the DLBS problem, first, a generic CP model is developed. This CP model provides efficient results for small/medium size disassembly problems and benchmark instances. Observing that the generic CP model could not produce even feasible sequence of tasks for some large-sized benchmark instances, a CP-based solution approach is proposed. This approach generates a feasible sequence subject to a fixed assignment of tasks to the workstations by using a CP model and uses this sequence as an initial feasible solution within a warm-start context in CP sequencing models. The computational results show that the proposed CP model improves the several best solutions of medium-sized benchmark instances, while the proposed CP-based solution approach produces excellent results in all large test instances by either improving the best solutions (found so far) or establishing new benchmark solutions. |
| ArticleNumber | 105111 |
| Author | Edis, Emrah B. |
| Author_xml | – sequence: 1 givenname: Emrah B. surname: Edis fullname: Edis, Emrah B. organization: Department of Industrial Engineering, Manisa Celal Bayar University, 45140 Manisa, Turkey |
| BookMark | eNp9kD9vwyAQxVGVSk3TfoBuSJ2dAjZgq1MV9Z8UqUuGbgjjc0JkmxRIq3z7YrlThzCADr139-53jWaDGwChO0qWlFDxsF8a55eMsLHmlNILNKelzDMp-OcMzUlOeEZ4UV6h6xD2JB3J6BzplRtC9NoOER-823rd93bYYn1IlTY7CDg63NigQ4C-7k64swPgWnd6MKMwyeoOevxj4w4H-DrC9N-AscGm5jfostVdgNu_d4E2L8-b1Vu2_nh9Xz2tM5NzGbNKAG9LaEADVJpJJhrNKtMWbS3yQgJNVyVZS5kpGBEsl0LzipeiYNRIli_Q_dQ2BUohQlR7d_RDmqhYUValkGUlkkpOKuNdCB5aZWzUMeUcGXSKEjXiVHuVcKoRp5pwJif95zx422t_Out5nDyQ9v624FUwNvGBxnowUTXOnnH_AmKFkIo |
| CitedBy_id | crossref_primary_10_1016_j_apm_2023_06_009 crossref_primary_10_1080_00207543_2022_2028199 crossref_primary_10_1109_ACCESS_2025_3559059 crossref_primary_10_1007_s10696_024_09583_5 crossref_primary_10_1016_j_aei_2025_103210 crossref_primary_10_1080_0305215X_2023_2296538 crossref_primary_10_1016_j_asoc_2025_113213 crossref_primary_10_1155_2023_8847164 crossref_primary_10_1016_j_jmsy_2022_04_018 crossref_primary_10_1016_j_jclepro_2025_146210 crossref_primary_10_1016_j_jii_2025_100817 crossref_primary_10_1016_j_cie_2025_111046 crossref_primary_10_1109_ACCESS_2021_3117070 crossref_primary_10_1016_j_eswa_2023_120589 crossref_primary_10_1080_23302674_2023_2224509 crossref_primary_10_1080_00207543_2023_2290699 crossref_primary_10_1016_j_cie_2024_110464 crossref_primary_10_1016_j_cie_2023_109139 crossref_primary_10_1016_j_cie_2024_109898 crossref_primary_10_1016_j_cor_2022_105932 crossref_primary_10_1016_j_engappai_2023_107721 crossref_primary_10_1016_j_cor_2022_105915 crossref_primary_10_1080_00207543_2023_2201352 crossref_primary_10_1016_j_apm_2021_07_013 crossref_primary_10_1016_j_cie_2025_111154 crossref_primary_10_1016_j_jmsy_2025_09_006 crossref_primary_10_1016_j_eswa_2022_117529 |
| Cites_doi | 10.1016/j.eswa.2013.06.067 10.1016/j.jclepro.2019.117826 10.1145/359496.359529 10.1080/09537287.2013.782949 10.1016/j.ejor.2017.08.033 10.1108/JMTM-11-2013-0168 10.1016/j.jclepro.2019.03.188 10.1016/j.jclepro.2017.10.308 10.3390/robotics8010020 10.1115/1.4041925 10.1016/S0377-2217(98)00173-8 10.1201/b13749-13 10.1016/j.cie.2019.03.017 10.1080/00207543.2018.1471238 10.1016/j.omega.2017.06.008 10.1287/inte.31.6.29.9647 10.1080/00207543.2018.1428775 10.1007/s10479-014-1641-3 10.1007/s00170-018-2183-7 10.1080/00207540701476281 10.1080/0305215X.2018.1564918 10.1007/978-3-662-62185-1_2 10.1016/j.ifacol.2015.06.060 10.1016/j.jclepro.2018.09.080 10.1016/j.eswa.2017.05.053 10.1016/j.cor.2010.04.018 10.1016/j.jenvman.2009.09.037 10.1016/j.jmsy.2020.07.015 10.1016/j.rcim.2019.101829 10.1007/s00170-005-0037-6 10.1016/j.ejor.2005.03.055 10.1016/j.cie.2019.106056 10.1109/TSM.2017.2768899 10.1007/s00170-013-4990-1 10.1016/j.cor.2014.05.006 10.1007/s10601-018-9281-x 10.3390/e19110596 10.1080/00207540210135622 10.1016/j.rcim.2019.04.014 10.1023/A:1013653332557 10.1108/17410381311318909 10.1007/BF02680554 10.1287/ijoc.14.4.295.2828 10.1016/j.jclepro.2018.11.114 10.1007/s10845-012-0711-0 10.1007/s00170-009-2303-5 10.1016/j.procir.2014.06.016 10.1016/j.jmsy.2014.11.015 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier Ltd Copyright Pergamon Press Inc. Feb 2021 |
| Copyright_xml | – notice: 2020 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Feb 2021 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2020.105111 |
| 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 | Engineering Computer Science Business |
| EISSN | 1873-765X 0305-0548 |
| EndPage | 20 |
| ExternalDocumentID | 10_1016_j_cor_2020_105111 S0305054820302288 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c357t-96e5f8edeaee9a2726da29cf4fb6347e1347972f12c42062376a59586421c723 |
| ISICitedReferencesCount | 32 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000589926400004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Sun Nov 09 08:05:09 EST 2025 Sat Nov 29 07:19:59 EST 2025 Tue Nov 18 20:40:39 EST 2025 Fri Feb 23 02:45:49 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Disassembly line balancing Sequencing Constraint programming Warm-start |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c357t-96e5f8edeaee9a2726da29cf4fb6347e1347972f12c42062376a59586421c723 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2489867896 |
| PQPubID | 45870 |
| PageCount | 20 |
| ParticipantIDs | proquest_journals_2489867896 crossref_citationtrail_10_1016_j_cor_2020_105111 crossref_primary_10_1016_j_cor_2020_105111 elsevier_sciencedirect_doi_10_1016_j_cor_2020_105111 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-02-01 |
| PublicationDateYYYYMMDD | 2021-02-01 |
| PublicationDate_xml | – month: 02 year: 2021 text: 2021-02-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2021 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | M. Pour, Drake, Ejlertsen, Rasmussen, Burke (b0175) 2018; 269 Topaloglu, Ozkarahan (b0220) 2011; 38 Scholl, Klein (b0210) 1999; 114 Kalayci, Hancilar, Gungor, Gupta (b0125) 2015; 37 Hooker (b0075) 2002; 14 Alshibli, M., ElSayed, A., Kongar, E., Sobh, T., Gupta, S.M., 2019. A robust robotic disassembly sequence design using orthogonal arrays and task allocation. Robotics 8. https://doi.org/10.3390/robotics8010020. Laborie, Rogerie, Shaw, Vilím (b0145) 2018; 23 Zhang, Zhao, Ke, Dong, Zhong (b0255) 2019; 1–15 Bukchin, Raviv (b0025) 2018; 78 Focacci, Lodi, Milano (b0045) 2002; 8 Van Hentenryck, Perron, Puget (b0070) 2000; 1 Bentaha, Dolgui, Battaïa (b0020) 2015; 48 Ding, Feng, Tan, Gao (b0035) 2010; 48 Özceylan, Kalayci, Güngör, Gupta (b0200) 2019; 57 Kalayci, Polat, Gupta (b0135) 2015; 26 Seidi, Saghari (b0215) 2016; 15 Güngör, Gupta (b0060) 2002; 40 Gondzio (b0055) 1998; 83 McGovern, Gupta (b0180) 2011 Ham (b0065) 2018; 31 Kalayci, Polat, Gupta (b0130) 2016; 242 Wang, Li, Gao (b0235) 2019; 130 Kalayci, Gupta (b0105) 2013; 24 Mcgovern, Gupta (b0190) 2007; 45 Bentaha, Battaïa, Dolgui (b0010) 2014; 51 McGovern, Gupta (b0185) 2007; 179 Kalayci, Gupta (b0115) 2013; 16 IBM ILOG CPLEX Optimization Studio 12.9, 2019. IBM. Ren, Zhang, Zhao, Tian, Lin, Meng, Li (b0205) 2018; 174 Liu, Zhou, Pham, Xu, Ji, Liu (b0160) 2020; 61 Kalayci, Gupta (b0110) 2013; 40 Zhang, Wang, Zhu, Wang (b0260) 2017; 86 McGovern, Gupta (b0195) 2006; 30 Wang, Li, Gao, Garg (b0240) 2019; 59 Edis, E.B., Ilgin, M.A., Edis, R.S., 2019. Disassembly line balancing with sequencing decisions: A mixed integer linear programming model and extensions. J. Clean. Prod. 238. https://doi.org/10.1016/j.jclepro.2019.117826. Kalayci, Gupta (b0095) 2014; 25 Kalayci, C.B., Gupta, S.M., 2013e. River formation dynamics approach for sequence-dependent disassembly line balancing problem, in: Reverse Supply Chains. pp. 289–312. https://doi.org/10.1201/b13749-13 Liu, Zhou, Pham, Xu, Yan, Liu, Ji, Liu (b0165) 2018; 97 Kalayci, Gupta (b0100) 2013; 69 Lustig, Puget (b0170) 2001; 31 Laili, Li, Fang, Pham, Zhang (b0150) 2020; 56 Ilgin, M.A., Gupta, S.M., 2010. Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art. J. Environ. Manage. https://doi.org/10.1016/j.jenvman.2009.09.037. Wang, Li, Gao (b0230) 2019; 211 Bentaha, Battaïa, Dolgui (b0015) 2014; 15 Ilgin, M.A., 2019. A DEMATEL-based disassembly line balancing heuristic. J. Manuf. Sci. Eng. Trans. ASME 141. https://doi.org/10.1115/1.4041925. Tuncel, Zeid, Kamarthi (b0225) 2014; 25 Zhu, Zhang, Wang (b0265) 2018; 56 Wang, Guo, Liu (b0245) 2019; 51 Li, Kucukkoc, Zhang (b0155) 2019; 137 Deniz, Ozcelik (b0030) 2019 Gao, Feng, Wang, Zheng, Tan (b0050) 2018; 204 Xiao, S., Wang, Y., Yu, H., Nie, S., 2017. An entropy-based adaptive hybrid particle swarm optimization for disassembly line balancing problems. Entropy 19. https://doi.org/10.3390/e19110596. Kanet, Ahire, Gorman (b0140) 2004 Focacci (10.1016/j.cor.2020.105111_b0045) 2002; 8 Deniz (10.1016/j.cor.2020.105111_b0030) 2019 Ham (10.1016/j.cor.2020.105111_b0065) 2018; 31 Liu (10.1016/j.cor.2020.105111_b0165) 2018; 97 McGovern (10.1016/j.cor.2020.105111_b0180) 2011 Mcgovern (10.1016/j.cor.2020.105111_b0190) 2007; 45 Bukchin (10.1016/j.cor.2020.105111_b0025) 2018; 78 Lustig (10.1016/j.cor.2020.105111_b0170) 2001; 31 Kalayci (10.1016/j.cor.2020.105111_b0125) 2015; 37 Laborie (10.1016/j.cor.2020.105111_b0145) 2018; 23 Wang (10.1016/j.cor.2020.105111_b0230) 2019; 211 Laili (10.1016/j.cor.2020.105111_b0150) 2020; 56 Wang (10.1016/j.cor.2020.105111_b0235) 2019; 130 Seidi (10.1016/j.cor.2020.105111_b0215) 2016; 15 10.1016/j.cor.2020.105111_b0080 M. Pour (10.1016/j.cor.2020.105111_b0175) 2018; 269 Scholl (10.1016/j.cor.2020.105111_b0210) 1999; 114 Kalayci (10.1016/j.cor.2020.105111_b0135) 2015; 26 10.1016/j.cor.2020.105111_b0040 10.1016/j.cor.2020.105111_b0085 Zhang (10.1016/j.cor.2020.105111_b0260) 2017; 86 Bentaha (10.1016/j.cor.2020.105111_b0020) 2015; 48 Kalayci (10.1016/j.cor.2020.105111_b0100) 2013; 69 10.1016/j.cor.2020.105111_b0120 10.1016/j.cor.2020.105111_b0005 Li (10.1016/j.cor.2020.105111_b0155) 2019; 137 Bentaha (10.1016/j.cor.2020.105111_b0010) 2014; 51 Liu (10.1016/j.cor.2020.105111_b0160) 2020; 61 Kalayci (10.1016/j.cor.2020.105111_b0130) 2016; 242 Zhang (10.1016/j.cor.2020.105111_b0255) 2019; 1–15 10.1016/j.cor.2020.105111_b0090 Kalayci (10.1016/j.cor.2020.105111_b0095) 2014; 25 Zhu (10.1016/j.cor.2020.105111_b0265) 2018; 56 McGovern (10.1016/j.cor.2020.105111_b0195) 2006; 30 10.1016/j.cor.2020.105111_b0250 Kalayci (10.1016/j.cor.2020.105111_b0115) 2013; 16 Wang (10.1016/j.cor.2020.105111_b0240) 2019; 59 Ren (10.1016/j.cor.2020.105111_b0205) 2018; 174 Kanet (10.1016/j.cor.2020.105111_b0140) 2004 Ding (10.1016/j.cor.2020.105111_b0035) 2010; 48 Gondzio (10.1016/j.cor.2020.105111_b0055) 1998; 83 McGovern (10.1016/j.cor.2020.105111_b0185) 2007; 179 Güngör (10.1016/j.cor.2020.105111_b0060) 2002; 40 Gao (10.1016/j.cor.2020.105111_b0050) 2018; 204 Hooker (10.1016/j.cor.2020.105111_b0075) 2002; 14 Van Hentenryck (10.1016/j.cor.2020.105111_b0070) 2000; 1 Kalayci (10.1016/j.cor.2020.105111_b0105) 2013; 24 Tuncel (10.1016/j.cor.2020.105111_b0225) 2014; 25 Bentaha (10.1016/j.cor.2020.105111_b0015) 2014; 15 Kalayci (10.1016/j.cor.2020.105111_b0110) 2013; 40 Özceylan (10.1016/j.cor.2020.105111_b0200) 2019; 57 Wang (10.1016/j.cor.2020.105111_b0245) 2019; 51 Topaloglu (10.1016/j.cor.2020.105111_b0220) 2011; 38 |
| References_xml | – volume: 114 start-page: 50 year: 1999 end-page: 58 ident: b0210 article-title: Balancing assembly lines effectively – A computational comparison publication-title: Eur. J. Oper. Res. – year: 2011 ident: b0180 article-title: The Disassembly Line: Balancing and Modeling – volume: 31 start-page: 52 year: 2018 end-page: 61 ident: b0065 article-title: Scheduling of dual resource constrained lithography production: Using CP and MIP/CP publication-title: IEEE Trans. Semicond. Manufact. – start-page: 1 year: 2004 end-page: 22 ident: b0140 article-title: Constraint programming for scheduling publication-title: Handbook of Scheduling: Algorithms, Models, and Performance Analysis – volume: 1–15 year: 2019 ident: b0255 article-title: Disassembly line balancing optimization method for high efficiency and low carbon emission publication-title: Int. J. Precis. Eng. Manuf. - Green Technol. – volume: 57 start-page: 4805 year: 2019 end-page: 4827 ident: b0200 article-title: Disassembly line balancing problem: A review of the state of the art and future directions publication-title: Int. J. Prod. Res. – volume: 179 start-page: 692 year: 2007 end-page: 708 ident: b0185 article-title: A balancing method and genetic algorithm for disassembly line balancing publication-title: Eur. J. Oper. Res. – volume: 25 start-page: 647 year: 2014 end-page: 659 ident: b0225 article-title: Solving large scale disassembly line balancing problem with uncertainty using reinforcement learning publication-title: J. Intell. Manuf. – reference: Ilgin, M.A., Gupta, S.M., 2010. Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art. J. Environ. Manage. https://doi.org/10.1016/j.jenvman.2009.09.037. – volume: 174 start-page: 1475 year: 2018 end-page: 1486 ident: b0205 article-title: Disassembly line balancing problem using interdependent weights-based multi-criteria decision making and 2-Optimal algorithm publication-title: J. Cleaner Prod. – volume: 59 start-page: 235 year: 2019 end-page: 251 ident: b0240 article-title: Partial disassembly line balancing for energy consumption and profit under uncertainty publication-title: Rob. Comput. Integr. Manuf. – volume: 56 start-page: 7354 year: 2018 end-page: 7374 ident: b0265 article-title: A Pareto firefly algorithm for multi-objective disassembly line balancing problems with hazard evaluation publication-title: Int. J. Prod. Res. – volume: 51 start-page: 1920 year: 2019 end-page: 1937 ident: b0245 article-title: An efficient hybrid artificial bee colony algorithm for disassembly line balancing problem with sequence-dependent part removal times publication-title: Eng. Optim. – volume: 25 start-page: 149 year: 2014 end-page: 160 ident: b0095 article-title: A tabu search algorithm for balancing a sequence-dependent disassembly line publication-title: Prod. Plan. Contr. – volume: 48 start-page: 70 year: 2015 end-page: 75 ident: b0020 article-title: A bibliographic review of production line design and balancing under uncertainty publication-title: IFAC-PapersOnLine – volume: 204 start-page: 712 year: 2018 end-page: 725 ident: b0050 article-title: A multi-objective decision making approach for dealing with uncertainty in EOL product recovery publication-title: J. Cleaner Prod. – volume: 130 start-page: 634 year: 2019 end-page: 649 ident: b0235 article-title: A multi-objective discrete flower pollination algorithm for stochastic two-sided partial disassembly line balancing problem publication-title: Comput. Ind. Eng. – volume: 137 start-page: 106056 year: 2019 ident: b0155 article-title: Iterated local search method and mathematical model for sequence-dependent U-shaped disassembly line balancing problem publication-title: Comput. Ind. Eng. – volume: 97 start-page: 3937 year: 2018 end-page: 3962 ident: b0165 article-title: An improved multi-objective discrete bees algorithm for robotic disassembly line balancing problem in remanufacturing publication-title: Int. J. Adv. Manuf. Technol. – year: 2019 ident: b0030 article-title: An extended review on disassembly line balancing with bibliometric & social network and future study realization analysis publication-title: J. Clean. Prod. – volume: 48 start-page: 761 year: 2010 end-page: 771 ident: b0035 article-title: A new multi-objective ant colony algorithm for solving the disassembly line balancing problem publication-title: Int. J. Adv. Manuf. Technol. – volume: 242 start-page: 321 year: 2016 end-page: 354 ident: b0130 article-title: A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem publication-title: Ann. Oper. Res. – volume: 15 start-page: 364 year: 2016 end-page: 373 ident: b0215 article-title: The balancing of disassembly line of automobile engine using genetic algorithm (GA) in fuzzy environment publication-title: Ind. Eng. Manag. Syst. – volume: 45 start-page: 4485 year: 2007 end-page: 4511 ident: b0190 article-title: Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem publication-title: Int. J. Prod. Res. – reference: Kalayci, C.B., Gupta, S.M., 2013e. River formation dynamics approach for sequence-dependent disassembly line balancing problem, in: Reverse Supply Chains. pp. 289–312. https://doi.org/10.1201/b13749-13 – volume: 1 start-page: 285 year: 2000 end-page: 320 ident: b0070 article-title: Search and strategies in OPL publication-title: ACM Trans. Comput. Logic – volume: 61 start-page: 101829 year: 2020 ident: b0160 article-title: Collaborative optimization of robotic disassembly sequence planning and robotic disassembly line balancing problem using improved discrete Bees algorithm in remanufacturing✰ publication-title: Rob. Comput. Integr. Manuf. – volume: 40 start-page: 7231 year: 2013 end-page: 7241 ident: b0110 article-title: Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem publication-title: Expert Syst. Appl. – volume: 16 start-page: 81 year: 2013 end-page: 103 ident: b0115 article-title: Balancing a sequence dependent disassembly line using simulated annealing algorithm publication-title: Appl. Manag. Sci. – volume: 40 start-page: 2569 year: 2002 end-page: 2589 ident: b0060 article-title: Disassembly line in product recovery publication-title: Int. J. Prod. Res. – volume: 37 start-page: 672 year: 2015 end-page: 682 ident: b0125 article-title: Multi-objective fuzzy disassembly line balancing using a hybrid discrete artificial bee colony algorithm publication-title: J. Manuf. Syst. – reference: Alshibli, M., ElSayed, A., Kongar, E., Sobh, T., Gupta, S.M., 2019. A robust robotic disassembly sequence design using orthogonal arrays and task allocation. Robotics 8. https://doi.org/10.3390/robotics8010020. – volume: 24 start-page: 413 year: 2013 end-page: 427 ident: b0105 article-title: Ant colony optimization for sequence‐dependent disassembly line balancing problem publication-title: J. Manuf. Technol. Manage. – volume: 69 start-page: 197 year: 2013 end-page: 209 ident: b0100 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. – volume: 51 start-page: 111 year: 2014 end-page: 122 ident: b0010 article-title: A sample average approximation method for disassembly line balancing problem under uncertainty publication-title: Comput. Oper. Res. – volume: 78 start-page: 57 year: 2018 end-page: 68 ident: b0025 article-title: Constraint programming for solving various assembly line balancing problems publication-title: Omega – volume: 269 start-page: 341 year: 2018 end-page: 352 ident: b0175 article-title: A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem publication-title: Eur. J. Oper. Res. – volume: 38 start-page: 246 year: 2011 end-page: 255 ident: b0220 article-title: A constraint programming-based solution approach for medical resident scheduling problems publication-title: Comput. Oper. Res. – volume: 31 start-page: 29 year: 2001 end-page: 53 ident: b0170 article-title: Program does not equal program: constraint programming and its relationship to mathematical programming publication-title: Interfaces – reference: Xiao, S., Wang, Y., Yu, H., Nie, S., 2017. An entropy-based adaptive hybrid particle swarm optimization for disassembly line balancing problems. Entropy 19. https://doi.org/10.3390/e19110596. – reference: Edis, E.B., Ilgin, M.A., Edis, R.S., 2019. Disassembly line balancing with sequencing decisions: A mixed integer linear programming model and extensions. J. Clean. Prod. 238. https://doi.org/10.1016/j.jclepro.2019.117826. – volume: 23 start-page: 210 year: 2018 end-page: 250 ident: b0145 article-title: IBM ILOG CP optimizer for scheduling: 20+ years of scheduling with constraints at IBM/ILOG publication-title: Constraints – reference: Ilgin, M.A., 2019. A DEMATEL-based disassembly line balancing heuristic. J. Manuf. Sci. Eng. Trans. ASME 141. https://doi.org/10.1115/1.4041925. – volume: 14 start-page: 295 year: 2002 end-page: 321 ident: b0075 article-title: Logic, optimization, and constraint programming publication-title: Inf. J. Comput. – volume: 15 start-page: 239 year: 2014 end-page: 244 ident: b0015 article-title: Disassembly line balancing and sequencing under uncertainty publication-title: Procedia CIRP – volume: 211 start-page: 115 year: 2019 end-page: 133 ident: b0230 article-title: Modeling and optimization of multi-objective partial disassembly line balancing problem considering hazard and profit publication-title: J. Cleaner Prod. – volume: 30 start-page: 481 year: 2006 end-page: 496 ident: b0195 article-title: Ant colony optimization for disassembly sequencing with multiple objectives publication-title: Int. J. Adv. Manuf. Technol. – volume: 8 start-page: 7 year: 2002 end-page: 17 ident: b0045 article-title: Mathematical programming techniques in constraint programming: A short overview publication-title: J. Heuristics – volume: 83 start-page: 125 year: 1998 end-page: 143 ident: b0055 article-title: Warm start of the primal-dual method applied in the cutting-plane scheme publication-title: Math. Program. – volume: 26 start-page: 182 year: 2015 end-page: 194 ident: b0135 article-title: A variable neighbourhood search algorithm for disassembly lines publication-title: J. Manuf. Technol. Manag. – volume: 86 start-page: 165 year: 2017 end-page: 176 ident: b0260 article-title: A Pareto improved artificial fish swarm algorithm for solving a multi-objective fuzzy disassembly line balancing problem publication-title: Expert Syst. Appl. – reference: IBM ILOG CPLEX Optimization Studio 12.9, 2019. IBM. – volume: 56 start-page: 484 year: 2020 end-page: 500 ident: b0150 article-title: Model review and algorithm comparison on multi-objective disassembly line balancing publication-title: J. Manuf. Syst. – volume: 40 start-page: 7231 issue: 18 year: 2013 ident: 10.1016/j.cor.2020.105111_b0110 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 – ident: 10.1016/j.cor.2020.105111_b0040 doi: 10.1016/j.jclepro.2019.117826 – volume: 1 start-page: 285 issue: 2 year: 2000 ident: 10.1016/j.cor.2020.105111_b0070 article-title: Search and strategies in OPL publication-title: ACM Trans. Comput. Logic doi: 10.1145/359496.359529 – volume: 25 start-page: 149 issue: 2 year: 2014 ident: 10.1016/j.cor.2020.105111_b0095 article-title: A tabu search algorithm for balancing a sequence-dependent disassembly line publication-title: Prod. Plan. Contr. doi: 10.1080/09537287.2013.782949 – volume: 269 start-page: 341 issue: 1 year: 2018 ident: 10.1016/j.cor.2020.105111_b0175 article-title: A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.08.033 – volume: 26 start-page: 182 issue: 2 year: 2015 ident: 10.1016/j.cor.2020.105111_b0135 article-title: A variable neighbourhood search algorithm for disassembly lines publication-title: J. Manuf. Technol. Manag. doi: 10.1108/JMTM-11-2013-0168 – volume: 15 start-page: 364 issue: 4 year: 2016 ident: 10.1016/j.cor.2020.105111_b0215 article-title: The balancing of disassembly line of automobile engine using genetic algorithm (GA) in fuzzy environment publication-title: Ind. Eng. Manag. Syst. – year: 2019 ident: 10.1016/j.cor.2020.105111_b0030 article-title: An extended review on disassembly line balancing with bibliometric & social network and future study realization analysis publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2019.03.188 – volume: 174 start-page: 1475 year: 2018 ident: 10.1016/j.cor.2020.105111_b0205 article-title: Disassembly line balancing problem using interdependent weights-based multi-criteria decision making and 2-Optimal algorithm publication-title: J. Cleaner Prod. doi: 10.1016/j.jclepro.2017.10.308 – volume: 1–15 year: 2019 ident: 10.1016/j.cor.2020.105111_b0255 article-title: Disassembly line balancing optimization method for high efficiency and low carbon emission publication-title: Int. J. Precis. Eng. Manuf. - Green Technol. – volume: 16 start-page: 81 year: 2013 ident: 10.1016/j.cor.2020.105111_b0115 article-title: Balancing a sequence dependent disassembly line using simulated annealing algorithm publication-title: Appl. Manag. Sci. – ident: 10.1016/j.cor.2020.105111_b0005 doi: 10.3390/robotics8010020 – ident: 10.1016/j.cor.2020.105111_b0085 doi: 10.1115/1.4041925 – volume: 114 start-page: 50 issue: 1 year: 1999 ident: 10.1016/j.cor.2020.105111_b0210 article-title: Balancing assembly lines effectively – A computational comparison publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(98)00173-8 – ident: 10.1016/j.cor.2020.105111_b0120 doi: 10.1201/b13749-13 – volume: 130 start-page: 634 year: 2019 ident: 10.1016/j.cor.2020.105111_b0235 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: 56 start-page: 7354 issue: 24 year: 2018 ident: 10.1016/j.cor.2020.105111_b0265 article-title: A Pareto firefly algorithm for multi-objective disassembly line balancing problems with hazard evaluation publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2018.1471238 – volume: 78 start-page: 57 year: 2018 ident: 10.1016/j.cor.2020.105111_b0025 article-title: Constraint programming for solving various assembly line balancing problems publication-title: Omega doi: 10.1016/j.omega.2017.06.008 – start-page: 1 year: 2004 ident: 10.1016/j.cor.2020.105111_b0140 article-title: Constraint programming for scheduling – volume: 31 start-page: 29 issue: 6 year: 2001 ident: 10.1016/j.cor.2020.105111_b0170 article-title: Program does not equal program: constraint programming and its relationship to mathematical programming publication-title: Interfaces doi: 10.1287/inte.31.6.29.9647 – volume: 57 start-page: 4805 issue: 15-16 year: 2019 ident: 10.1016/j.cor.2020.105111_b0200 article-title: Disassembly line balancing problem: A review of the state of the art and future directions publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2018.1428775 – volume: 242 start-page: 321 issue: 2 year: 2016 ident: 10.1016/j.cor.2020.105111_b0130 article-title: A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem publication-title: Ann. Oper. Res. doi: 10.1007/s10479-014-1641-3 – volume: 97 start-page: 3937 issue: 9-12 year: 2018 ident: 10.1016/j.cor.2020.105111_b0165 article-title: An improved multi-objective discrete bees algorithm for robotic disassembly line balancing problem in remanufacturing publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-018-2183-7 – volume: 45 start-page: 4485 issue: 18-19 year: 2007 ident: 10.1016/j.cor.2020.105111_b0190 article-title: Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem publication-title: Int. J. Prod. Res. doi: 10.1080/00207540701476281 – volume: 51 start-page: 1920 issue: 11 year: 2019 ident: 10.1016/j.cor.2020.105111_b0245 article-title: An efficient hybrid artificial bee colony algorithm for disassembly line balancing problem with sequence-dependent part removal times publication-title: Eng. Optim. doi: 10.1080/0305215X.2018.1564918 – ident: 10.1016/j.cor.2020.105111_b0080 doi: 10.1007/978-3-662-62185-1_2 – volume: 48 start-page: 70 issue: 3 year: 2015 ident: 10.1016/j.cor.2020.105111_b0020 article-title: A bibliographic review of production line design and balancing under uncertainty publication-title: IFAC-PapersOnLine doi: 10.1016/j.ifacol.2015.06.060 – volume: 204 start-page: 712 year: 2018 ident: 10.1016/j.cor.2020.105111_b0050 article-title: A multi-objective decision making approach for dealing with uncertainty in EOL product recovery publication-title: J. Cleaner Prod. doi: 10.1016/j.jclepro.2018.09.080 – volume: 86 start-page: 165 year: 2017 ident: 10.1016/j.cor.2020.105111_b0260 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: 38 start-page: 246 issue: 1 year: 2011 ident: 10.1016/j.cor.2020.105111_b0220 article-title: A constraint programming-based solution approach for medical resident scheduling problems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2010.04.018 – ident: 10.1016/j.cor.2020.105111_b0090 doi: 10.1016/j.jenvman.2009.09.037 – volume: 56 start-page: 484 year: 2020 ident: 10.1016/j.cor.2020.105111_b0150 article-title: Model review and algorithm comparison on multi-objective disassembly line balancing publication-title: J. Manuf. Syst. doi: 10.1016/j.jmsy.2020.07.015 – year: 2011 ident: 10.1016/j.cor.2020.105111_b0180 – volume: 61 start-page: 101829 year: 2020 ident: 10.1016/j.cor.2020.105111_b0160 article-title: Collaborative optimization of robotic disassembly sequence planning and robotic disassembly line balancing problem using improved discrete Bees algorithm in remanufacturing✰ publication-title: Rob. Comput. Integr. Manuf. doi: 10.1016/j.rcim.2019.101829 – volume: 30 start-page: 481 issue: 5-6 year: 2006 ident: 10.1016/j.cor.2020.105111_b0195 article-title: Ant colony optimization for disassembly sequencing with multiple objectives publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-005-0037-6 – volume: 179 start-page: 692 issue: 3 year: 2007 ident: 10.1016/j.cor.2020.105111_b0185 article-title: A balancing method and genetic algorithm for disassembly line balancing publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.03.055 – volume: 137 start-page: 106056 year: 2019 ident: 10.1016/j.cor.2020.105111_b0155 article-title: Iterated local search method and mathematical model for sequence-dependent U-shaped disassembly line balancing problem publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2019.106056 – volume: 31 start-page: 52 issue: 1 year: 2018 ident: 10.1016/j.cor.2020.105111_b0065 article-title: Scheduling of dual resource constrained lithography production: Using CP and MIP/CP publication-title: IEEE Trans. Semicond. Manufact. doi: 10.1109/TSM.2017.2768899 – volume: 69 start-page: 197 issue: 1-4 year: 2013 ident: 10.1016/j.cor.2020.105111_b0100 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: 51 start-page: 111 year: 2014 ident: 10.1016/j.cor.2020.105111_b0010 article-title: A sample average approximation method for disassembly line balancing problem under uncertainty publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.05.006 – volume: 23 start-page: 210 issue: 2 year: 2018 ident: 10.1016/j.cor.2020.105111_b0145 article-title: IBM ILOG CP optimizer for scheduling: 20+ years of scheduling with constraints at IBM/ILOG publication-title: Constraints doi: 10.1007/s10601-018-9281-x – ident: 10.1016/j.cor.2020.105111_b0250 doi: 10.3390/e19110596 – volume: 40 start-page: 2569 issue: 11 year: 2002 ident: 10.1016/j.cor.2020.105111_b0060 article-title: Disassembly line in product recovery publication-title: Int. J. Prod. Res. doi: 10.1080/00207540210135622 – volume: 59 start-page: 235 year: 2019 ident: 10.1016/j.cor.2020.105111_b0240 article-title: Partial disassembly line balancing for energy consumption and profit under uncertainty publication-title: Rob. Comput. Integr. Manuf. doi: 10.1016/j.rcim.2019.04.014 – volume: 8 start-page: 7 year: 2002 ident: 10.1016/j.cor.2020.105111_b0045 article-title: Mathematical programming techniques in constraint programming: A short overview publication-title: J. Heuristics doi: 10.1023/A:1013653332557 – volume: 24 start-page: 413 issue: 3 year: 2013 ident: 10.1016/j.cor.2020.105111_b0105 article-title: Ant colony optimization for sequence‐dependent disassembly line balancing problem publication-title: J. Manuf. Technol. Manage. doi: 10.1108/17410381311318909 – volume: 83 start-page: 125 issue: 1-3 year: 1998 ident: 10.1016/j.cor.2020.105111_b0055 article-title: Warm start of the primal-dual method applied in the cutting-plane scheme publication-title: Math. Program. doi: 10.1007/BF02680554 – volume: 14 start-page: 295 issue: 4 year: 2002 ident: 10.1016/j.cor.2020.105111_b0075 article-title: Logic, optimization, and constraint programming publication-title: Inf. J. Comput. doi: 10.1287/ijoc.14.4.295.2828 – volume: 211 start-page: 115 year: 2019 ident: 10.1016/j.cor.2020.105111_b0230 article-title: Modeling and optimization of multi-objective partial disassembly line balancing problem considering hazard and profit publication-title: J. Cleaner Prod. doi: 10.1016/j.jclepro.2018.11.114 – volume: 25 start-page: 647 issue: 4 year: 2014 ident: 10.1016/j.cor.2020.105111_b0225 article-title: Solving large scale disassembly line balancing problem with uncertainty using reinforcement learning publication-title: J. Intell. Manuf. doi: 10.1007/s10845-012-0711-0 – volume: 48 start-page: 761 issue: 5-8 year: 2010 ident: 10.1016/j.cor.2020.105111_b0035 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: 15 start-page: 239 year: 2014 ident: 10.1016/j.cor.2020.105111_b0015 article-title: Disassembly line balancing and sequencing under uncertainty publication-title: Procedia CIRP doi: 10.1016/j.procir.2014.06.016 – volume: 37 start-page: 672 year: 2015 ident: 10.1016/j.cor.2020.105111_b0125 article-title: Multi-objective fuzzy disassembly line balancing using a hybrid discrete artificial bee colony algorithm publication-title: J. Manuf. Syst. doi: 10.1016/j.jmsy.2014.11.015 |
| SSID | ssj0000721 |
| Score | 2.4734018 |
| Snippet | •A disassembly line balancing problem with sequencing decisions is considered.•The constraint programming model is able solve the problems with up to 35... Recovery of products has received much attention in the last decade due to the increase in both environmental awareness and regulations enacted by governments.... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 105111 |
| SubjectTerms | Algorithms Balancing Benchmarks Combinatorial analysis Constraint programming Constraints Disassembly line balancing Dismantling Heuristic methods Integer programming Linear programming Mixed integer Operations research Recovery Sequencing Warm-start Workstations |
| Title | Constraint programming approaches to disassembly line balancing problem with sequencing decisions |
| URI | https://dx.doi.org/10.1016/j.cor.2020.105111 https://www.proquest.com/docview/2489867896 |
| Volume | 126 |
| WOSCitedRecordID | wos000589926400004&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: ScienceDirect customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9QwELWgRQgOfCxFFArygRNVqsSJY_tY0CJAqEJiD3uzEtuRWnWzq01alX_P-CtJi6gAiUsUWYm98XsZT7wzbxB6yxkxRUmrRORcJ0WlWSJMphOnBZNp-MionWT-V3ZywpdL8S0UuuxcOQHWtvzqSmz-K9TQBmDb1Nm_gHvoFBrgHECHI8AOxz8C3pbgdIUf-hh8tXKJiEE83Es66NMOvGazqs9_HDpHs7YhjsqnprsSMyF43Uda23YdqvF0U382FoXoHIXWG7MNoXVBRGjYbJ5rL2YwX4F1O3x_NN1tIFkMUI5bYDENZow5cqlXNgKQesnMI-MtKWd5wkq6vGZqfXb8L2bb7yCcwaxbiVbiqg9HI3xdDfu7HcsOReCEEM7vol3CqACDtnv8eb78Mi7DzCXdDb8t_qXtgvtuDPQ7p-TG8ux8jsUT9Ch8LOBjD_JTdMe0M3Q_5irM0OM4_TiY6Bl6OBGYfIaqkQx4QgY8kgH3azwhA7ZkwAMZcCADtmTAIxnwQIY9tPg4X3z4lISiGonKKesTURracKNNZYyoCCOlrohQTdHUZV4w41KLGWkyogqSljZoqqKCcpsQrRjJn6Oddt2aFwhTw7VJFc9UKoqiSXkF_fFaUQLLRk3MPkrjpEoVBOftE5_LGFl4JgEHaXGQHod99G64ZePVVm67uIhIyeAuejdQAq1uu-0goirDa9tJUnDBwW8T5ct_6_UVejC-Lgdop99emNfonrrsT7vtm8DNnx2dmU8 |
| 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=Constraint+programming+approaches+to+disassembly+line+balancing+problem+with+sequencing+decisions&rft.jtitle=Computers+%26+operations+research&rft.au=Edis%2C+Emrah+B.&rft.date=2021-02-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=126&rft_id=info:doi/10.1016%2Fj.cor.2020.105111&rft.externalDocID=S0305054820302288 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |