{"id":"https://openalex.org/W1967030015","doi":"https://doi.org/10.1145/1159892.1159899","title":"An approximation algorithm for scheduling malleable tasks under general precedence constraints","display_name":"An approximation algorithm for scheduling malleable tasks under general precedence constraints","publication_year":2006,"publication_date":"2006-07-01","ids":{"openalex":"https://openalex.org/W1967030015","doi":"https://doi.org/10.1145/1159892.1159899","mag":"1967030015"},"language":"en","primary_location":{"id":"doi:10.1145/1159892.1159899","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1159892.1159899","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/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["University of Kiel, Kiel, Germany",", University of Kiel, Kiel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kiel, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":", University of Kiel, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108046731","display_name":"Hu Zhang","orcid":"https://orcid.org/0000-0003-4178-6401"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hu Zhang","raw_affiliation_strings":["McMaster University, Hamilton, ON, Canada","#N# McMaster University, Hamilton, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"McMaster University, Hamilton, ON, Canada","institution_ids":["https://openalex.org/I98251732"]},{"raw_affiliation_string":"#N# McMaster University, Hamilton, ON, Canada","institution_ids":["https://openalex.org/I98251732"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7999,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.9344966,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"2","issue":"3","first_page":"416","last_page":"434"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9988999962806702,"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.9972000122070312,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7210074663162231},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6672816872596741},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6663309931755066},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5494800806045532},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5378991365432739},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5353636741638184},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5338759422302246},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5075877904891968},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4346107840538025},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27473410964012146}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7210074663162231},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6672816872596741},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6663309931755066},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5494800806045532},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5378991365432739},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5353636741638184},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5338759422302246},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5075877904891968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4346107840538025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27473410964012146},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1159892.1159899","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1159892.1159899","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1546023401","https://openalex.org/W1850405760","https://openalex.org/W1975231449","https://openalex.org/W1985211757","https://openalex.org/W1991452911","https://openalex.org/W1993720874","https://openalex.org/W2018125025","https://openalex.org/W2042017208","https://openalex.org/W2052423850","https://openalex.org/W2057913648","https://openalex.org/W2064757275","https://openalex.org/W2065689629","https://openalex.org/W2081840458","https://openalex.org/W2086190489","https://openalex.org/W2089269509","https://openalex.org/W2113581482","https://openalex.org/W2116636977","https://openalex.org/W2139411793","https://openalex.org/W2150446509","https://openalex.org/W2154305205","https://openalex.org/W2155467293","https://openalex.org/W2401502609","https://openalex.org/W2406029110","https://openalex.org/W3138484722"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W3204654320","https://openalex.org/W2142195909"],"abstract_inverted_index":{"In":[0,40],"this":[1],"article,":[2],"we":[3],"study":[4],"the":[5,26,33,42,49,57,63],"problem":[6],"of":[7,32,35,62],"scheduling":[8],"malleable":[9],"tasks":[10,43],"with":[11,94],"precedence":[12,50],"constraints.":[13,51],"We":[14,88,106],"are":[15],"given":[16],"m":[17],"identical":[18],"processors":[19,36],"and":[20],"n":[21],"tasks.":[22],"For":[23],"each":[24],"task":[25],"processing":[27],"time":[28],"is":[29,54,113],"a":[30,82,95],"function":[31],"number":[34],"allotted":[37],"to":[38,48,55],"it.":[39],"addition,":[41],"must":[44],"be":[45],"processed":[46],"according":[47],"The":[52,66],"goal":[53],"minimize":[56],"makespan":[58],"(maximum":[59],"completion":[60],"time)":[61],"resulting":[64,111],"schedule.":[65],"best":[67],"previous":[68],"approximation":[69,92],"algorithm":[70,93],"(that":[71],"works":[72],"in":[73,76],"two":[74],"phases)":[75],"Lep\u00e8re":[77],"et":[78],"al.":[79],"[2002b]":[80],"has":[81],"ratio":[83,96,112],"3":[84],"+":[85,100],"\u221a5\u2248":[86],"5.236.":[87],"develop":[89],"an":[90],"improved":[91],"at":[97],"most":[98],"100/43":[99],"100(\u221a4349":[101],"\u2212":[102],"7)/2451":[103],"\u2248":[104],"4.730598.":[105],"also":[107],"show":[108],"that":[109],"our":[110],"asymptotically":[114],"tight.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}