{"id":"https://openalex.org/W2116636977","doi":"https://doi.org/10.1007/s00453-003-1078-6","title":"Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme","display_name":"Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme","publication_year":2004,"publication_date":"2004-01-23","ids":{"openalex":"https://openalex.org/W2116636977","doi":"https://doi.org/10.1007/s00453-003-1078-6","mag":"2116636977"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-003-1078-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1078-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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":["Institut f\u00fcr Informatik  und praktische\nMathematik, Christian-Albrechts-Universit\u00e4t zu Kiel, Olshausenstrasse 40, 24098\nKiel, Germany","Institut f\u00fcr Informatik und praktische Mathematik, Christian-Albrechts-Universit\u00e4t zu Kiel, Olshausenstrasse 40, 24098 Kiel, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik  und praktische\nMathematik, Christian-Albrechts-Universit\u00e4t zu Kiel, Olshausenstrasse 40, 24098\nKiel, Germany","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik und praktische Mathematik, Christian-Albrechts-Universit\u00e4t zu Kiel, Olshausenstrasse 40, 24098 Kiel, Germany#TAB#","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071305115"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.2876,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.94736956,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"39","issue":"1","first_page":"59","last_page":"81"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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.9997000098228455,"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.9994999766349792,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991000294685364,"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/theory-of-computation","display_name":"Theory of computation","score":0.7263994812965393},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.689455509185791},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6635543704032898},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5969538688659668},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5851738452911377},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5692765712738037},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48149192333221436},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4723913371562958},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.42559146881103516},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4154953360557556},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36461207270622253},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36001914739608765},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35292887687683105},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27755826711654663}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7263994812965393},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.689455509185791},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6635543704032898},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5969538688659668},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5851738452911377},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5692765712738037},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48149192333221436},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4723913371562958},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42559146881103516},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4154953360557556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36461207270622253},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36001914739608765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35292887687683105},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27755826711654663},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-003-1078-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1078-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W175711003","https://openalex.org/W1492611605","https://openalex.org/W1521979570","https://openalex.org/W1557310162","https://openalex.org/W1985211757","https://openalex.org/W1994736182","https://openalex.org/W1997959089","https://openalex.org/W1998948241","https://openalex.org/W2017949344","https://openalex.org/W2019318803","https://openalex.org/W2025787252","https://openalex.org/W2042017208","https://openalex.org/W2050328660","https://openalex.org/W2057913648","https://openalex.org/W2059422698","https://openalex.org/W2060963575","https://openalex.org/W2086190489","https://openalex.org/W2095381673","https://openalex.org/W2100440346","https://openalex.org/W2101848567","https://openalex.org/W2102201348","https://openalex.org/W2113195911","https://openalex.org/W2123068254","https://openalex.org/W2134422938","https://openalex.org/W2154305205","https://openalex.org/W2895284333","https://openalex.org/W3138484722","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2368250618","https://openalex.org/W2810352541","https://openalex.org/W2970302286","https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2142195909","https://openalex.org/W2048358792","https://openalex.org/W2032550399","https://openalex.org/W2962917430","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}