Approximation schemes for two-agent scheduling on parallel machines
Two models of two-agent scheduling problem on identical machines are considered in this paper. In both models, the goal is to minimize the makespan and the total completion time of agent A respectively, subject to an upper bound on the makespan of agent B. We prove that these two problems are NP-har...
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 468; s. 114 - 121 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
14.01.2013
|
| Témata: | |
| ISSN: | 0304-3975, 1879-2294 |
| 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 | Two models of two-agent scheduling problem on identical machines are considered in this paper. In both models, the goal is to minimize the makespan and the total completion time of agent A respectively, subject to an upper bound on the makespan of agent B. We prove that these two problems are NP-hard and can be solved in pseudo-polynomial time. Furthermore, we design the fully polynomial time approximation schemes for both problems, respectively. |
|---|---|
| AbstractList | Two models of two-agent scheduling problem on identical machines are considered in this paper. In both models, the goal is to minimize the makespan and the total completion time of agent A respectively, subject to an upper bound on the makespan of agent B. We prove that these two problems are NP-hard and can be solved in pseudo-polynomial time. Furthermore, we design the fully polynomial time approximation schemes for both problems, respectively. |
| Author | Zhao, Kejun Lu, Xiwen |
| Author_xml | – sequence: 1 givenname: Kejun surname: Zhao fullname: Zhao, Kejun – sequence: 2 givenname: Xiwen surname: Lu fullname: Lu, Xiwen email: xwlu@ecust.edu.cn |
| BookMark | eNp9kMtqwzAQRUVJoUnaD-jOP2BXI9lWRFch9AWBbtq1kKVRouDYRlJff18n6aqLzGZgmDPMPTMy6foOCbkFWgCF-m5XJBMLRoEVAAWl7IJMYSFkzpgsJ2RKOS1zLkV1RWYx7uhYlainZLUchtB_-71Ovu-yaLa4x5i5PmTpq8_1Brt0nNqP1nebbNwZdNBti22212brO4zX5NLpNuLNX5-T98eHt9Vzvn59elkt17lhUqQcOa-ckKwG6WpZWU2ZKbmj0nFo3GJRCmR1LTVvoCmb0oLlFdM15aKy2NCGzwmc7prQxxjQqSGMj4cfBVQdLKidGi2ogwUFoEYLIyP-McanY9YUtG_PkvcnEsdInx6DisZjZ9D6gCYp2_sz9C-123mv |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2015_06_051 crossref_primary_10_1016_j_ejor_2017_01_010 crossref_primary_10_1016_j_ejor_2016_10_024 crossref_primary_10_1016_j_cie_2014_11_024 crossref_primary_10_1016_j_eswa_2021_116180 crossref_primary_10_1007_s11766_015_3076_2 crossref_primary_10_1016_j_apm_2013_01_050 crossref_primary_10_1016_j_ijpe_2014_05_004 crossref_primary_10_1007_s12652_018_0741_3 crossref_primary_10_1007_s00500_015_1900_5 crossref_primary_10_1016_j_tcs_2017_09_004 crossref_primary_10_1007_s10951_024_00812_1 crossref_primary_10_1007_s11590_018_1298_y crossref_primary_10_1016_j_cor_2019_06_004 crossref_primary_10_1080_00207543_2021_1923854 crossref_primary_10_1007_s10586_016_0557_x crossref_primary_10_1016_j_cie_2015_01_002 crossref_primary_10_1155_2013_805261 crossref_primary_10_1016_j_asoc_2016_12_041 crossref_primary_10_1016_j_ijpe_2015_06_018 crossref_primary_10_1007_s10878_014_9744_y crossref_primary_10_1155_2014_471016 crossref_primary_10_1007_s10288_017_0341_7 |
| Cites_doi | 10.1016/j.ejor.2008.10.038 10.1007/s10951-010-0201-1 10.1023/A:1022231419049 10.1007/s10479-006-0164-y 10.1007/s10878-006-9001-0 10.1016/S0167-5060(08)70356-X 10.1007/s10951-008-0098-0 10.1016/j.tcs.2006.07.011 10.1016/j.ipl.2009.04.018 10.1287/opre.1090.0744 10.1287/opre.1030.0092 10.1016/j.ejor.2007.04.040 |
| ContentType | Journal Article |
| Copyright | 2012 Elsevier B.V. |
| Copyright_xml | – notice: 2012 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.tcs.2012.11.002 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 121 |
| ExternalDocumentID | 10_1016_j_tcs_2012_11_002 S0304397512010031 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c297t-e335f792619f695da02c43f09f31bf8847e2669a3b1b4b4d1d352a60375deb0b3 |
| ISICitedReferencesCount | 28 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000313917200011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 05:15:12 EST 2025 Tue Nov 18 20:45:15 EST 2025 Fri Feb 23 02:30:24 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Parallel machines Fully polynomial time approximation scheme Dynamic programming Algorithm Agent scheduling |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-e335f792619f695da02c43f09f31bf8847e2669a3b1b4b4d1d352a60375deb0b3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2012.11.002 |
| PageCount | 8 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2012_11_002 crossref_citationtrail_10_1016_j_tcs_2012_11_002 elsevier_sciencedirect_doi_10_1016_j_tcs_2012_11_002 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-01-14 |
| PublicationDateYYYYMMDD | 2013-01-14 |
| PublicationDate_xml | – month: 01 year: 2013 text: 2013-01-14 day: 14 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2013 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Balasubramanian, Fowler, Keha, Pfund (br000050) 2009; 199 Lee, Choi, Leung, Pinedo (br000045) 2009; 109 Baker, Smith (br000010) 2003; 6 Graham, Lawler, Lenstra, Rinnooy Kan (br000015) 1979; 5 Agnetis, Pascale, Pacciarelli (br000025) 2009; 12 Agnetis, Pacciarelli, Pacifici (br000020) 2007; 150 Elvikis, Hamacher, T’kindt (br000060) 2010; 14 W. Luo, L. Chen, G. Zhang, Approximation schemes for two-machine flow shop scheduling with two agents, Journal of Combinatorial Optimization, published online. Ng, Cheng, Yuan (br000030) 2006; 12 Leung, Pinedo, Wan (br000055) 2010; 58 Cheng, Ng, Yuan (br000040) 2008; 188 Cheng, Ng, Yuan (br000035) 2006; 362 Agnetis, Mirchandani, Pacciarelli, Pacifici (br000005) 2004; 52 Graham (10.1016/j.tcs.2012.11.002_br000015) 1979; 5 Leung (10.1016/j.tcs.2012.11.002_br000055) 2010; 58 Agnetis (10.1016/j.tcs.2012.11.002_br000025) 2009; 12 Agnetis (10.1016/j.tcs.2012.11.002_br000005) 2004; 52 10.1016/j.tcs.2012.11.002_br000065 Ng (10.1016/j.tcs.2012.11.002_br000030) 2006; 12 Agnetis (10.1016/j.tcs.2012.11.002_br000020) 2007; 150 Lee (10.1016/j.tcs.2012.11.002_br000045) 2009; 109 Cheng (10.1016/j.tcs.2012.11.002_br000035) 2006; 362 Balasubramanian (10.1016/j.tcs.2012.11.002_br000050) 2009; 199 Elvikis (10.1016/j.tcs.2012.11.002_br000060) 2010; 14 Baker (10.1016/j.tcs.2012.11.002_br000010) 2003; 6 Cheng (10.1016/j.tcs.2012.11.002_br000040) 2008; 188 |
| References_xml | – volume: 12 start-page: 387 year: 2006 end-page: 394 ident: br000030 article-title: A note on the complexity of the problem of two-agent scheduling on a single machine publication-title: Journal of Combinatorial Optimization – volume: 14 start-page: 471 year: 2010 end-page: 481 ident: br000060 article-title: Scheduling two agents on uniform parallel machines with makespan and cost functions publication-title: Journal of Scheduling – volume: 12 start-page: 401 year: 2009 end-page: 415 ident: br000025 article-title: A Lagrangian approach to single-machine scheduling problems with two competing agents publication-title: Journal of Scheduling – volume: 6 start-page: 7 year: 2003 end-page: 16 ident: br000010 article-title: A multiple-criterion model for machine scheduling publication-title: Journal of Scheduling – volume: 362 start-page: 273 year: 2006 end-page: 281 ident: br000035 article-title: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs publication-title: Theoretical Computer Science – volume: 150 start-page: 3 year: 2007 end-page: 15 ident: br000020 article-title: Multi-agent single machine scheduling publication-title: Annals of Operations Research – volume: 52 start-page: 229 year: 2004 end-page: 242 ident: br000005 article-title: Scheduling problem with two competing agents publication-title: Operations Research – volume: 109 start-page: 913 year: 2009 end-page: 917 ident: br000045 article-title: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time publication-title: Information Processing Letters – volume: 58 start-page: 458 year: 2010 end-page: 469 ident: br000055 article-title: Competitive two-agent scheduling and its Applications publication-title: Operations Research – volume: 199 start-page: 55 year: 2009 end-page: 67 ident: br000050 article-title: Scheduling interfering job sets on parallel machines publication-title: European Journal of Operational Research – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: br000015 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Annals of Discrete Mathematics – volume: 188 start-page: 603 year: 2008 end-page: 609 ident: br000040 article-title: Multi-agent scheduling on a single machine with max-form criteria publication-title: European Journal of Operational Research – reference: W. Luo, L. Chen, G. Zhang, Approximation schemes for two-machine flow shop scheduling with two agents, Journal of Combinatorial Optimization, published online. – volume: 199 start-page: 55 year: 2009 ident: 10.1016/j.tcs.2012.11.002_br000050 article-title: Scheduling interfering job sets on parallel machines publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.10.038 – volume: 14 start-page: 471 year: 2010 ident: 10.1016/j.tcs.2012.11.002_br000060 article-title: Scheduling two agents on uniform parallel machines with makespan and cost functions publication-title: Journal of Scheduling doi: 10.1007/s10951-010-0201-1 – ident: 10.1016/j.tcs.2012.11.002_br000065 – volume: 6 start-page: 7 year: 2003 ident: 10.1016/j.tcs.2012.11.002_br000010 article-title: A multiple-criterion model for machine scheduling publication-title: Journal of Scheduling doi: 10.1023/A:1022231419049 – volume: 150 start-page: 3 year: 2007 ident: 10.1016/j.tcs.2012.11.002_br000020 article-title: Multi-agent single machine scheduling publication-title: Annals of Operations Research doi: 10.1007/s10479-006-0164-y – volume: 12 start-page: 387 year: 2006 ident: 10.1016/j.tcs.2012.11.002_br000030 article-title: A note on the complexity of the problem of two-agent scheduling on a single machine publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-006-9001-0 – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.tcs.2012.11.002_br000015 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70356-X – volume: 12 start-page: 401 year: 2009 ident: 10.1016/j.tcs.2012.11.002_br000025 article-title: A Lagrangian approach to single-machine scheduling problems with two competing agents publication-title: Journal of Scheduling doi: 10.1007/s10951-008-0098-0 – volume: 362 start-page: 273 year: 2006 ident: 10.1016/j.tcs.2012.11.002_br000035 article-title: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2006.07.011 – volume: 109 start-page: 913 year: 2009 ident: 10.1016/j.tcs.2012.11.002_br000045 article-title: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time publication-title: Information Processing Letters doi: 10.1016/j.ipl.2009.04.018 – volume: 58 start-page: 458 year: 2010 ident: 10.1016/j.tcs.2012.11.002_br000055 article-title: Competitive two-agent scheduling and its Applications publication-title: Operations Research doi: 10.1287/opre.1090.0744 – volume: 52 start-page: 229 year: 2004 ident: 10.1016/j.tcs.2012.11.002_br000005 article-title: Scheduling problem with two competing agents publication-title: Operations Research doi: 10.1287/opre.1030.0092 – volume: 188 start-page: 603 year: 2008 ident: 10.1016/j.tcs.2012.11.002_br000040 article-title: Multi-agent scheduling on a single machine with max-form criteria publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.04.040 |
| SSID | ssj0000576 |
| Score | 2.1903718 |
| Snippet | Two models of two-agent scheduling problem on identical machines are considered in this paper. In both models, the goal is to minimize the makespan and the... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 114 |
| SubjectTerms | Agent scheduling Algorithm Dynamic programming Fully polynomial time approximation scheme Parallel machines |
| Title | Approximation schemes for two-agent scheduling on parallel machines |
| URI | https://dx.doi.org/10.1016/j.tcs.2012.11.002 |
| Volume | 468 |
| WOSCitedRecordID | wos000313917200011&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-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLfQxgEO2xgg9ikfOFF5ihOnro9V1WmgMXEYUm9R7NhSq5FO_WD98_debCdjMMQOXKLKctw0v9fn9_w-foR8lE5g8Iiz3GaOidRaps0gZ4kzzpSq1KpqWuZfyqurwWSivgWWvmVDJyDrerDZqNv_CjWMAdhYOvsMuNtFYQA-A-hwBdjh-k_AD7FL-GbqSxJ74Lxa7MfUZBPezVmJpVTNaLVuKtHn2Ft1gYwqN70fTWZlyCqctXLUVjqaQAHRC_vmg1PnuS_yma27FJ81Dk2md6HYLBwtIM0DZ76kM5ZUYdhEeWqTqC6Fp8EJCo-H-X7v5L7a-Te17E8IZmcrgx3SeXqGjVOTtNuDYtz90dbUJgzGXLRZAUsUuAS4LkXTRXQ7lbkCfbY9_DyefOl24Vz6OHX4CTGi3eT2PXqOP9skD-yM6z2yExwEOvTAviEvbL1PdiP5Bg26eJ-8_to23F2-JaNfUKcBdQqo0xZ12qFOYU5EnUbU35Hv5-Pr0QUL_BjMpEqumM2y3EmFPrDrq7wqk9SIzCXKZVy7AdgdFswvVWaaa6FFxSuwtss-sh5XVic6e0-26nltPxAqjNNcwhzTt6LqJ6VLNfrS8L8qnbT2gCTxDRUmNI9HDpOb4klkDsin9pZb3znlb5NFfO1FEGFv0hUgQk_fdvic7zgirzohPyZbq8XanpCX5udqulycBvm5B5O5ej4 |
| 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=Approximation+schemes+for+two-agent+scheduling+on+parallel+machines&rft.jtitle=Theoretical+computer+science&rft.au=Zhao%2C+Kejun&rft.au=Lu%2C+Xiwen&rft.date=2013-01-14&rft.issn=0304-3975&rft.volume=468&rft.spage=114&rft.epage=121&rft_id=info:doi/10.1016%2Fj.tcs.2012.11.002&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2012_11_002 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |