Single-machine scheduling with an external resource
highlights•We study single-machine scheduling with an external resource.•We look at four different classes of problems with an external resource.•For each class, we consider four different classical objective functions.•We provide a complexity analysis for different members of these four classes. Th...
Uložené v:
| Vydané v: | European journal of operational research Ročník 293; číslo 2; s. 457 - 468 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.09.2021
|
| Predmet: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | highlights•We study single-machine scheduling with an external resource.•We look at four different classes of problems with an external resource.•For each class, we consider four different classical objective functions.•We provide a complexity analysis for different members of these four classes.
This paper studies the complexity of single-machine scheduling with an external resource, which is rented for a non-interrupted period. Jobs that need this external resource are executed only when the external resource is available. There is a cost associated with the scheduling of jobs and a cost associated with the duration of the renting period of the external resource. We look at four classes of problems with an external resource: a class of problems where the renting period is budgeted and the scheduling cost needs to be minimized, a class of problems where the scheduling cost is budgeted and the renting period needs to be minimized, a class of two-objective problems where both, the renting period and the scheduling cost, are to be minimized, and a class of problems where a linear combination of the scheduling cost and the renting period is minimized. We provide a thorough complexity analysis (NP-hardness proofs and (pseudo-)polynomial algorithms) for different members of these four classes. |
|---|---|
| AbstractList | highlights•We study single-machine scheduling with an external resource.•We look at four different classes of problems with an external resource.•For each class, we consider four different classical objective functions.•We provide a complexity analysis for different members of these four classes.
This paper studies the complexity of single-machine scheduling with an external resource, which is rented for a non-interrupted period. Jobs that need this external resource are executed only when the external resource is available. There is a cost associated with the scheduling of jobs and a cost associated with the duration of the renting period of the external resource. We look at four classes of problems with an external resource: a class of problems where the renting period is budgeted and the scheduling cost needs to be minimized, a class of problems where the scheduling cost is budgeted and the renting period needs to be minimized, a class of two-objective problems where both, the renting period and the scheduling cost, are to be minimized, and a class of problems where a linear combination of the scheduling cost and the renting period is minimized. We provide a thorough complexity analysis (NP-hardness proofs and (pseudo-)polynomial algorithms) for different members of these four classes. |
| Author | Davari, Morteza Briskorn, Dirk Matuschke, Jannik |
| Author_xml | – sequence: 1 givenname: Dirk surname: Briskorn fullname: Briskorn, Dirk organization: Chair of Production and Logistics, University of Wuppertal, Germany – sequence: 2 givenname: Morteza orcidid: 0000-0002-7093-0946 surname: Davari fullname: Davari, Morteza email: morteza.davari@kuleuven.be, morteza.davari@skema.edu organization: SKEMA Business School, Université Côte d’Azur, France – sequence: 3 givenname: Jannik surname: Matuschke fullname: Matuschke, Jannik organization: Research Centre for Operations Management, KU Leuven, Belgium |
| BookMark | eNp9z8tKAzEUxvEgFWyrL-BqXmDGXJpLwY0UtULBhd2HTHJiM0wzkqRe3t4pdeWiqwMf_A_8ZmgShwgI3RLcEEzEXddAN6SGYjoOtMELfoGmRElaCyXwBE0xk7KmlMgrNMu5wxgTTvgUsbcQ33uo98buQoQq2x24Qz-O1Vcou8rECr4LpGj6KkEeDsnCNbr0ps9w83fnaPv0uF2t683r88vqYVNbJnipXau8balwrZF8QRWXRNIFEd5YYNi0FHNqJTFSKSe8dUJxv1SeKbb0xBk2R-r01qYh5wRe21BMCUMsyYReE6yPdt3po10f7ZpQPdrHlP5LP1LYm_RzPro_RTCaPgMknW2AaMGFBLZoN4Rz-S_86XWI |
| CitedBy_id | crossref_primary_10_1111_itor_13518 crossref_primary_10_1016_j_ejor_2023_08_038 crossref_primary_10_1080_24725854_2024_2398220 crossref_primary_10_1007_s11590_022_01928_z crossref_primary_10_1016_j_ejor_2024_03_011 crossref_primary_10_1080_0305215X_2024_2413646 |
| Cites_doi | 10.1016/j.cie.2017.07.024 10.1137/0125042 10.1057/palgrave.jors.2601099 10.1016/S0167-5060(08)70743-X 10.1287/mnsc.16.1.77 10.1287/moor.13.2.330 10.1080/00207543.2015.1064177 10.1016/j.ejor.2010.03.008 10.1007/PL00013357 10.1007/s00453-008-9251-6 10.1002/nav.20393 10.1016/0166-218X(93)E0168-X 10.1145/321921.321934 10.1002/nav.3800030106 10.1016/S0167-5060(08)70323-6 10.1287/opre.32.1.89 10.1016/0167-6377(94)90064-7 10.1287/mnsc.19.5.544 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier B.V. |
| Copyright_xml | – notice: 2020 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2020.12.045 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 468 |
| ExternalDocumentID | 10_1016_j_ejor_2020_12_045 S0377221720310912 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c365t-db8fcb26dba7542857172416face30ab2052c71a788d6fcd685f98f3839f1da3 |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000637696600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sat Nov 29 07:20:36 EST 2025 Tue Nov 18 22:46:15 EST 2025 Fri Feb 23 02:46:24 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Single-machine scheduling Pseudo-polynomial algorithm Scheduling External resource Complexity |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c365t-db8fcb26dba7542857172416face30ab2052c71a788d6fcd685f98f3839f1da3 |
| ORCID | 0000-0002-7093-0946 |
| PageCount | 12 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2020_12_045 crossref_primary_10_1016_j_ejor_2020_12_045 elsevier_sciencedirect_doi_10_1016_j_ejor_2020_12_045 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-09-01 |
| PublicationDateYYYYMMDD | 2021-09-01 |
| PublicationDate_xml | – month: 09 year: 2021 text: 2021-09-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2021 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Kerkhove, Vanhoucke, Maenhout (bib0010) 2017; 111 Liu, Vannelli (bib0015) 1995; 59 Adolphson, Hu (bib0001) 1973; 25 Chen, Megow, Rischke, Stougie, Verschae (bib0004) 2018 Lawler (bib0011) 1973; 19 Garey, Tarjan, Wilfong (bib0007) 1988; 13 Jackson (bib0008) 1955 Lawler (bib0012) 1978; 2 Vandenheede, Vanhoucke, Maenhout (bib0021) 2016; 54 Wikum, Llewellyn, Nemhauser (bib0023) 1994; 16 Sahni (bib0019) 1976; 23 Lenstra, Rinnooy Kan, Brucker (bib0014) 1977; 1 Möhring (bib0016) 1984; 32 Drexl, Kimms (bib0005) 2001; 52 Garey, Johnson (bib0006) 1979 Karp (bib0009) 1972 Lawler, Moore (bib0013) 1969; 16 Rodrigues, Yamashita (bib0018) 2010; 206 Smith (bib0020) 1956; 3 Brown, Wilson (bib0003) 2005 Ambühl, Mastrolilli (bib0002) 2009; 53 Nübel (bib0017) 2001; 23 Wan, Qi (bib0022) 2010; 57 Nübel (10.1016/j.ejor.2020.12.045_bib0017) 2001; 23 Sahni (10.1016/j.ejor.2020.12.045_bib0019) 1976; 23 Lawler (10.1016/j.ejor.2020.12.045_bib0012) 1978; 2 Vandenheede (10.1016/j.ejor.2020.12.045_bib0021) 2016; 54 Wan (10.1016/j.ejor.2020.12.045_bib0022) 2010; 57 Garey (10.1016/j.ejor.2020.12.045_bib0006) 1979 Garey (10.1016/j.ejor.2020.12.045_bib0007) 1988; 13 Kerkhove (10.1016/j.ejor.2020.12.045_bib0010) 2017; 111 Drexl (10.1016/j.ejor.2020.12.045_bib0005) 2001; 52 Lawler (10.1016/j.ejor.2020.12.045_bib0011) 1973; 19 Lawler (10.1016/j.ejor.2020.12.045_bib0013) 1969; 16 Liu (10.1016/j.ejor.2020.12.045_bib0015) 1995; 59 Ambühl (10.1016/j.ejor.2020.12.045_bib0002) 2009; 53 Rodrigues (10.1016/j.ejor.2020.12.045_bib0018) 2010; 206 Möhring (10.1016/j.ejor.2020.12.045_bib0016) 1984; 32 Wikum (10.1016/j.ejor.2020.12.045_bib0023) 1994; 16 Brown (10.1016/j.ejor.2020.12.045_bib0003) 2005 Adolphson (10.1016/j.ejor.2020.12.045_bib0001) 1973; 25 Chen (10.1016/j.ejor.2020.12.045_bib0004) 2018 Lenstra (10.1016/j.ejor.2020.12.045_bib0014) 1977; 1 Smith (10.1016/j.ejor.2020.12.045_bib0020) 1956; 3 Karp (10.1016/j.ejor.2020.12.045_bib0009) 1972 Jackson (10.1016/j.ejor.2020.12.045_bib0008) 1955 |
| References_xml | – volume: 16 start-page: 77 year: 1969 end-page: 84 ident: bib0013 article-title: A functional equation and its application to resource allocation and sequencing problems publication-title: Management Science – year: 1955 ident: bib0008 article-title: Scheduling a production line to minimize maximum tardiness publication-title: Research report, Los Angeles University of California Management Sciences Research Project – volume: 206 start-page: 562 year: 2010 end-page: 568 ident: bib0018 article-title: An exact algorithm for minimizing resource availability costs in project scheduling publication-title: European Journal of Operational Research – volume: 13 start-page: 330 year: 1988 end-page: 348 ident: bib0007 article-title: One-processor scheduling with symmetric earliness and tardiness penalties publication-title: Mathematics of Operations Research – volume: 52 start-page: 340 year: 2001 end-page: 351 ident: bib0005 article-title: Optimization guided lower and upper bounds for the resource investment problem publication-title: Journal of the Operational Research Society – year: 1979 ident: bib0006 article-title: Computers and intractability: A Guide to the theory of NP-Completeness – start-page: 85 year: 1972 end-page: 103 ident: bib0009 article-title: Reducibility among combinatorial problems publication-title: Complexity of computer computations (proc. sympos., ibm thomas j. watson res. center, yorktown heights, n.y., 1972) – volume: 53 start-page: 488 year: 2009 end-page: 503 ident: bib0002 article-title: Single machine precedence constrained scheduling is a vertex cover problem publication-title: Algorithmica – year: 2005 ident: bib0003 article-title: The black book outsourcing: How to manage the changes, challenges, and opportunities. – volume: 25 start-page: 403 year: 1973 end-page: 423 ident: bib0001 article-title: Optimal linear ordering publication-title: SIAM Journal on Applied Mathematics – year: 2018 ident: bib0004 article-title: Optimal Algorithms for Scheduling under Time-of-Use Tariffs publication-title: Technical Report – volume: 59 start-page: 137 year: 1995 end-page: 151 ident: bib0015 article-title: Generating lower bounds for the linear arrangement problem publication-title: Discrete Applied Mathematics – volume: 19 start-page: 544 year: 1973 end-page: 546 ident: bib0011 article-title: Optimal sequencing of a single machine subject to precedence constraints publication-title: Management Science – volume: 57 start-page: 159 year: 2010 end-page: 171 ident: bib0022 article-title: Scheduling with variable time slot costs publication-title: Naval Research Logistics (NRL) – volume: 3 start-page: 59 year: 1956 end-page: 66 ident: bib0020 article-title: Various optimizers for single-stage production publication-title: Naval Research Logistics Quarterly – volume: 111 start-page: 303 year: 2017 end-page: 319 ident: bib0010 article-title: On the resource renting problem with overtime publication-title: Computers & Industrial Engineering – volume: 23 start-page: 359 year: 2001 end-page: 381 ident: bib0017 article-title: The resource renting problem subject to temporal constraints publication-title: OR-Spektrum – volume: 16 start-page: 87 year: 1994 end-page: 99 ident: bib0023 article-title: One-machine generalized precedence constrained scheduling problems publication-title: Operations Research Letters – volume: 32 start-page: 89 year: 1984 end-page: 120 ident: bib0016 article-title: Minimizing costs of resource requirements in project networks subject to a fixed completion time publication-title: Operations Research – volume: 23 start-page: 116127 year: 1976 ident: bib0019 article-title: Algorithms for scheduling independent tasks publication-title: Journal of ACM – volume: 54 start-page: 4723 year: 2016 end-page: 4743 ident: bib0021 article-title: A scatter search for the extended resource renting problem publication-title: International Journal of Production Research – volume: 2 start-page: 75 year: 1978 end-page: 90 ident: bib0012 article-title: Sequencing jobs to minimize total weighted completion time subject to precedence constraints publication-title: Annals of Discrete Mathematics – volume: 1 start-page: 343 year: 1977 end-page: 362 ident: bib0014 article-title: Complexity of machine scheduling problems publication-title: Annals of Discrete Mathematics – volume: 111 start-page: 303 year: 2017 ident: 10.1016/j.ejor.2020.12.045_bib0010 article-title: On the resource renting problem with overtime publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2017.07.024 – volume: 25 start-page: 403 issue: 3 year: 1973 ident: 10.1016/j.ejor.2020.12.045_bib0001 article-title: Optimal linear ordering publication-title: SIAM Journal on Applied Mathematics doi: 10.1137/0125042 – volume: 52 start-page: 340 issue: 3 year: 2001 ident: 10.1016/j.ejor.2020.12.045_bib0005 article-title: Optimization guided lower and upper bounds for the resource investment problem publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601099 – volume: 1 start-page: 343 year: 1977 ident: 10.1016/j.ejor.2020.12.045_bib0014 article-title: Complexity of machine scheduling problems publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70743-X – volume: 16 start-page: 77 issue: 1 year: 1969 ident: 10.1016/j.ejor.2020.12.045_bib0013 article-title: A functional equation and its application to resource allocation and sequencing problems publication-title: Management Science doi: 10.1287/mnsc.16.1.77 – start-page: 85 year: 1972 ident: 10.1016/j.ejor.2020.12.045_bib0009 article-title: Reducibility among combinatorial problems – volume: 13 start-page: 330 issue: 2 year: 1988 ident: 10.1016/j.ejor.2020.12.045_bib0007 article-title: One-processor scheduling with symmetric earliness and tardiness penalties publication-title: Mathematics of Operations Research doi: 10.1287/moor.13.2.330 – year: 2018 ident: 10.1016/j.ejor.2020.12.045_bib0004 article-title: Optimal Algorithms for Scheduling under Time-of-Use Tariffs – volume: 54 start-page: 4723 issue: 16 year: 2016 ident: 10.1016/j.ejor.2020.12.045_bib0021 article-title: A scatter search for the extended resource renting problem publication-title: International Journal of Production Research doi: 10.1080/00207543.2015.1064177 – volume: 206 start-page: 562 issue: 3 year: 2010 ident: 10.1016/j.ejor.2020.12.045_bib0018 article-title: An exact algorithm for minimizing resource availability costs in project scheduling publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2010.03.008 – volume: 23 start-page: 359 issue: 3 year: 2001 ident: 10.1016/j.ejor.2020.12.045_bib0017 article-title: The resource renting problem subject to temporal constraints publication-title: OR-Spektrum doi: 10.1007/PL00013357 – volume: 53 start-page: 488 issue: 4 year: 2009 ident: 10.1016/j.ejor.2020.12.045_bib0002 article-title: Single machine precedence constrained scheduling is a vertex cover problem publication-title: Algorithmica doi: 10.1007/s00453-008-9251-6 – volume: 57 start-page: 159 issue: 2 year: 2010 ident: 10.1016/j.ejor.2020.12.045_bib0022 article-title: Scheduling with variable time slot costs publication-title: Naval Research Logistics (NRL) doi: 10.1002/nav.20393 – volume: 59 start-page: 137 issue: 2 year: 1995 ident: 10.1016/j.ejor.2020.12.045_bib0015 article-title: Generating lower bounds for the linear arrangement problem publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(93)E0168-X – volume: 23 start-page: 116127 issue: 1 year: 1976 ident: 10.1016/j.ejor.2020.12.045_bib0019 article-title: Algorithms for scheduling independent tasks publication-title: Journal of ACM doi: 10.1145/321921.321934 – volume: 3 start-page: 59 issue: 12 year: 1956 ident: 10.1016/j.ejor.2020.12.045_bib0020 article-title: Various optimizers for single-stage production publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800030106 – volume: 2 start-page: 75 year: 1978 ident: 10.1016/j.ejor.2020.12.045_bib0012 article-title: Sequencing jobs to minimize total weighted completion time subject to precedence constraints publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70323-6 – year: 1955 ident: 10.1016/j.ejor.2020.12.045_bib0008 article-title: Scheduling a production line to minimize maximum tardiness – volume: 32 start-page: 89 issue: 1 year: 1984 ident: 10.1016/j.ejor.2020.12.045_bib0016 article-title: Minimizing costs of resource requirements in project networks subject to a fixed completion time publication-title: Operations Research doi: 10.1287/opre.32.1.89 – volume: 16 start-page: 87 issue: 2 year: 1994 ident: 10.1016/j.ejor.2020.12.045_bib0023 article-title: One-machine generalized precedence constrained scheduling problems publication-title: Operations Research Letters doi: 10.1016/0167-6377(94)90064-7 – year: 2005 ident: 10.1016/j.ejor.2020.12.045_bib0003 – year: 1979 ident: 10.1016/j.ejor.2020.12.045_bib0006 – volume: 19 start-page: 544 year: 1973 ident: 10.1016/j.ejor.2020.12.045_bib0011 article-title: Optimal sequencing of a single machine subject to precedence constraints publication-title: Management Science doi: 10.1287/mnsc.19.5.544 |
| SSID | ssj0001515 |
| Score | 2.4008334 |
| Snippet | highlights•We study single-machine scheduling with an external resource.•We look at four different classes of problems with an external resource.•For each... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 457 |
| SubjectTerms | Complexity External resource Pseudo-polynomial algorithm Scheduling Single-machine scheduling |
| Title | Single-machine scheduling with an external resource |
| URI | https://dx.doi.org/10.1016/j.ejor.2020.12.045 |
| Volume | 293 |
| WOSCitedRecordID | wos000637696600004&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: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fTxQxEG4MGKIPiKcEFMk--HYpuW232_YRBCNEiQkXcm-bbn8knuceOQ5C_OudbttlBSVq4svm0lzvup3ZmenszPch9NYqD_KkDC6ldbjgqsCSM4M51QU1zMq6ZZ47_8hPT8VkIj_H0qHLlk6AN424uZEX_1XUMAbC9q2zfyHu7kdhAD6D0OEKYofrHwn-DJzRzOJvbZWkHcLpFbzJrMu5Ko_qH5Cfh4uYu_9tej6GqjCwSEnDiA7UZZEPfHH6PJQEg_3sGn8O1bUKXextPe_3zvx_UssrWFQE-vSUSV_7qQeSd7VVMR92rycm9GFxjgkJHZl7NphVwQkuRWAOSHaXBGrEqGCkZ0ULxnsOuQi8O_dsfUg7TPfsdO6BXcmozesGcMo7GNpnflF-TSQgoYLPXiWcSTCDq_vHR5OTznn7-K598RRvIvZZhZLAu__061imF5-MN9B6PFhk-0EhnqNHthmgtdTXMEDPEn9HFs35AD3tgVG-QPRnxcluFSfzipOpJku3myXFeYnG74_G7z7gSKmBNS3ZEptaOF2T0tTKUx8LBqd5iOFKp7SlI1WTESOa54oLYUqnTSmYk8JRCKNdbhTdRCvNvLFbKLMOHmljZcFGtODUCW5oDd6BSmpVrvk2ytPeVDrCzXvWk1mV6gqnld_Pyu9nlZMK9nMbDbs5FwFs5cFvs7TlVQwXQxhYgYY8MO_VP857jZ7cPgQ7aGW5uLJv0GN9vfxyudiNivQD8GWPMw |
| 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=Single-machine+scheduling+with+an+external+resource&rft.jtitle=European+journal+of+operational+research&rft.au=Briskorn%2C+Dirk&rft.au=Davari%2C+Morteza&rft.au=Matuschke%2C+Jannik&rft.date=2021-09-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=293&rft.issue=2&rft.spage=457&rft.epage=468&rft_id=info:doi/10.1016%2Fj.ejor.2020.12.045&rft.externalDocID=S0377221720310912 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |