{"id":"https://openalex.org/W2944073560","doi":"https://doi.org/10.1145/3302250","title":"Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times","display_name":"Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times","publication_year":2019,"publication_date":"2019-05-07","ids":{"openalex":"https://openalex.org/W2944073560","doi":"https://doi.org/10.1145/3302250","mag":"2944073560"},"language":"en","primary_location":{"id":"doi:10.1145/3302250","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3302250","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":true,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Kiel University, Kiel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kiel University, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069850579","display_name":"Marten Maack","orcid":"https://orcid.org/0000-0001-7918-6642"},"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":"Marten Maack","raw_affiliation_strings":["Kiel University, Kiel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kiel University, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057430428","display_name":"Malin Rau","orcid":"https://orcid.org/0000-0002-5710-560X"},"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":"Malin Rau","raw_affiliation_strings":["Kiel University, Kiel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kiel University, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071305115"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":null,"apc_paid":null,"fwci":1.5465,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85812654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":"3","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7517167329788208},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6562421321868896},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.5975815057754517},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5598016977310181},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5153079032897949},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.49973154067993164},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4957157373428345},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4834959805011749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46870917081832886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46133410930633545},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3852967619895935},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33344873785972595},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.3265417218208313}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7517167329788208},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6562421321868896},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.5975815057754517},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5598016977310181},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5153079032897949},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.49973154067993164},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4957157373428345},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4834959805011749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46870917081832886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46133410930633545},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3852967619895935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33344873785972595},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.3265417218208313},{"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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3302250","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3302250","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":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5799999833106995}],"awards":[{"id":"https://openalex.org/G27876216","display_name":null,"funder_award_id":"JA 612 /14-2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1992810489","https://openalex.org/W2004033524","https://openalex.org/W2023486688","https://openalex.org/W2050328660","https://openalex.org/W2053900376","https://openalex.org/W2060963575","https://openalex.org/W2066282512","https://openalex.org/W2068835684","https://openalex.org/W2071605324","https://openalex.org/W2095381673","https://openalex.org/W2101937070","https://openalex.org/W2113195911","https://openalex.org/W2116636977","https://openalex.org/W2123068254","https://openalex.org/W2137152740","https://openalex.org/W2145028977","https://openalex.org/W2154305205","https://openalex.org/W2159846562","https://openalex.org/W2272917567","https://openalex.org/W2738027510","https://openalex.org/W3042390338"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W173368591","https://openalex.org/W2034272113","https://openalex.org/W2138242427","https://openalex.org/W2104955674","https://openalex.org/W4288260564","https://openalex.org/W2068892231","https://openalex.org/W2096053066","https://openalex.org/W2001915926"],"abstract_inverted_index":{"We":[0,144],"consider":[1],"two":[2],"related":[3],"scheduling":[4,8,214],"problems:":[5,155],"single":[6],"resource-constrained":[7,213],"on":[9,37,77,215],"identical":[10,216],"parallel":[11,217],"machines":[12,38,105,123,218],"and":[13,32,65,184,193],"a":[14,25,48,89,101,114,161],"generalization":[15],"with":[16,85,137,203,231],"resource-dependent":[17],"processing":[18,63],"times.":[19],"In":[20,55],"both":[21],"problems,":[22],"jobs":[23],"require":[24],"certain":[26],"amount":[27],"of":[28,59,104,122,126,163,175,224],"an":[29,134,172],"additional":[30],"resource":[31,50,66],"have":[33],"to":[34,198],"be":[35,111],"scheduled":[36],"minimizing":[39],"the":[40,56,60,62,72,74,78,120,127,154,169,185,194,210,221,225],"makespan,":[41],"while":[42,70],"at":[43,165],"every":[44],"point":[45],"in":[46,71,191],"time":[47,149,187],"given":[49],"capacity":[51],"is":[52,124,182,188],"not":[53],"exceeded.":[54],"first":[57],"variant":[58],"problem,":[61],"times":[64,168],"amounts":[67],"are":[68,96],"fixed,":[69],"second":[73],"former":[75],"depends":[76],"latter.":[79],"Both":[80],"problems":[81,95],"contain":[82],"bin":[83,229],"packing":[84,230],"cardinality":[86,232],"constraint":[87,233],"as":[88],"special":[90],"case,":[91],"and,":[92],"therefore,":[93],"these":[94],"strongly":[97],"NP-complete":[98],"even":[99],"for":[100,133,153,212,228],"constant":[102],"number":[103,121],"larger":[106],"than":[107,142],"three,":[108],"which":[109],"can":[110],"proven":[112],"by":[113],"reduction":[115],"from":[116],"3-Partition.":[117],"Furthermore,":[118,209],"if":[119],"part":[125],"input,":[128],"then":[129],"we":[130],"cannot":[131],"hope":[132],"approximation":[135,139,150,201,205],"algorithm":[136],"absolute":[138,204],"ratio":[140],"smaller":[141],"3/2.":[143],"present":[145],"asymptotic":[146],"fully":[147],"polynomial":[148],"schemes":[151],"(AFPTAS)":[152],"For":[156],"any":[157],"\u03b5":[158],">":[159],"0,":[160],"schedule":[162],"length":[164],"most":[166],"(1+\u03b5)":[167],"optimum":[170],"plus":[171],"additive":[173,222],"term":[174,223],"O":[176],"(":[177],"p":[178],"max":[179],"log":[180],"(1/\u03b5)/\u03b5)":[181],"provided,":[183],"running":[186],"polynomially":[189],"bounded":[190],"1/\u03b5":[192],"input":[195],"length.":[196],"Up":[197],"now,":[199],"only":[200],"algorithms":[202],"ratios":[206],"were":[207],"known.":[208],"AFPTAS":[211,227],"directly":[219],"improves":[220],"best":[226],"so":[234],"far.":[235]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}