Performance guarantees for scheduling algorithms under perturbed machine speeds
We study two local search algorithms and a greedy algorithm for scheduling. The worst-case performance guarantees are well-known but seem to be contrived and too pessimistic for practical applications. For unrestricted machines, Brunsch et al. (2013) showed that the worst-case performance guarantees...
Uloženo v:
| Vydáno v: | Discrete Applied Mathematics Ročník 195; s. 84 - 100 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
20.11.2015
|
| Témata: | |
| ISSN: | 0166-218X, 1872-6771 |
| 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 | We study two local search algorithms and a greedy algorithm for scheduling. The worst-case performance guarantees are well-known but seem to be contrived and too pessimistic for practical applications. For unrestricted machines, Brunsch et al. (2013) showed that the worst-case performance guarantees of these algorithms are not robust if the job sizes are subject to random noise. However, in the case of restricted related machines the worst-case bounds turned out to be robust even in the presence of random noise. We show that if the machine speeds rather than the job sizes are perturbed, one obtains smaller bounds for the performance guarantees also for restricted machines thus yielding a stronger result. |
|---|---|
| AbstractList | We study two local search algorithms and a greedy algorithm for scheduling. The worst-case performance guarantees are well-known but seem to be contrived and too pessimistic for practical applications. For unrestricted machines, Brunsch et al. (2013) showed that the worst-case performance guarantees of these algorithms are not robust if the job sizes are subject to random noise. However, in the case of restricted related machines the worst-case bounds turned out to be robust even in the presence of random noise. We show that if the machine speeds rather than the job sizes are perturbed, one obtains smaller bounds for the performance guarantees also for restricted machines thus yielding a stronger result. |
| Author | Etscheid, Michael |
| Author_xml | – sequence: 1 givenname: Michael surname: Etscheid fullname: Etscheid, Michael email: etscheid@cs.uni-bonn.de organization: Department of Computer Science, University of Bonn, Germany |
| BookMark | eNp9kE1LAzEQhoNUsK3-AG_5A7tmsl9ZPElRKxTqQcFbyMdsm9LNlmRX8N-bUs-ehhnmGd55FmTmB4-E3APLgUH9cMit6nPOoMxZlbMSrsgcRMOzumlgRuZpp844iK8bsojxwBiD1M3J9h1DN4ReeYN0N6mg_IgYaZrRaPZop6PzO6qOuyG4cd9HOnmLgZ4wjFPQaGmvzN55pPGEaOMtue7UMeLdX12Sz5fnj9U622xf31ZPm8wU0I5ZC2VhlWKdUaoQjTC6bjkzYHShRFVoW4oUUWuNWGkuWsEboXilTWe1wcoWSwKXuyYMMQbs5Cm4XoUfCUyejciDTEbk2YhklUxGEvN4YTAF-3YYZDQO0-PWBTSjtIP7h_4FNBptdA |
| Cites_doi | 10.1137/0209007 10.1145/1186810.1186814 10.1145/258128.258201 10.1137/0217033 10.1007/BF01585745 10.1142/S0129626406002514 10.1016/j.jcss.2004.04.004 10.1145/990308.990310 10.1287/ijoc.1050.0152 10.1080/01621459.1963.10500830 10.1007/978-3-540-45078-8_23 10.1007/s11390-012-1257-5 |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier B.V. |
| Copyright_xml | – notice: 2014 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.dam.2014.05.041 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1872-6771 |
| EndPage | 100 |
| ExternalDocumentID | 10_1016_j_dam_2014_05_041 S0166218X1400256X |
| GrantInformation_xml | – fundername: ERC grantid: 306465 |
| GroupedDBID | -~X 6I. AAFTH ADEZE AFTJW ALMA_UNASSIGNED_HOLDINGS FDB OAUVE AAYXX AI. CITATION FA8 VH1 WUQ |
| ID | FETCH-LOGICAL-c319t-9143daa0fcaa3878cb6920c1cb3a853bd48000bbbee5b2898278a25bcfdbce5d3 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000362136200009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0166-218X |
| IngestDate | Sat Nov 29 02:59:34 EST 2025 Sat Apr 29 22:45:10 EDT 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Smoothed analysis Local search Scheduling Performance guarantees |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c319t-9143daa0fcaa3878cb6920c1cb3a853bd48000bbbee5b2898278a25bcfdbce5d3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.dam.2014.05.041 |
| PageCount | 17 |
| ParticipantIDs | crossref_primary_10_1016_j_dam_2014_05_041 elsevier_sciencedirect_doi_10_1016_j_dam_2014_05_041 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-11-20 |
| PublicationDateYYYYMMDD | 2015-11-20 |
| PublicationDate_xml | – month: 11 year: 2015 text: 2015-11-20 day: 20 |
| PublicationDecade | 2010 |
| PublicationTitle | Discrete Applied Mathematics |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Hochbaum, Shmoys (br000035) 1988; 17 Cho, Sahni (br000020) 1980; 9 Hoeffding (br000040) 1963; 58 Recalde, Rutten, Schuurman, Vredeveld (br000055) 2010; vol. 6034 Lu, Yu (br000050) 2012; 27 Lenstra, Shmoys, Tardos (br000045) 1990; 46 Brunsch, Röglin, Rutten, Vredeveld (br000015) 2013 Beier, Vöcking (br000010) 2004; 69 Aspnes, Azar, Fiat, Plotkin, Waarts (br000005) 1997; 44 Gairing, Lücking, Mavronicolas, Monien (br000030) 2006; 16 Schuurman, Vredeveld (br000060) 2007; 19 D.A. Spielman, S.-H. Teng, Smoothed analysis: motivation and discrete models, in: WADS 2003, 2003, pp. 256–270. Czumaj, Vöcking (br000025) 2007; 3 Spielman, Teng (br000070) 2004; 51 Spielman (10.1016/j.dam.2014.05.041_br000070) 2004; 51 Hochbaum (10.1016/j.dam.2014.05.041_br000035) 1988; 17 Schuurman (10.1016/j.dam.2014.05.041_br000060) 2007; 19 Hoeffding (10.1016/j.dam.2014.05.041_br000040) 1963; 58 Recalde (10.1016/j.dam.2014.05.041_br000055) 2010; vol. 6034 Aspnes (10.1016/j.dam.2014.05.041_br000005) 1997; 44 Cho (10.1016/j.dam.2014.05.041_br000020) 1980; 9 Czumaj (10.1016/j.dam.2014.05.041_br000025) 2007; 3 Gairing (10.1016/j.dam.2014.05.041_br000030) 2006; 16 10.1016/j.dam.2014.05.041_br000065 Lu (10.1016/j.dam.2014.05.041_br000050) 2012; 27 Brunsch (10.1016/j.dam.2014.05.041_br000015) 2013 Beier (10.1016/j.dam.2014.05.041_br000010) 2004; 69 Lenstra (10.1016/j.dam.2014.05.041_br000045) 1990; 46 |
| References_xml | – volume: 46 start-page: 259 year: 1990 end-page: 271 ident: br000045 article-title: Approximation algorithms for scheduling unrelated parallel machines publication-title: Math. Program. – volume: 27 start-page: 710 year: 2012 end-page: 717 ident: br000050 article-title: Worst-case nash equilibria in restricted routing publication-title: J. Comput. Sci. Tech. – reference: D.A. Spielman, S.-H. Teng, Smoothed analysis: motivation and discrete models, in: WADS 2003, 2003, pp. 256–270. – volume: 69 start-page: 306 year: 2004 end-page: 329 ident: br000010 article-title: Random knapsack in expected polynomial time publication-title: J. Comput. System Sci. – volume: 3 year: 2007 ident: br000025 article-title: Tight bounds for worst-case equilibria publication-title: ACM Trans. Algorithms – volume: 9 start-page: 91 year: 1980 end-page: 103 ident: br000020 article-title: Bounds for list schedules on uniform processors publication-title: SIAM J. Comput. – volume: 17 start-page: 539 year: 1988 end-page: 551 ident: br000035 article-title: A polynomial approximation scheme for machine scheduling on uniform processors: using the dual approximation approach publication-title: SIAM J. Comput. – volume: vol. 6034 start-page: 108 year: 2010 end-page: 119 ident: br000055 article-title: Local search performance guarantees for restricted related parallel machine scheduling publication-title: LATIN 2010: Theoretical Informatics – volume: 51 start-page: 385 year: 2004 end-page: 463 ident: br000070 article-title: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time publication-title: J. ACM – volume: 44 start-page: 486 year: 1997 end-page: 504 ident: br000005 article-title: On-line routing of virtual circuits with applications to load balancing and machine scheduling publication-title: J. ACM – year: 2013 ident: br000015 article-title: Smoothed performance guarantees for local search publication-title: Math. Program. – volume: 19 start-page: 52 year: 2007 end-page: 63 ident: br000060 article-title: Performance guarantees of local search for multiprocessor scheduling publication-title: INFORMS J. Comput. – volume: 16 start-page: 117 year: 2006 end-page: 131 ident: br000030 article-title: The price of anarchy for restricted parallel links publication-title: Parallel Process. Lett. – volume: 58 start-page: 13 year: 1963 end-page: 30 ident: br000040 article-title: Probability inequalities for sums of bounded random variables publication-title: J. Amer. Statist. Assoc. – volume: 9 start-page: 91 year: 1980 ident: 10.1016/j.dam.2014.05.041_br000020 article-title: Bounds for list schedules on uniform processors publication-title: SIAM J. Comput. doi: 10.1137/0209007 – volume: 3 issue: 1 year: 2007 ident: 10.1016/j.dam.2014.05.041_br000025 article-title: Tight bounds for worst-case equilibria publication-title: ACM Trans. Algorithms doi: 10.1145/1186810.1186814 – volume: 44 start-page: 486 issue: 3 year: 1997 ident: 10.1016/j.dam.2014.05.041_br000005 article-title: On-line routing of virtual circuits with applications to load balancing and machine scheduling publication-title: J. ACM doi: 10.1145/258128.258201 – volume: 17 start-page: 539 year: 1988 ident: 10.1016/j.dam.2014.05.041_br000035 article-title: A polynomial approximation scheme for machine scheduling on uniform processors: using the dual approximation approach publication-title: SIAM J. Comput. doi: 10.1137/0217033 – volume: 46 start-page: 259 issue: 1–3 year: 1990 ident: 10.1016/j.dam.2014.05.041_br000045 article-title: Approximation algorithms for scheduling unrelated parallel machines publication-title: Math. Program. doi: 10.1007/BF01585745 – volume: 16 start-page: 117 issue: 1 year: 2006 ident: 10.1016/j.dam.2014.05.041_br000030 article-title: The price of anarchy for restricted parallel links publication-title: Parallel Process. Lett. doi: 10.1142/S0129626406002514 – volume: 69 start-page: 306 issue: 3 year: 2004 ident: 10.1016/j.dam.2014.05.041_br000010 article-title: Random knapsack in expected polynomial time publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2004.04.004 – volume: 51 start-page: 385 issue: 3 year: 2004 ident: 10.1016/j.dam.2014.05.041_br000070 article-title: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time publication-title: J. ACM doi: 10.1145/990308.990310 – volume: 19 start-page: 52 issue: 1 year: 2007 ident: 10.1016/j.dam.2014.05.041_br000060 article-title: Performance guarantees of local search for multiprocessor scheduling publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1050.0152 – year: 2013 ident: 10.1016/j.dam.2014.05.041_br000015 article-title: Smoothed performance guarantees for local search publication-title: Math. Program. – volume: vol. 6034 start-page: 108 year: 2010 ident: 10.1016/j.dam.2014.05.041_br000055 article-title: Local search performance guarantees for restricted related parallel machine scheduling – volume: 58 start-page: 13 issue: 301 year: 1963 ident: 10.1016/j.dam.2014.05.041_br000040 article-title: Probability inequalities for sums of bounded random variables publication-title: J. Amer. Statist. Assoc. doi: 10.1080/01621459.1963.10500830 – ident: 10.1016/j.dam.2014.05.041_br000065 doi: 10.1007/978-3-540-45078-8_23 – volume: 27 start-page: 710 issue: 4 year: 2012 ident: 10.1016/j.dam.2014.05.041_br000050 article-title: Worst-case nash equilibria in restricted routing publication-title: J. Comput. Sci. Tech. doi: 10.1007/s11390-012-1257-5 |
| SSID | ssj0001218 ssj0000186 ssj0006644 |
| Score | 2.0931013 |
| Snippet | We study two local search algorithms and a greedy algorithm for scheduling. The worst-case performance guarantees are well-known but seem to be contrived and... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 84 |
| SubjectTerms | Local search Performance guarantees Scheduling Smoothed analysis |
| Title | Performance guarantees for scheduling algorithms under perturbed machine speeds |
| URI | https://dx.doi.org/10.1016/j.dam.2014.05.041 |
| Volume | 195 |
| WOSCitedRecordID | wos000362136200009&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-6771 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001218 issn: 0166-218X databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1NT9wwELUQcKAH1NJWpbSVD5yKIuXLiX1ELRUglXKg0t4i23HoohJWmxTx83l2nA-2RSoHLlFkKXbiZ808OzNvCNkPZZaKxIhAi0QGqYrzADdlUIIshIkB54iUKzaRn53x2Uyc-yqOjSsnkNc1v7sTi2eFGm0A26bOPgHuoVM04B6g4wrYcf0v4M8nqQCXWAB26oxTXTjAThaexSWgy9-XN8t5--u6cZVwl1a_GN5HgX9eu_hKc9As4NmaKXv9OoeRAcseuOv3QfR1pOatHWVersbk-5OFiNkUuzicHjZmWQAKMHtgLQWb2LuuvJv3nJHTHP3bKHfnA1cYyKb-R6mTSu3krh4KYK84piFcsI9EuyrQRWG7KEJWhFavYCPOmYA12zg8OZqdToTDrCreVn_UNv5ZAsNKvd579239n24X87fyhv_mKhP-cfGSbPuNAz3sAH9F1ky9Q15MAHhNfkygpyP0FG10hJ6O0FMHPR2gpx562kH_hvz8dnTx5TjwBTMCDUvawnGlSSllWGkpE55zrTIRhzrSKpGgZapMsT0IlVLGMIWdNo9zLmOmdFUqbViZvCXr9U1t3hHK8FSFiZN2yxpnipcVzxMmTMxlVlXRLvncT02x6HRRikdh2iVpP3mFJ3YdYSuwRB5_7P1TxtgjW-Ma_kDW2-Uf85Fs6tt23iw_-fVxD1YpbaU |
| 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=Performance+guarantees+for+scheduling+algorithms+under+perturbed+machine+speeds&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Etscheid%2C+Michael&rft.date=2015-11-20&rft.issn=0166-218X&rft.volume=195&rft.spage=84&rft.epage=100&rft_id=info:doi/10.1016%2Fj.dam.2014.05.041&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_dam_2014_05_041 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon |