{"id":"https://openalex.org/W2044030708","doi":"https://doi.org/10.1145/2629652","title":"On the Performance of Smith\u2019s Rule in Single-Machine Scheduling with Nonlinear Cost","display_name":"On the Performance of Smith\u2019s Rule in Single-Machine Scheduling with Nonlinear Cost","publication_year":2015,"publication_date":"2015-04-13","ids":{"openalex":"https://openalex.org/W2044030708","doi":"https://doi.org/10.1145/2629652","mag":"2044030708"},"language":"en","primary_location":{"id":"doi:10.1145/2629652","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629652","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075873875","display_name":"Wiebke H\u00f6hn","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Wiebke H\u00f6hn","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084704118","display_name":"Tobias Jacobs","orcid":"https://orcid.org/0000-0002-9165-1161"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tobias Jacobs","raw_affiliation_strings":["NEC Laboratories Europe, Heidelberg Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories Europe, Heidelberg Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075873875"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":5.7579,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.95367758,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"11","issue":"4","first_page":"1","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6947855949401855},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5561248660087585},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5550569891929626},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5331342220306396},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.5322532653808594},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.49951648712158203},{"id":"https://openalex.org/keywords/concave-function","display_name":"Concave function","score":0.4878718852996826},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.46144407987594604},{"id":"https://openalex.org/keywords/univariate","display_name":"Univariate","score":0.4613795876502991},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44738343358039856},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.44631490111351013},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4277692437171936},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.42458462715148926},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4212539792060852},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4001311659812927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.361392080783844},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.2942999303340912},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26460179686546326},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09495809674263}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6947855949401855},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5561248660087585},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5550569891929626},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5331342220306396},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.5322532653808594},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49951648712158203},{"id":"https://openalex.org/C66690126","wikidata":"https://www.wikidata.org/wiki/Q2914302","display_name":"Concave function","level":3,"score":0.4878718852996826},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.46144407987594604},{"id":"https://openalex.org/C199163554","wikidata":"https://www.wikidata.org/wiki/Q1681619","display_name":"Univariate","level":3,"score":0.4613795876502991},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44738343358039856},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.44631490111351013},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4277692437171936},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42458462715148926},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4212539792060852},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4001311659812927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.361392080783844},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2942999303340912},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26460179686546326},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09495809674263},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C161584116","wikidata":"https://www.wikidata.org/wiki/Q1952580","display_name":"Multivariate statistics","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2629652","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629652","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W40309320","https://openalex.org/W41049630","https://openalex.org/W1485083952","https://openalex.org/W1488422606","https://openalex.org/W1506891428","https://openalex.org/W1532443211","https://openalex.org/W1544352564","https://openalex.org/W1547437929","https://openalex.org/W1797844995","https://openalex.org/W1817173252","https://openalex.org/W1903284337","https://openalex.org/W1909205607","https://openalex.org/W1933011002","https://openalex.org/W1972337144","https://openalex.org/W1972868674","https://openalex.org/W1980453217","https://openalex.org/W1988328380","https://openalex.org/W1999205531","https://openalex.org/W2013003733","https://openalex.org/W2013881859","https://openalex.org/W2020082371","https://openalex.org/W2030979297","https://openalex.org/W2042312329","https://openalex.org/W2058501782","https://openalex.org/W2069466073","https://openalex.org/W2077390257","https://openalex.org/W2079538592","https://openalex.org/W2084814858","https://openalex.org/W2085799750","https://openalex.org/W2086050071","https://openalex.org/W2087411299","https://openalex.org/W2096825534","https://openalex.org/W2106121057","https://openalex.org/W2123948245","https://openalex.org/W2133663637","https://openalex.org/W2136806145","https://openalex.org/W2159036178","https://openalex.org/W2166867051","https://openalex.org/W2171261418","https://openalex.org/W2258448061","https://openalex.org/W2370703266","https://openalex.org/W2400295466","https://openalex.org/W2743045177","https://openalex.org/W2995414748"],"related_works":["https://openalex.org/W1794849345","https://openalex.org/W4306754731","https://openalex.org/W1909205607","https://openalex.org/W2617159737","https://openalex.org/W3107920931","https://openalex.org/W4297903463","https://openalex.org/W2909546413","https://openalex.org/W2951835737","https://openalex.org/W996039869","https://openalex.org/W2275123575"],"abstract_inverted_index":{"We":[0,54,149],"consider":[1],"a":[2,16,47,73,105,110,146],"single-machine":[3],"scheduling":[4,46],"problem.":[5],"Given":[6],"some":[7],"continuous,":[8],"nondecreasing":[9],"cost":[10,25,33,60,88,97,126,175],"function,":[11],"we":[12,99,182],"aim":[13],"to":[14,45,109,158],"compute":[15],"schedule":[17],"minimizing":[18],"the":[19,24,32,77,101,135,143,171,174,188,198],"weighted":[20],"total":[21,201],"cost,":[22],"where":[23],"of":[26,69,76,80,96,103,145,173,190],"each":[27],"job":[28],"is":[29,42,63,72,155],"determined":[30],"by":[31,118,169,197],"function":[34],"value":[35],"at":[36],"its":[37],"completion":[38],"time.":[39,203],"This":[40],"problem":[41,107],"closely":[43],"related":[44],"single":[48],"machine":[49],"with":[50,128],"nonuniform":[51],"processing":[52,192,202],"speed.":[53],"show":[55,150],"that":[56,134,151,194],"for":[57,92,187],"piecewise":[58],"linear":[59],"functions":[61,98,127],"it":[62,131],"strongly":[64],"NP-hard.":[65],"The":[66],"main":[67],"contribution":[68],"this":[70,152],"article":[71],"tight":[74,136,185],"analysis":[75],"approximation":[78,137,153],"guarantee":[79],"Smith\u2019s":[81],"rule":[82],"under":[83],"any":[84],"convex":[85],"or":[86,121],"concave":[87],"function.":[89,176],"More":[90],"specifically,":[91],"these":[93],"wide":[94],"classes":[95],"reduce":[100],"task":[102],"determining":[104],"worst-case":[106,180],"instance":[108],"continuous":[111],"optimization":[112],"problem,":[113],"which":[114],"can":[115,139],"be":[116,140],"solved":[117],"standard":[119],"algebraic":[120],"numerical":[122],"methods.":[123],"For":[124],"polynomial":[125],"positive":[129],"coefficients,":[130],"turns":[132],"out":[133],"ratio":[138,154],"calculated":[141],"as":[142],"root":[144],"univariate":[147],"polynomial.":[148],"asymptotically":[156],"equal":[157],"k":[159,161,164,170],"(":[160],"\u2212":[162],"1)/(":[163],"+":[165],"1)":[166],",":[167],"denoting":[168],"degree":[172],"To":[177],"overcome":[178],"unrealistic":[179],"instances,":[181],"also":[183],"give":[184],"bounds":[186],"case":[189],"integral":[191],"times":[193],"are":[195],"parameterized":[196],"maximum":[199],"and":[200]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}
