Constraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup times
This paper studies the multi-resource-constrained unrelated parallel machine scheduling problem under various operational constraints with the objective of minimising maximum completion time among the scheduled jobs. Sequence-dependent setup times, precedence relations, machine eligibility restricti...
Saved in:
| Published in: | International journal of production research Vol. 60; no. 7; pp. 2212 - 2229 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
London
Taylor & Francis
03.04.2022
Taylor & Francis LLC |
| Subjects: | |
| ISSN: | 0020-7543, 1366-588X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This paper studies the multi-resource-constrained unrelated parallel machine scheduling problem under various operational constraints with the objective of minimising maximum completion time among the scheduled jobs. Sequence-dependent setup times, precedence relations, machine eligibility restrictions and release dates are incorporated into the problem as operational constraints to reflect real-world manufacturing environments. The considered problem is in NP-hard class of problems, which cannot be solved in deterministic polynomial time. Our aim in this study is to develop an exact solution approach based on constraint programming (CP), which shows good performance in solving scheduling problems. In this regard, we propose a CP model and enrich this model by adding lower bound restrictions and redundant constraints. Moreover, to achieve a reduction in computation time, we propose two branching strategies for the proposed CP model. The performance of the CP model is tested using randomly generated and benchmark instances from the literature. The computational results indicate that the proposed CP model outperforms the best solutions with an average gap of 15.52%. |
|---|---|
| AbstractList | This paper studies the multi-resource-constrained unrelated parallel machine scheduling problem under various operational constraints with the objective of minimising maximum completion time among the scheduled jobs. Sequence-dependent setup times, precedence relations, machine eligibility restrictions and release dates are incorporated into the problem as operational constraints to reflect real-world manufacturing environments. The considered problem is in NP-hard class of problems, which cannot be solved in deterministic polynomial time. Our aim in this study is to develop an exact solution approach based on constraint programming (CP), which shows good performance in solving scheduling problems. In this regard, we propose a CP model and enrich this model by adding lower bound restrictions and redundant constraints. Moreover, to achieve a reduction in computation time, we propose two branching strategies for the proposed CP model. The performance of the CP model is tested using randomly generated and benchmark instances from the literature. The computational results indicate that the proposed CP model outperforms the best solutions with an average gap of 15.52%. |
| Author | Yunusoglu, Pinar Topaloglu Yildiz, Seyda |
| Author_xml | – sequence: 1 givenname: Pinar orcidid: 0000-0001-8026-4935 surname: Yunusoglu fullname: Yunusoglu, Pinar organization: The Graduate School of Natural and Applied Sciences, Dokuz Eylul University – sequence: 2 givenname: Seyda orcidid: 0000-0001-6827-126X surname: Topaloglu Yildiz fullname: Topaloglu Yildiz, Seyda email: seyda.topaloglu@deu.edu.tr organization: Department of Industrial Engineering, Dokuz Eylul University |
| BookMark | eNqFkcFu3CAQhlGVSN0kfYRKSDl7M9hrzKqXVqsmqRSpl1bqDWEY7xJhcAArylvkkYu12UsPDRdA_N8_M_wX5MwHj4R8ZrBmIOAGoIau3TTrGmq2ZkK0wMUHsmIN51UrxJ8zslo01SL6SC5SeoSyWrFZkddd8ClHZX2mUwz7qMbR-j1VU7kpfaBDiHScXbZVxBTmqLHSJwQNnX1Ep3I5TSoq59DRsWDljSZ9QDO7xa149Q5H-mzzgSZ8mtEXH4MTeoOlcsI8TzTbEdMVOR-US_jpbb8kv2-__9rdVw8_737svj1UuuFNrlTHgdWCbxhyjVs0GsHwbY8DazuFmgmodQ9YRt72A5iGGQabGrZdkQ9t31yS66Nv6a30k7J8LNP5UlLWXQeC8VbwovpyVOkYUoo4SG2zyjb45QOcZCCXCOQpArlEIN8iKHT7Dz1FO6r48i739chZX75_VM8hOiOzenEhDlF5bZNs_m_xF-trpB8 |
| CitedBy_id | crossref_primary_10_1080_00207543_2022_2121869 crossref_primary_10_1109_TSM_2023_3304517 crossref_primary_10_1016_j_cie_2024_109900 crossref_primary_10_1080_00207543_2024_2323065 crossref_primary_10_3390_systems12090354 crossref_primary_10_1080_00207543_2025_2511233 crossref_primary_10_1080_00207543_2022_2148768 crossref_primary_10_3390_pr10122676 crossref_primary_10_1080_00207543_2023_2173503 crossref_primary_10_3390_a17080348 crossref_primary_10_3390_pr11071870 crossref_primary_10_1016_j_ejor_2025_03_019 crossref_primary_10_1016_j_engappai_2024_108572 crossref_primary_10_1088_1742_6596_2853_1_012058 crossref_primary_10_1007_s00500_023_09086_9 crossref_primary_10_1016_j_cor_2024_106855 crossref_primary_10_1080_00207543_2025_2551245 crossref_primary_10_1080_00207543_2022_2154404 crossref_primary_10_1007_s43069_023_00233_4 crossref_primary_10_1080_00207543_2023_2290699 crossref_primary_10_1080_00207543_2022_2102948 crossref_primary_10_1016_j_rcim_2023_102707 crossref_primary_10_1080_00207543_2023_2275634 crossref_primary_10_1080_00207543_2025_2508917 crossref_primary_10_1080_23302674_2023_2221072 crossref_primary_10_23919_JSEE_2022_000098 crossref_primary_10_1016_j_cie_2023_109675 crossref_primary_10_3390_systems12020037 crossref_primary_10_1016_j_cie_2024_110843 crossref_primary_10_1016_j_dajour_2025_100596 crossref_primary_10_1016_j_eswa_2025_128337 crossref_primary_10_1080_01605682_2024_2382867 crossref_primary_10_1016_j_cie_2024_110086 crossref_primary_10_1080_00207543_2023_2226772 crossref_primary_10_1080_0305215X_2025_2547946 crossref_primary_10_3390_sym16020203 crossref_primary_10_1109_TSM_2023_3237917 crossref_primary_10_1016_j_cor_2023_106386 crossref_primary_10_1016_j_cor_2023_106442 crossref_primary_10_1016_j_ejor_2024_03_004 crossref_primary_10_1080_00207543_2023_2245918 crossref_primary_10_3390_computation11070137 crossref_primary_10_1016_j_cie_2024_110828 crossref_primary_10_32604_cmc_2024_054473 crossref_primary_10_33889_IJMEMS_2021_6_6_088 crossref_primary_10_1111_itor_70085 |
| Cites_doi | 10.1016/j.ejor.2013.02.042 10.5772/54381 10.1016/j.ifacol.2017.08.1998 10.1016/j.ejor.2018.05.056 10.1016/j.cie.2014.09.006 10.1016/j.cor.2009.02.012 10.1016/j.cor.2019.03.004 10.1007/s00170-003-1622-1 10.1016/S0377-2217(02)00726-9 10.1016/j.cie.2018.05.014 10.1016/j.jmsy.2015.07.002 10.1007/s00170-006-0810-1 10.1016/j.ejor.2018.01.037 10.1080/21681015.2016.1139005 10.1016/j.cor.2019.07.016 10.1016/j.cie.2016.05.020 10.1016/j.cor.2010.08.018 10.1016/j.ejor.2015.11.020 10.1016/S0167-6377(01)00104-3 10.1080/00207543.2019.1600763 10.1016/j.cor.2010.04.018 10.1007/s10696-012-9150-7 10.1007/s10845-015-1117-6 10.1080/00207540802620779 10.1016/j.eswa.2019.112959 10.1016/j.procir.2013.09.077 10.1016/j.ejor.2017.01.002 10.1016/S0305-0548(02)00118-1 10.1016/j.cie.2010.07.001 10.1016/j.cor.2019.06.007 10.1007/s00170-013-5221-5 10.1080/00207543.2017.1421781 10.1016/j.cor.2018.10.010 10.1080/00207543.2019.1672900 10.1016/S0377-2217(96)00205-6 10.1016/j.omega.2004.07.023 10.1016/j.eswax.2020.100022 10.1016/j.cor.2010.03.003 10.1016/0167-6377(83)90042-1 10.1016/j.ejor.2017.10.014 10.1080/07408170008963887 10.1016/j.tcs.2018.08.016 10.1016/j.cie.2019.07.011 10.1016/j.asoc.2016.10.039 10.1016/S0167-5060(08)70356-X 10.1016/j.cie.2009.12.009 10.1016/j.asoc.2013.07.029 10.1016/j.cie.2016.11.001 10.1016/j.eswa.2017.09.054 10.1016/j.cie.2012.03.018 10.1016/j.cor.2018.07.007 10.1007/s00170-011-3653-3 10.1016/j.asoc.2015.01.028 10.1080/03052151003759117 10.1007/s10601-018-9281-x |
| ContentType | Journal Article |
| Copyright | 2021 Informa UK Limited, trading as Taylor & Francis Group 2021 2021 Informa UK Limited, trading as Taylor & Francis Group |
| Copyright_xml | – notice: 2021 Informa UK Limited, trading as Taylor & Francis Group 2021 – notice: 2021 Informa UK Limited, trading as Taylor & Francis Group |
| DBID | AAYXX CITATION 7SC 8FD F28 FR3 JQ2 L7M L~C L~D |
| DOI | 10.1080/00207543.2021.1885068 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering 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 Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1366-588X |
| EndPage | 2229 |
| ExternalDocumentID | 10_1080_00207543_2021_1885068 1885068 |
| Genre | Research Article |
| GroupedDBID | -~X .7F .QJ 0BK 0R~ 29J 2DF 30N 4.4 5GY 5VS 8VB A8Z AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFIM ABHAV ABJNI ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACGEJ ACGFO ACGFS ACGOD ACIWK ACNCT ACTIO ADCVX ADGTB ADXPE AEGXH AEISY AEMOZ AENEX AEOZL AEPSL AEYOC AFKVX AFRVT AGDLA AGMYJ AHDZW AHQJS AIAGR AIJEM AIYEW AJWEG AKBVH AKOOK AKVCP ALMA_UNASSIGNED_HOLDINGS ALQZU AQRUH AQTUD AVBZW AWYRJ BLEHA CCCUG CE4 CS3 DGEBU DKSSO DU5 EBD EBE EBO EBR EBS EBU EMK EPL ESTFP E~A E~B GTTXZ H13 HF~ HZ~ H~9 H~P I-F IPNFZ J.P K1G KYCEM LJTGL M4Z ML~ NA5 NX~ O9- P2P PQQKQ QWB RIG RNANH ROSJB RTWRZ S-T SNACF TASJS TBQAZ TDBHL TEN TFL TFT TFW TH9 TN5 TNC TTHFI TUROJ TWF UT5 UU3 ZGOLN ZL0 ~S~ AAYXX CITATION 7SC 8FD F28 FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c363t-a760128641e6ce9edce0d69bef157aec1802cb0e7549bf0d31d10420976cef5b3 |
| IEDL.DBID | TFW |
| ISICitedReferencesCount | 57 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000619076400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-7543 |
| IngestDate | Wed Aug 13 06:37:09 EDT 2025 Sat Nov 29 05:36:20 EST 2025 Tue Nov 18 22:24:21 EST 2025 Mon Oct 20 23:47:11 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c363t-a760128641e6ce9edce0d69bef157aec1802cb0e7549bf0d31d10420976cef5b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-8026-4935 0000-0001-6827-126X |
| PQID | 2770816586 |
| PQPubID | 30924 |
| PageCount | 18 |
| ParticipantIDs | proquest_journals_2770816586 crossref_primary_10_1080_00207543_2021_1885068 informaworld_taylorfrancis_310_1080_00207543_2021_1885068 crossref_citationtrail_10_1080_00207543_2021_1885068 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-04-03 |
| PublicationDateYYYYMMDD | 2022-04-03 |
| PublicationDate_xml | – month: 04 year: 2022 text: 2022-04-03 day: 03 |
| PublicationDecade | 2020 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London |
| PublicationTitle | International journal of production research |
| PublicationYear | 2022 |
| Publisher | Taylor & Francis Taylor & Francis LLC |
| Publisher_xml | – name: Taylor & Francis – name: Taylor & Francis LLC |
| References | Baewicz J. (CIT0005) 1983; 2 CIT0030 CIT0032 CIT0031 CIT0034 CIT0033 CIT0036 CIT0035 CIT0038 CIT0037 Kusoncum Chuleeporn (CIT0043) 2020 CIT0041 CIT0042 CIT0001 CIT0045 CIT0044 Elidrissi Abdelhak (CIT0021) 2020 CIT0003 CIT0002 CIT0049 CIT0004 CIT0048 CIT0007 CIT0006 CIT0009 CIT0050 CIT0052 CIT0051 CIT0010 CIT0054 CIT0053 CIT0056 CIT0011 CIT0055 Çanakoğlu Ethem (CIT0008) 2020 Gao Jiaquan. (CIT0027) 2010; 58 Li Yanzhi (CIT0046) 2003 Kim Young-In (CIT0040) 2020 CIT0014 CIT0058 CIT0013 CIT0057 CIT0016 CIT0015 Kim Jun (CIT0039) 2020 CIT0059 CIT0018 CIT0017 CIT0019 CIT0061 Chen Lin (CIT0012) 2018; 268 CIT0060 CIT0063 CIT0062 CIT0020 CIT0064 CIT0023 CIT0022 CIT0025 CIT0024 CIT0026 CIT0029 CIT0028 Li Debiao (CIT0047) 2020 |
| References_xml | – ident: CIT0038 – ident: CIT0018 doi: 10.1016/j.ejor.2013.02.042 – ident: CIT0007 doi: 10.5772/54381 – ident: CIT0004 doi: 10.1016/j.ifacol.2017.08.1998 – start-page: 1 year: 2020 ident: CIT0008 publication-title: International Journal of Production Research – ident: CIT0025 doi: 10.1016/j.ejor.2018.05.056 – ident: CIT0053 doi: 10.1016/j.cie.2014.09.006 – ident: CIT0055 doi: 10.1016/j.cor.2009.02.012 – start-page: 1 year: 2020 ident: CIT0047 publication-title: International Journal of Production Research – ident: CIT0051 doi: 10.1016/j.cor.2019.03.004 – ident: CIT0010 doi: 10.1007/s00170-003-1622-1 – ident: CIT0037 – ident: CIT0050 doi: 10.1016/S0377-2217(02)00726-9 – ident: CIT0028 doi: 10.1016/j.cie.2018.05.014 – ident: CIT0062 doi: 10.1016/j.jmsy.2015.07.002 – ident: CIT0054 doi: 10.1007/s00170-006-0810-1 – volume: 268 start-page: 101 issue: 1 year: 2018 ident: CIT0012 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.01.037 – ident: CIT0049 doi: 10.1080/21681015.2016.1139005 – ident: CIT0058 doi: 10.1016/j.cor.2019.07.016 – ident: CIT0001 doi: 10.1016/j.cie.2016.05.020 – ident: CIT0048 doi: 10.1016/j.cor.2010.08.018 – ident: CIT0029 doi: 10.1016/j.ejor.2015.11.020 – start-page: 1 year: 2020 ident: CIT0040 publication-title: International Journal of Production Research – ident: CIT0036 doi: 10.1016/S0167-6377(01)00104-3 – ident: CIT0014 doi: 10.1080/00207543.2019.1600763 – ident: CIT0056 doi: 10.1016/j.cor.2010.04.018 – ident: CIT0063 doi: 10.1007/s10696-012-9150-7 – ident: CIT0003 doi: 10.1007/s10845-015-1117-6 – ident: CIT0035 doi: 10.1080/00207540802620779 – ident: CIT0064 doi: 10.1016/j.eswa.2019.112959 – ident: CIT0009 doi: 10.1016/j.procir.2013.09.077 – ident: CIT0023 doi: 10.1016/j.ejor.2017.01.002 – volume-title: The 2003 Congress on Evolutionary computation, 2003. CEC'03 year: 2003 ident: CIT0046 – ident: CIT0060 doi: 10.1016/S0305-0548(02)00118-1 – ident: CIT0016 doi: 10.1016/j.cie.2010.07.001 – ident: CIT0020 doi: 10.1016/j.cor.2019.06.007 – ident: CIT0013 doi: 10.1007/s00170-013-5221-5 – ident: CIT0030 doi: 10.1080/00207543.2017.1421781 – start-page: 1 year: 2020 ident: CIT0043 publication-title: International Journal of Production Research – ident: CIT0006 doi: 10.1016/j.cor.2018.10.010 – ident: CIT0041 doi: 10.1080/00207543.2019.1672900 – ident: CIT0045 doi: 10.1016/S0377-2217(96)00205-6 – ident: CIT0011 doi: 10.1016/j.omega.2004.07.023 – ident: CIT0022 doi: 10.1016/j.eswax.2020.100022 – start-page: 1 year: 2020 ident: CIT0021 publication-title: International Journal of Production Research – ident: CIT0026 doi: 10.1016/j.cor.2010.03.003 – volume: 2 start-page: 80 issue: 2 year: 1983 ident: CIT0005 publication-title: Operations Research Letters doi: 10.1016/0167-6377(83)90042-1 – ident: CIT0042 doi: 10.1016/j.ejor.2017.10.014 – ident: CIT0059 doi: 10.1080/07408170008963887 – ident: CIT0015 doi: 10.1016/j.tcs.2018.08.016 – ident: CIT0052 doi: 10.1016/j.cie.2019.07.011 – ident: CIT0002 doi: 10.1016/j.asoc.2016.10.039 – ident: CIT0032 doi: 10.1016/S0167-5060(08)70356-X – volume: 58 start-page: 602 issue: 4 year: 2010 ident: CIT0027 publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2009.12.009 – start-page: 1 year: 2020 ident: CIT0039 publication-title: International Journal of Production Research – ident: CIT0057 doi: 10.1016/j.asoc.2013.07.029 – ident: CIT0033 doi: 10.1016/j.cie.2016.11.001 – ident: CIT0061 doi: 10.1016/j.eswa.2017.09.054 – ident: CIT0017 doi: 10.1016/j.cie.2012.03.018 – ident: CIT0024 doi: 10.1016/j.cor.2018.07.007 – ident: CIT0031 doi: 10.1007/s00170-011-3653-3 – ident: CIT0034 doi: 10.1016/j.asoc.2015.01.028 – ident: CIT0019 doi: 10.1080/03052151003759117 – ident: CIT0044 doi: 10.1007/s10601-018-9281-x |
| SSID | ssj0000584 |
| Score | 2.5694053 |
| Snippet | This paper studies the multi-resource-constrained unrelated parallel machine scheduling problem under various operational constraints with the objective of... |
| SourceID | proquest crossref informaworld |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 2212 |
| SubjectTerms | branching strategies Completion time constraint programming Constraints Exact solutions Lower bounds multiple resources Polynomials Scheduling Setup times Unrelated parallel machines |
| Title | Constraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup times |
| URI | https://www.tandfonline.com/doi/abs/10.1080/00207543.2021.1885068 https://www.proquest.com/docview/2770816586 |
| Volume | 60 |
| WOSCitedRecordID | wos000619076400001&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: PRVAWR databaseName: Taylor & Francis Online Journals customDbUrl: eissn: 1366-588X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000584 issn: 0020-7543 databaseCode: TFW dateStart: 19610101 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELUQYoCBb0ShIA-srpI4cewRISqmiqGIblFiOxJSWqom5Xfwk7lznNIKoQ6wRU7OShz7zme9e4-QOyPANQaFYkkecwaTomBSBDHLjY6sgbZcaSc2kY5GcjJRzx5NWHtYJebQZUsU4Xw1Lu68qDtEHFZwQ6CLOWR3UTgIJZKuYbkvhH7UMBgPX799cSI9D3PA0KSr4fmtl43otMFd-sNXuwA0PPqHVz8mh373Se_b6XJCduzslByscRKekU-U8HTCEQ314K0p3KAd-TiFl6UOhsgW_uif6c7EGrqcufIYuEJW8aqyFZ06wKalkEhDYMP6d-p1bCgeA9MOzs06Rd4GmprlnDrh-3PyMnwcPzwxL9vANBe8YTnCbCIp4tAKbRXCTAMjVGHLMElzq5FzTheBhXFQRRkYHhrICaMANkbalknBL8ju7H1mLwkVwiTIuBelFqKoMjI2RQyPSZXmCVe2R-Lud2Xac5rj51ZZuKI-bQc8wwHP_ID3yGBlNm9JPbYZqPW5kDXuNKVspU8yvsW2302czPuHOovSFBVPEimu_tD1NdmPsBoDgUS8T3abxdLekD390bzVi1u3Er4AukMGyQ |
| linkProvider | Taylor & Francis |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8QwEA6-QD34FldXzcFrpG3aNDmKuCjqnlb0FtokBWFdl7Xr7_AnO5OmuiLiQW8l7YR2OplJhm--IeTECnCNUalYVqScgVGUTIooZYU1ibMwVijjm03k_b58eFCztTAIq8QzdNUQRXhfjYsbk9EtJA5LuCHSpRyOd0l8GktkXZPzZDGDWItWPujdf3rjTAYm5oihTFvF89M0X-LTF_bSb97ah6De-n-8_AZZCxtQetZYzCaZc6MtsjpDS7hN3rCLp-8dUdOA33qCG7TlH6fwttQjEdkkZP-ZaUWcpdORr5CBKyQWHw7dkD55zKajcJaG2IYl8DS0sqGYCaYtopu1TXlrGKqnY1pjicoOuetdDM4vWejcwAwXvGYFIm0SKdLYCeMUIk0jK1TpqjjLC2eQds6UkQM9qLKKLI8tHAuTCPZGxlVZyXfJwuh55PYIFcJmSLqX5A4CqbIytWUKj0mVFxlXrkPS9n9pE2jN8XOHOv5gP20UrlHhOii8Q04_xMYNr8dvAmrWGHTtEypV0_1E819ku63l6OAiXnSS59j0JJNi_w9TH5Ply8Htjb656l8fkJUEizMQV8S7ZKGeTN0hWTKv9ePL5Mgvi3dXqQr0 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8QwEA6-ED34FldXzcFrpG3aNDmKuijK4kHRW2iTFIR1XXa7_g5_sjNp6gMRD3oraSe008lMJnzzDSFHVoBrjErFsiLlDIyiZFJEKSusSZyFsUIZ32wi7_flw4O6CWjCSYBVYg5dNUQR3lfj4h7ZqkXEYQU3BLqUQ3aXxMexRNI1OUvmYessMP-67d1_OONMBiLmiKFMW8Tz0zRfwtMX8tJvztpHoN7qP7z7GlkJ20960tjLOplxww2y_ImUcJO8Yg9P3zmipgG99QQ3aMs-TuFlqcchsnE4-2emFXGWToe-PgaukFZ8MHAD-uQRm45CJg2RDQvgaWhkQ_EcmLZ4bta25K1hqJ6OaI0FKlvkrnd-e3rBQt8GZrjgNSsQZ5NIkcZOGKcQZxpZoUpXxVleOIOkc6aMHOhBlVVkeWwhKUwi2BkZV2Ul3yZzw-eh2yFUCJsh5V6SOwijysrUlik8JlVeZFy5Dknb36VNIDXHzx3o-J37tFG4RoXroPAOOX4XGzWsHr8JqM-2oGt_nFI1vU80_0W22xqODg5iopM8x5YnmRS7f5j6kCzenPX09WX_ao8sJViZgaAi3iVz9Xjq9smCeakfJ-MDvyjeACeQCaU |
| 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+approach+for+multi-resource-constrained+unrelated+parallel+machine+scheduling+problem+with+sequence-dependent+setup+times&rft.jtitle=International+journal+of+production+research&rft.au=Yunusoglu%2C+Pinar&rft.au=Seyda+Topaloglu+Yildiz&rft.date=2022-04-03&rft.pub=Taylor+%26+Francis+LLC&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=60&rft.issue=7&rft.spage=2212&rft.epage=2229&rft_id=info:doi/10.1080%2F00207543.2021.1885068&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon |