{"id":"https://openalex.org/W2963781230","doi":"https://doi.org/10.1145/3323165.3323200","title":"Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times","display_name":"Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2963781230","doi":"https://doi.org/10.1145/3323165.3323200","mag":"2963781230"},"language":"en","primary_location":{"id":"doi:10.1145/3323165.3323200","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323200","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1810.01223","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013382916","display_name":"Max A. Deppert","orcid":"https://orcid.org/0000-0003-3083-7998"},"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":"Max A. Deppert","raw_affiliation_strings":["Kiel University, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Kiel University, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","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":["Kiel University, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Kiel University, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013382916"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":null,"apc_paid":null,"fwci":0.2206,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61277192,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"155","last_page":"164"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9961000084877014,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9951000213623047,"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/computer-science","display_name":"Computer science","score":0.685261607170105},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5360608100891113},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.510199785232544},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4464501738548279},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4446413218975067},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4100220203399658},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35884222388267517},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1993274688720703},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06647062301635742}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.685261607170105},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5360608100891113},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.510199785232544},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4464501738548279},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4446413218975067},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4100220203399658},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35884222388267517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1993274688720703},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06647062301635742},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3323165.3323200","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323200","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1810.01223","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1810.01223","pdf_url":"https://arxiv.org/pdf/1810.01223","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1810.01223","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1810.01223","pdf_url":"https://arxiv.org/pdf/1810.01223","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1982427368","https://openalex.org/W1987135795","https://openalex.org/W2010632596","https://openalex.org/W2058817479","https://openalex.org/W2082649910","https://openalex.org/W2093979815","https://openalex.org/W2105390489","https://openalex.org/W2254417378","https://openalex.org/W2525690743","https://openalex.org/W2769189507"],"related_works":["https://openalex.org/W1809394610","https://openalex.org/W2128410848","https://openalex.org/W2014085448","https://openalex.org/W2102390841","https://openalex.org/W2118368532","https://openalex.org/W2096289371","https://openalex.org/W2126232624","https://openalex.org/W2434525066","https://openalex.org/W3140149227","https://openalex.org/W2946406471"],"abstract_inverted_index":{"We":[0,51,94],"investigate":[1],"the":[2,32,49,57,61,70,84,96,100,114,155,166,170,180,201,221],"scheduling":[3],"of":[4,34,105,111,145,169],"n":[5],"jobs":[6,65,74,88],"divided":[7],"into":[8],"c":[9],"classes":[10],"on":[11],"m":[12],"identical":[13],"parallel":[14],"machines.":[15],"For":[16],"every":[17],"class":[18,36],"there":[19],"is":[20,25,42,165,198],"a":[21,28,45,108,143,184],"setup":[22],"time":[23,132,137,160,177,186],"which":[24],"required":[26],"whenever":[27],"machine":[29],"switches":[30],"from":[31],"processing":[33],"one":[35],"to":[37,43,107],"another":[38],"class.":[39],"The":[40,147,172],"objective":[41],"find":[44],"schedule":[46],"that":[47,211],"minimizes":[48],"makespan.":[50],"give":[52],"near-linear":[53],"approximation":[54,103,127,174],"algorithms":[55,149],"for":[56,120,200,220],"following":[58],"problem":[59,203],"variants:":[60],"non-preemptive":[62,156,224],"context":[63,72,86],"where":[64,73,87,163],"may":[66,75,89],"not":[67,79],"be":[68,76,90],"preempted,":[69],"preemptive":[71,115,181,202],"preempted":[77,91],"but":[78,226],"parallelized,":[80],"as":[81,83,140,142],"well":[82,141],"splittable":[85,173,222],"and":[92,223],"parallelized.":[93],"present":[95,125],"first":[97],"algorithm":[98,182],"improving":[99],"previously":[101],"best":[102],"ratio":[104,110,128,134,144],"2":[106,129],"better":[109],"3/2":[112],"in":[113,136,176,232],"case.":[116],"In":[117,154],"more":[118],"detail,":[119],"all":[121],"three":[122],"flavors":[123],"we":[124,158,207],"an":[126,218],"with":[130,227],"running":[131,152,185,229],"O(n),":[133],"3/2+\u03b5":[135],"O(n\u0142og":[138,161],"1/\u03b5)":[139],"3/2.":[146],"(3/2)-approximate":[148],"have":[150],"different":[151],"times.":[153],"case":[157,225],"get":[159],"(n+\u0394))":[162],"\u0394":[164],"largest":[167],"value":[168],"input.":[171],"runs":[175],"O(n+c\u0142og(c+m))":[178],"whereas":[179],"has":[183],"O(n":[187,191],"\u0142og":[188,192],"(c+m))":[189],"\u0142eq":[190],"n).":[193],"So":[194],"far,":[195],"no":[196],"PTAS":[197],"known":[199],"without":[204],"restrictions,":[205],"so":[206],"make":[208],"progress":[209],"towards":[210],"question.":[212],"Recently":[213],"Jansen":[214],"et":[215],"al.":[216],"found":[217],"EPTAS":[219],"impractical":[228],"times":[230],"exponential":[231],"1/\u03b5.":[233]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2019-07-30T00:00:00"}