{"id":"https://openalex.org/W2048462504","doi":"https://doi.org/10.1137/080736491","title":"Approximation Algorithms for Scheduling Parallel Jobs","display_name":"Approximation Algorithms for Scheduling Parallel Jobs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2048462504","doi":"https://doi.org/10.1137/080736491","mag":"2048462504"},"language":"en","primary_location":{"id":"doi:10.1137/080736491","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080736491","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/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["kj@informatik.uni-kiel.de and rth@informatik.uni-kiel.de#TAB#"],"affiliations":[{"raw_affiliation_string":"kj@informatik.uni-kiel.de and rth@informatik.uni-kiel.de#TAB#","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084435156","display_name":"Ralf Th\u00f6le","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ralf Th\u00f6le","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071305115"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":null,"apc_paid":null,"fwci":6.5258,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.95904138,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"39","issue":"8","first_page":"3571","last_page":"3615"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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.9995999932289124,"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.9994000196456909,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7352291345596313},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.615759551525116},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.566250205039978},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5656853914260864},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5338636040687561},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4663046598434448},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.45517921447753906},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4532729685306549},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4237595796585083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4076709747314453},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4036933481693268},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28099024295806885}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7352291345596313},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.615759551525116},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.566250205039978},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5656853914260864},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5338636040687561},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4663046598434448},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.45517921447753906},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4532729685306549},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4237595796585083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4076709747314453},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4036933481693268},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28099024295806885},{"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/080736491","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080736491","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":[{"score":0.5799999833106995,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1605529813","https://openalex.org/W1967030015","https://openalex.org/W1975231449","https://openalex.org/W1997959089","https://openalex.org/W1998948241","https://openalex.org/W2017949344","https://openalex.org/W2018125025","https://openalex.org/W2019261717","https://openalex.org/W2045215405","https://openalex.org/W2057913648","https://openalex.org/W2058989830","https://openalex.org/W2059422698","https://openalex.org/W2060963575","https://openalex.org/W2076983765","https://openalex.org/W2116636977","https://openalex.org/W2142033149","https://openalex.org/W2154305205","https://openalex.org/W2155766658","https://openalex.org/W2736018979","https://openalex.org/W3138484722"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2142195909","https://openalex.org/W1966261337","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"In":[0],"this":[1,28,48],"paper":[2],"we":[3,30,107],"study":[4],"variants":[5],"of":[6,17,25,57,78,114],"the":[7,15,23,50,55,61,67,112,118],"nonpreemptive":[8],"parallel":[9],"job":[10],"scheduling":[11],"problem":[12,29,62],"in":[13,22,43,91],"which":[14],"number":[16,24],"machines":[18],"is":[19,49,63],"polynomially":[20],"bounded":[21],"jobs.":[26],"For":[27,66],"show":[31],"that":[32],"a":[33,76,81],"schedule":[34,82],"with":[35,83,101,117],"length":[36,84],"at":[37,85],"most":[38,86],"$(1+\\varepsilon)\\,\\mathrm{OPT}$":[39],"can":[40,88],"be":[41,73,89],"calculated":[42,90],"polynomial":[44,92],"time.":[45,93],"Unless":[46],"$P=NP$,":[47],"best":[51,96],"possible":[52],"result":[53],"(in":[54],"sense":[56],"approximation":[58,103,120],"ratio),":[59],"since":[60],"strongly":[64],"NP-hard.":[65],"case":[68,113],"where":[69],"all":[70],"jobs":[71,116],"must":[72],"allotted":[74],"to":[75,111],"subset":[77],"consecutive":[79],"machines,":[80],"$(1.5+\\varepsilon)\\,\\mathrm{OPT}$":[87],"The":[94],"previously":[95],"known":[97],"results":[98],"are":[99],"algorithms":[100,110],"absolute":[102],"ratio":[104],"2.":[105],"Furthermore,":[106],"extend":[108],"both":[109],"malleable":[115],"same":[119],"ratios.":[121]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}