{"id":"https://openalex.org/W2811361556","doi":"https://doi.org/10.1142/s0129054118410071","title":"A PTAS for Scheduling Unrelated Machines of Few Different Types","display_name":"A PTAS for Scheduling Unrelated Machines of Few Different Types","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2811361556","doi":"https://doi.org/10.1142/s0129054118410071","mag":"2811361556"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054118410071","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118410071","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5053215379","display_name":"Jan Clemens Gehrke","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jan Clemens Gehrke","raw_affiliation_strings":["E-mail Address: [email\u00a0protected]"],"affiliations":[{"raw_affiliation_string":"E-mail Address: [email\u00a0protected]","institution_ids":[]}]},{"author_position":"middle","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":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Algorithms and Complexity, Department of Computer Science, University of Kiel, 24098 Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, Department of Computer Science, University of Kiel, 24098 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058444516","display_name":"Stefan Erich Julius Kraft","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefan E. J. Kraft","raw_affiliation_strings":["TNG Technology Consulting GmbH, Betastra\u00dfe 13a, 85774 Unterf\u00f6hring, Germany"],"affiliations":[{"raw_affiliation_string":"TNG Technology Consulting GmbH, Betastra\u00dfe 13a, 85774 Unterf\u00f6hring, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070181053","display_name":"Jakob Schikowski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jakob Schikowski","raw_affiliation_strings":["E-mail Address: [email\u00a0protected]"],"affiliations":[{"raw_affiliation_string":"E-mail Address: [email\u00a0protected]","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5053215379"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2317,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.83523371,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"29","issue":"04","first_page":"591","last_page":"621"},"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.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/T12176","display_name":"Optimization and Packing Problems","score":0.9929999709129333,"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.6100245118141174},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5725353360176086},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5677121877670288},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5147528648376465},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4791688024997711},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4526507556438446},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.41347044706344604},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.40229809284210205},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40045464038848877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3650301694869995},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35545843839645386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3239040970802307},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15957939624786377}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6100245118141174},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5725353360176086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5677121877670288},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5147528648376465},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4791688024997711},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4526507556438446},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.41347044706344604},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.40229809284210205},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40045464038848877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3650301694869995},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35545843839645386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3239040970802307},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15957939624786377},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054118410071","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118410071","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5400000214576721,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1992734168","https://openalex.org/W2000619341","https://openalex.org/W2000850616","https://openalex.org/W2011039300","https://openalex.org/W2014071862","https://openalex.org/W2014369282","https://openalex.org/W2016342875","https://openalex.org/W2040681643","https://openalex.org/W2052586468","https://openalex.org/W2068718151","https://openalex.org/W2074254606","https://openalex.org/W2093979815","https://openalex.org/W2102201348","https://openalex.org/W2125421235","https://openalex.org/W2130631363","https://openalex.org/W2135932424","https://openalex.org/W2142033149"],"related_works":["https://openalex.org/W2368250618","https://openalex.org/W2970302286","https://openalex.org/W1759995226","https://openalex.org/W2558361976","https://openalex.org/W2048358792","https://openalex.org/W1972853793","https://openalex.org/W2399100966","https://openalex.org/W1903284337","https://openalex.org/W2049084621","https://openalex.org/W2009846993"],"abstract_inverted_index":{"Scheduling":[0],"on":[1,31],"Unrelated":[2],"Machines":[3],"is":[4,44,83,142],"a":[5,36,68,73,94],"classical":[6],"optimization":[7],"problem":[8,63],"where":[9,133],"[Formula:":[10,19,27,33,39,59,77,103,110,117,121,127,136,156,160,172],"see":[11,20,28,34,40,60,78,104,111,118,122,128,137,157,161,173],"text]":[12,21,29,35,105,112,119,123,138,158],"jobs":[13,26,126],"have":[14],"to":[15,18,45],"be":[16],"distributed":[17],"machines.":[22],"Each":[23],"of":[24,54,89,101,113,139,153],"the":[25,47,50,55,90,102,108,114,131,134],"has":[30],"machine":[32,106,140],"processing":[37],"time":[38,53,167],"text].":[41,79,129,174],"The":[42],"goal":[43],"minimize":[46],"makespan,":[48],"i.e.,":[49,150],"maximum":[51],"completion":[52],"longest-running":[56],"machine.":[57],"Unless":[58],"text],":[61,162],"this":[62,144],"does":[64],"not":[65],"allow":[66],"for":[67,99,124,159],"polynomial-time":[69],"approximation":[70,148,154],"algorithm":[71,152],"with":[72,163],"ratio":[74,155],"better":[75],"than":[76],"A":[80],"natural":[81],"scenario":[82],"however":[84],"that":[85],"many":[86],"machines":[87,109],"are":[88],"same":[91,115],"type,":[92],"like":[93],"CPU":[95],"and":[96],"GPU":[97],"cluster:":[98],"each":[100],"types,":[107],"type":[116],"satisfy":[120],"all":[125],"For":[130],"case":[132],"number":[135],"types":[141],"constant,":[143],"paper":[145],"presents":[146],"an":[147,151,164],"scheme,":[149],"improved":[165],"running":[166],"only":[168],"single":[169],"exponential":[170],"in":[171]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}