{"id":"https://openalex.org/W2068946514","doi":"https://doi.org/10.1137/s0097539799361737","title":"General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time","display_name":"General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2068946514","doi":"https://doi.org/10.1137/s0097539799361737","mag":"2068946514"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539799361737","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799361737","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["IDSIA Lugano, Lugano, Switzerland#TAB#"],"affiliations":[{"raw_affiliation_string":"IDSIA Lugano, Lugano, Switzerland#TAB#","institution_ids":["https://openalex.org/I2614128279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033762785","display_name":"Lorant Porkolab","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lorant Porkolab","raw_affiliation_strings":["Max-Planck Institut F\u00fcr Informatik, Saarbr\u00fccken, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Max-Planck Institut F\u00fcr Informatik, Saarbr\u00fccken, Germany#TAB#","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071305115"],"corresponding_institution_ids":["https://openalex.org/I2614128279"],"apc_list":null,"apc_paid":null,"fwci":0.5191,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.72172114,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"35","issue":"3","first_page":"519","last_page":"530"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.998199999332428,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9980000257492065,"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/time-complexity","display_name":"Time complexity","score":0.6735658645629883},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5186649560928345},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5134488344192505},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4966784119606018},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4736814796924591},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4670606553554535},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4538804292678833},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43590739369392395},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4249863624572754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42001450061798096},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.41308289766311646},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39309102296829224},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33691567182540894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32197508215904236},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26179268956184387}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6735658645629883},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5186649560928345},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5134488344192505},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4966784119606018},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4736814796924591},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4670606553554535},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4538804292678833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43590739369392395},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4249863624572754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42001450061798096},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.41308289766311646},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39309102296829224},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33691567182540894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32197508215904236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26179268956184387},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539799361737","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799361737","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1487188659","https://openalex.org/W1912586891","https://openalex.org/W1966275651","https://openalex.org/W1993982015","https://openalex.org/W1998948241","https://openalex.org/W2038534673","https://openalex.org/W2042017208","https://openalex.org/W2057913648","https://openalex.org/W2060963575","https://openalex.org/W2066883826","https://openalex.org/W2073624403","https://openalex.org/W2089063368","https://openalex.org/W2101848567","https://openalex.org/W2106177605","https://openalex.org/W2134422938","https://openalex.org/W2135507920","https://openalex.org/W2142033149","https://openalex.org/W2170538936","https://openalex.org/W2736018979","https://openalex.org/W3138484722","https://openalex.org/W4246574007"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2962917430","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W1589381382","https://openalex.org/W4299801389","https://openalex.org/W2028468530","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0,68],"study":[1],"the":[2,17,27,33,63,71,75,102,114],"problem":[3],"of":[4,12,20,26,29,57,74,92,101,113],"scheduling":[5],"n":[6],"independent":[7],"tasks":[8],"on":[9],"a":[10,21,24,41,54,83,110],"set":[11],"m":[13,82],"parallel":[14],"processors,":[15],"where":[16],"execution":[18],"time":[19],"task":[22],"is":[23],"function":[25],"subset":[28],"processors":[30],"assigned":[31],"to":[32],"task.":[34],"For":[35],"any":[36,48,80,93],"fixed":[37,49,81,94],"m,":[38],"we":[39],"propose":[40],"fully":[42],"polynomial":[43,84,118],"approximation":[44,85],"scheme":[45,86],"that":[46,87],"for":[47,79],"$\\epsilon":[50],">":[51],"0$":[52],"finds":[53],"preemptive":[55],"schedule":[56],"length":[58],"at":[59],"most":[60],"$(1+\\epsilon)$":[61],"times":[62],"optimum":[64],"in":[65,96],"$O(n)$":[66],"time.":[67,98],"also":[69],"discuss":[70],"nonpreemptive":[72],"variant":[73],"problem,":[76],"and":[77,122],"present":[78],"computes":[88],"an":[89],"approximate":[90],"solution":[91],"accuracy":[95],"linear":[97,106],"In":[99],"terms":[100],"running":[103],"time,":[104],"this":[105],"complexity":[107],"bound":[108,119],"gives":[109],"substantial":[111],"improvement":[112],"best":[115],"previously":[116],"known":[117],"[J.":[120],"Chen":[121],"A.":[123],"Miranda,":[124],"SIAM":[125],"J.":[126],"Comput.,":[127],"31":[128],"(2001),":[129],"pp.":[130],"1--17].":[131]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}