Parallel dedicated machine scheduling with conflict graphs
•Scheduling with conflicts subject to fixed job sequences is introduced.•Complexity status is investigated.•Dynamic programming algorithms are developed. This paper investigates a variant of parallel-machine scheduling problems with conflict constraints. A set of identical parallel machines is avail...
Uloženo v:
| Vydáno v: | Computers & industrial engineering Ročník 124; s. 316 - 321 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.10.2018
|
| Témata: | |
| ISSN: | 0360-8352, 1879-0550 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •Scheduling with conflicts subject to fixed job sequences is introduced.•Complexity status is investigated.•Dynamic programming algorithms are developed.
This paper investigates a variant of parallel-machine scheduling problems with conflict constraints. A set of identical parallel machines is available for processing a set of jobs subject to conflict constraints, which specify pairs of jobs that are mutually disjoint due to resource availability. Jobs conflicting to each other cannot be processed simultaneously. The scheduling problem is to construct a feasible schedule that optimizes the considered managerial performance measures. This paper discusses the specific two-machine setting where each machine has a designated set of jobs to process. We give NP-hardness proofs for the case with the presence of a fixed processing sequence on one of the machines. Polynomial-time dynamic programming algorithms are proposed to produce optimal schedules for the case where the processing sequences on both machines are known and fixed a priori. |
|---|---|
| AbstractList | •Scheduling with conflicts subject to fixed job sequences is introduced.•Complexity status is investigated.•Dynamic programming algorithms are developed.
This paper investigates a variant of parallel-machine scheduling problems with conflict constraints. A set of identical parallel machines is available for processing a set of jobs subject to conflict constraints, which specify pairs of jobs that are mutually disjoint due to resource availability. Jobs conflicting to each other cannot be processed simultaneously. The scheduling problem is to construct a feasible schedule that optimizes the considered managerial performance measures. This paper discusses the specific two-machine setting where each machine has a designated set of jobs to process. We give NP-hardness proofs for the case with the presence of a fixed processing sequence on one of the machines. Polynomial-time dynamic programming algorithms are proposed to produce optimal schedules for the case where the processing sequences on both machines are known and fixed a priori. |
| Author | Lin, Bertrand M.T. Hong, Huai-Che |
| Author_xml | – sequence: 1 givenname: Huai-Che surname: Hong fullname: Hong, Huai-Che – sequence: 2 givenname: Bertrand M.T. surname: Lin fullname: Lin, Bertrand M.T. email: bmtlin@mail.nctu.edu.tw |
| BookMark | eNp9kMtOwzAQRS1UJNrCB7DLDySM49hJYIUqXlIlWMDacuxx4ypNKtuA-HtclRWLrkYazbmaexZkNk4jEnJNoaBAxc220A6LEmhTQF0A42dkTpu6zYFzmJE5MAF5w3h5QRYhbAGg4i2dk9s35dUw4JAZNE6riCbbKd27EbOgezSfgxs32beLfaan0Q5Ox2zj1b4Pl-TcqiHg1d9cko_Hh_fVc75-fXpZ3a9zzTjEvEwfKNFVHTNNzblubas5AgcUqhOdZaayHWJlsbW6FbUwVSVSJ1ZyQRVwtiT1MVf7KQSPVmoXVXTTGL1yg6QgDwrkNu1RHhRIqGVSkEj6j9x7t1P-5yRzd2QwVfpy6GVIJ6NOdjzqKM3kTtC_vf12QQ |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2022_11_012 crossref_primary_10_1016_j_cor_2021_105464 crossref_primary_10_1109_TNSM_2020_2989187 crossref_primary_10_3390_a17080348 |
| Cites_doi | 10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1 10.1016/S0377-2217(02)00246-1 10.1016/j.ejor.2015.10.048 10.1002/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F 10.1007/s10951-008-0089-1 10.1137/060666329 10.1016/j.cie.2009.10.003 10.1007/s10951-015-0455-8 10.1007/s10951-016-0482-0 10.1016/0166-218X(94)00160-F 10.1016/j.cie.2011.01.002 10.1016/j.cor.2011.04.014 10.1016/S0305-0548(02)00195-8 10.1016/j.ejor.2012.03.040 10.1016/j.disopt.2006.06.003 10.1016/0304-3975(96)00031-X 10.1057/jors.2011.90 10.1016/S0166-218X(03)00433-5 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier Ltd |
| Copyright_xml | – notice: 2018 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cie.2018.07.035 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Engineering |
| EISSN | 1879-0550 |
| EndPage | 321 |
| ExternalDocumentID | 10_1016_j_cie_2018_07_035 S0360835218303589 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKG AABNK AACTN AAEDT AAEDW AAFWJ AAIAV AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AARIN AAXUO ABAOU ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ADBBV ADEZE ADGUI ADMUD ADRHT ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LX9 LY1 LY7 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SST SSW SSZ T5K TAE TN5 WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c350t-2055a6b4b3d8755c9f9c5e050e6ab6bf3d4fbee4fe9fc9676d44610132561a053 |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000444664400025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0360-8352 |
| IngestDate | Tue Nov 18 21:26:14 EST 2025 Sat Nov 29 04:15:41 EST 2025 Fri Feb 23 02:29:10 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Conflict graph NP-hardness Parallel dedicated machines Dynamic programming Fixed sequences |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c350t-2055a6b4b3d8755c9f9c5e050e6ab6bf3d4fbee4fe9fc9676d44610132561a053 |
| PageCount | 6 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_cie_2018_07_035 crossref_primary_10_1016_j_cie_2018_07_035 elsevier_sciencedirect_doi_10_1016_j_cie_2018_07_035 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-10-01 |
| PublicationDateYYYYMMDD | 2018-10-01 |
| PublicationDate_xml | – month: 10 year: 2018 text: 2018-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Computers & industrial engineering |
| PublicationYear | 2018 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Bumgardner, J. A., Ombao, G. Z., DeCamp, G. L., & Krakirian, H. H. (2014). Even, Halldórsson, Kaplan, Ron (b0040) 2009; 12 Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. Hwang, Lin (b0070) 2011; 60 Kaplan, L. (2007). Scheduling with conflicts (Master thesis). Israel: Department of Electrical Engineering, Tel Aviv University. Hwang, Lin (b0075) 2012; 63 Kowalczyk, Leus (b0100) 2017; 20 Pereira (b0110) 2016; 250 Lin, Hwang, Kononov (b0105) 2015; 19 Bendraouche, Boudhar (b0015) 2012; 39 Glass, Shafransky, Strusevich (b0055) 2000; 47 Kellerer, Strusevich (b0085) 2003; 147 Agnetis, Kellerer, Nicosia, Pacifici (b0005) 2012; 221 Huang, Cai, Zhang (b0065) 2010; 58 Shafransky, Strusevich (b0120) 1998; 45 Baker, Coffman (b0010) 1996; 162 Kononov, Lin (b0095) 2006; 3 Gendreau, Laporte, Semet (b0050) 2004; 31 U.S. Patent No. 8,798,433. Washington, DC: U.S. Patent and Trademark Office. Goemans (b0060) 1995; 61 Epstein, Levin (b0035) 2008; 19 Kellerer, Strusevich (b0090) 2003; 133 Kononov (10.1016/j.cie.2018.07.035_b0095) 2006; 3 Huang (10.1016/j.cie.2018.07.035_b0065) 2010; 58 Hwang (10.1016/j.cie.2018.07.035_b0075) 2012; 63 10.1016/j.cie.2018.07.035_b0080 Baker (10.1016/j.cie.2018.07.035_b0010) 1996; 162 Glass (10.1016/j.cie.2018.07.035_b0055) 2000; 47 Bendraouche (10.1016/j.cie.2018.07.035_b0015) 2012; 39 Hwang (10.1016/j.cie.2018.07.035_b0070) 2011; 60 10.1016/j.cie.2018.07.035_b0045 10.1016/j.cie.2018.07.035_b0025 Epstein (10.1016/j.cie.2018.07.035_b0035) 2008; 19 Even (10.1016/j.cie.2018.07.035_b0040) 2009; 12 Kellerer (10.1016/j.cie.2018.07.035_b0085) 2003; 147 Gendreau (10.1016/j.cie.2018.07.035_b0050) 2004; 31 Shafransky (10.1016/j.cie.2018.07.035_b0120) 1998; 45 Goemans (10.1016/j.cie.2018.07.035_b0060) 1995; 61 Kellerer (10.1016/j.cie.2018.07.035_b0090) 2003; 133 Agnetis (10.1016/j.cie.2018.07.035_b0005) 2012; 221 Pereira (10.1016/j.cie.2018.07.035_b0110) 2016; 250 Lin (10.1016/j.cie.2018.07.035_b0105) 2015; 19 Kowalczyk (10.1016/j.cie.2018.07.035_b0100) 2017; 20 |
| References_xml | – volume: 12 start-page: 199 year: 2009 end-page: 224 ident: b0040 article-title: Scheduling with conflicts: Online and offline algorithms publication-title: Journal of Scheduling – volume: 45 start-page: 705 year: 1998 end-page: 731 ident: b0120 article-title: The open shop scheduling problem with a given sequence of jobs on one machine publication-title: Naval Research Logistics – volume: 39 start-page: 382 year: 2012 end-page: 390 ident: b0015 article-title: Scheduling jobs on identical machines with agreement graph publication-title: Computers & Operations Research – reference: . U.S. Patent No. 8,798,433. Washington, DC: U.S. Patent and Trademark Office. – volume: 250 start-page: 794 year: 2016 end-page: 806 ident: b0110 article-title: Procedures for the bin packing problem with precedence constraints publication-title: European Journal of Operational Research – volume: 20 start-page: 355 year: 2017 end-page: 372 ident: b0100 article-title: An exact algorithm for parallel machine scheduling with conflicts publication-title: Journal of Scheduling – volume: 221 start-page: 296 year: 2012 end-page: 305 ident: b0005 article-title: Parallel dedicated machines scheduling with chain precedence constraints publication-title: European Journal of Operational Research – volume: 162 start-page: 225 year: 1996 end-page: 243 ident: b0010 article-title: Mutual exclusion scheduling publication-title: Theoretical Computer Science – volume: 47 start-page: 304 year: 2000 end-page: 328 ident: b0055 article-title: Scheduling for parallel dedicated machines with a single server publication-title: Naval Research Logistics – volume: 147 start-page: 345 year: 2003 end-page: 364 ident: b0085 article-title: Scheduling parallel dedicated machines under a single non-shared resource publication-title: European Journal of Operational Research – volume: 61 start-page: 49 year: 1995 end-page: 59 ident: b0060 article-title: An approximation algorithm for scheduling on three dedicated machines publication-title: Discrete Applied Mathematics – volume: 133 start-page: 45 year: 2003 end-page: 68 ident: b0090 article-title: Scheduling problems for parallel dedicated machines under multiple resource constraints publication-title: Discrete Applied Mathematics – volume: 19 start-page: 1270 year: 2008 end-page: 1298 ident: b0035 article-title: On bin packing with conflicts publication-title: SIAM Journal on Optimization – reference: Bumgardner, J. A., Ombao, G. Z., DeCamp, G. L., & Krakirian, H. H. (2014). – volume: 58 start-page: 165 year: 2010 end-page: 174 ident: b0065 article-title: Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server publication-title: Computers & Industrial Engineering – volume: 19 start-page: 153 year: 2015 end-page: 163 ident: b0105 article-title: Relocation scheduling subject to fixed processing sequences publication-title: Journal of Scheduling – volume: 60 start-page: 690 year: 2011 end-page: 698 ident: b0070 article-title: Coupled-task scheduling on a single machine subject to a fixed-job-sequence publication-title: Computers & Industrial Engineering – reference: Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. – volume: 3 start-page: 366 year: 2006 end-page: 381 ident: b0095 article-title: On the relocation problems with multiple identical working crews publication-title: Discrete Optimization – volume: 31 start-page: 347 year: 2004 end-page: 358 ident: b0050 article-title: Heuristics and lower bounds for the bin packing problem with conflicts publication-title: Computers & Operations Research – volume: 63 start-page: 839 year: 2012 end-page: 845 ident: b0075 article-title: Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence publication-title: Journal of the Operational Research Society – reference: Kaplan, L. (2007). Scheduling with conflicts (Master thesis). Israel: Department of Electrical Engineering, Tel Aviv University. – volume: 47 start-page: 304 issue: 4 year: 2000 ident: 10.1016/j.cie.2018.07.035_b0055 article-title: Scheduling for parallel dedicated machines with a single server publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1 – volume: 147 start-page: 345 issue: 2 year: 2003 ident: 10.1016/j.cie.2018.07.035_b0085 article-title: Scheduling parallel dedicated machines under a single non-shared resource publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00246-1 – ident: 10.1016/j.cie.2018.07.035_b0080 – volume: 250 start-page: 794 issue: 3 year: 2016 ident: 10.1016/j.cie.2018.07.035_b0110 article-title: Procedures for the bin packing problem with precedence constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2015.10.048 – volume: 45 start-page: 705 issue: 7 year: 1998 ident: 10.1016/j.cie.2018.07.035_b0120 article-title: The open shop scheduling problem with a given sequence of jobs on one machine publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F – volume: 12 start-page: 199 issue: 2 year: 2009 ident: 10.1016/j.cie.2018.07.035_b0040 article-title: Scheduling with conflicts: Online and offline algorithms publication-title: Journal of Scheduling doi: 10.1007/s10951-008-0089-1 – volume: 19 start-page: 1270 issue: 3 year: 2008 ident: 10.1016/j.cie.2018.07.035_b0035 article-title: On bin packing with conflicts publication-title: SIAM Journal on Optimization doi: 10.1137/060666329 – volume: 58 start-page: 165 issue: 1 year: 2010 ident: 10.1016/j.cie.2018.07.035_b0065 article-title: Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2009.10.003 – volume: 19 start-page: 153 issue: 2 year: 2015 ident: 10.1016/j.cie.2018.07.035_b0105 article-title: Relocation scheduling subject to fixed processing sequences publication-title: Journal of Scheduling doi: 10.1007/s10951-015-0455-8 – volume: 20 start-page: 355 issue: 4 year: 2017 ident: 10.1016/j.cie.2018.07.035_b0100 article-title: An exact algorithm for parallel machine scheduling with conflicts publication-title: Journal of Scheduling doi: 10.1007/s10951-016-0482-0 – volume: 61 start-page: 49 issue: 1 year: 1995 ident: 10.1016/j.cie.2018.07.035_b0060 article-title: An approximation algorithm for scheduling on three dedicated machines publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(94)00160-F – ident: 10.1016/j.cie.2018.07.035_b0045 – ident: 10.1016/j.cie.2018.07.035_b0025 – volume: 60 start-page: 690 issue: 4 year: 2011 ident: 10.1016/j.cie.2018.07.035_b0070 article-title: Coupled-task scheduling on a single machine subject to a fixed-job-sequence publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2011.01.002 – volume: 39 start-page: 382 issue: 2 year: 2012 ident: 10.1016/j.cie.2018.07.035_b0015 article-title: Scheduling jobs on identical machines with agreement graph publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.04.014 – volume: 31 start-page: 347 issue: 3 year: 2004 ident: 10.1016/j.cie.2018.07.035_b0050 article-title: Heuristics and lower bounds for the bin packing problem with conflicts publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(02)00195-8 – volume: 221 start-page: 296 issue: 2 year: 2012 ident: 10.1016/j.cie.2018.07.035_b0005 article-title: Parallel dedicated machines scheduling with chain precedence constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2012.03.040 – volume: 3 start-page: 366 issue: 4 year: 2006 ident: 10.1016/j.cie.2018.07.035_b0095 article-title: On the relocation problems with multiple identical working crews publication-title: Discrete Optimization doi: 10.1016/j.disopt.2006.06.003 – volume: 162 start-page: 225 issue: 2 year: 1996 ident: 10.1016/j.cie.2018.07.035_b0010 article-title: Mutual exclusion scheduling publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(96)00031-X – volume: 63 start-page: 839 issue: 6 year: 2012 ident: 10.1016/j.cie.2018.07.035_b0075 article-title: Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2011.90 – volume: 133 start-page: 45 issue: 1 year: 2003 ident: 10.1016/j.cie.2018.07.035_b0090 article-title: Scheduling problems for parallel dedicated machines under multiple resource constraints publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(03)00433-5 |
| SSID | ssj0004591 |
| Score | 2.2657304 |
| Snippet | •Scheduling with conflicts subject to fixed job sequences is introduced.•Complexity status is investigated.•Dynamic programming algorithms are developed.
This... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 316 |
| SubjectTerms | Conflict graph Dynamic programming Fixed sequences NP-hardness Parallel dedicated machines |
| Title | Parallel dedicated machine scheduling with conflict graphs |
| URI | https://dx.doi.org/10.1016/j.cie.2018.07.035 |
| Volume | 124 |
| WOSCitedRecordID | wos000444664400025&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: 1879-0550 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004591 issn: 0360-8352 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9QwELVgy4EeChQQpQXlwImVV87ajuPeqqqooKqqxIL2FtmOLbZaQpVsq_58xrHzofIhQOISraw4sTxvx2Nn5j2E3swV1U5JhmlGSswyq3HOmMacGpsqoZVuNZY-n4nz83y5lBdR3qpp5QREVeW3t_Lqv5oa2sDYvnT2L8zdPxQa4DcYHa5gdrj-keEvVO31UdbTsv0G4yPKr23GpJ3CThZWlnV__mpiTci0pa1uxoFqp_bQtNhYDQIfdiAw7CER03pPr9UKH3_poXIWteBtvanbfI7ZYjY-ZUjzPl8tHn115S9DrlEouSLYh3BhMQkeNBcSEx7YZHsXO2cjJ0nTbLTe0lAh_YMrD6cKlzNwcT4DL285VgO1yR2G7I9-HH4Y4J7gjlzeR1tzwWU-QVtH70-WH0b08UFCsRt395m7Tfi786KfByqj4GPxGO3EXUNyFKz9BN2z1S56FHcQSfTPzS7aHtFLPkWHHRSSHgpJhEIyQCHxUEg6KCQBCs_Qp3cni-NTHLUysKGcbOAfwLnKNNO0hB0oN9JJwy3hxGZKZ9rRkjltLXNWOiMzkZXMM-2nFELeVIEnfo4m1bfKvkAJKS3j1jmhlGDWmlwa4iDOmWeCOkLNHiLdxBQmEsl7PZN10WUMXkK7LfxcFkQUMJd76G3f5SqwqPzuZtbNdhHDwBDeFQCNX3d7-W_d9tHDAe8HaLKpr-0r9MDcbFZN_ToC6DvDHX8R |
| 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=Parallel+dedicated+machine+scheduling+with+conflict+graphs&rft.jtitle=Computers+%26+industrial+engineering&rft.au=Hong%2C+Huai-Che&rft.au=Lin%2C+Bertrand+M.T.&rft.date=2018-10-01&rft.pub=Elsevier+Ltd&rft.issn=0360-8352&rft.eissn=1879-0550&rft.volume=124&rft.spage=316&rft.epage=321&rft_id=info:doi/10.1016%2Fj.cie.2018.07.035&rft.externalDocID=S0360835218303589 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon |