{"id":"https://openalex.org/W2951591595","doi":"https://doi.org/10.1145/3323165.3323173","title":"Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement)","display_name":"Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement)","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2951591595","doi":"https://doi.org/10.1145/3323165.3323173","mag":"2951591595"},"language":"en","primary_location":{"id":"doi:10.1145/3323165.3323173","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3323165.3323173","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3323165.3323173","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":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3323165.3323173","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005114302","display_name":"Lin Chen","orcid":"https://orcid.org/0000-0003-3909-4916"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lin Chen","raw_affiliation_strings":["University of Houston, Houston, TX, USA"],"affiliations":[{"raw_affiliation_string":"University of Houston, Houston, TX, USA","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085884127","display_name":"Minming Li","orcid":"https://orcid.org/0000-0002-7370-6237"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Minming Li","raw_affiliation_strings":["City University of Hong Kong, Hong Kong SAR, China"],"affiliations":[{"raw_affiliation_string":"City University of Hong Kong, Hong Kong SAR, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089344475","display_name":"Guohui Lin","orcid":"https://orcid.org/0000-0003-4283-3396"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Guohui Lin","raw_affiliation_strings":["University of Alberta, Edmonton, AB, Canada"],"affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100437036","display_name":"Kai Wang","orcid":"https://orcid.org/0000-0002-6170-4744"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Kai Wang","raw_affiliation_strings":["City University of Hong Kong & HHL Leipzig Graduate School of Management, Hong Kong SAR , China"],"affiliations":[{"raw_affiliation_string":"City University of Hong Kong & HHL Leipzig Graduate School of Management, Hong Kong SAR , China","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5005114302"],"corresponding_institution_ids":["https://openalex.org/I44461941"],"apc_list":null,"apc_paid":null,"fwci":0.9286,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77454101,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"237","last_page":"239"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/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/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/computer-science","display_name":"Computer science","score":0.7243505716323853},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6977992057800293},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5646054148674011},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5620427131652832},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5471575856208801},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.540093719959259},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5198186635971069},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4996659755706787},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4663039743900299},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3395206928253174},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3211207985877991},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21005454659461975},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07057592272758484},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06465837359428406}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7243505716323853},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6977992057800293},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5646054148674011},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5620427131652832},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5471575856208801},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.540093719959259},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5198186635971069},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4996659755706787},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4663039743900299},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3395206928253174},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3211207985877991},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21005454659461975},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07057592272758484},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06465837359428406}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3323165.3323173","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3323165.3323173","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3323165.3323173","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"}],"best_oa_location":{"id":"doi:10.1145/3323165.3323173","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3323165.3323173","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3323165.3323173","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"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G2087396116","display_name":null,"funder_award_id":"China","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G2138137457","display_name":null,"funder_award_id":"1756014","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6809183074","display_name":null,"funder_award_id":"Project No.","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7033253288","display_name":null,"funder_award_id":"Grants","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8854061127","display_name":null,"funder_award_id":"11771365","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309893","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2951591595.pdf","grobid_xml":"https://content.openalex.org/works/W2951591595.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W1972868674","https://openalex.org/W2091732799","https://openalex.org/W2123887437","https://openalex.org/W2618005576","https://openalex.org/W2739321808","https://openalex.org/W2900933468"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2142195909","https://openalex.org/W1966261337","https://openalex.org/W1759995226","https://openalex.org/W2962917430","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2028468530","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0,101],"study":[1],"the":[2,19,82,99,112,125],"scheduling":[3],"problem":[4],"with":[5,26,107],"calibrations.":[6,86],"In":[7,87,118],"2013,":[8],"Bender":[9],"et":[10],"al.":[11],"(SPAA":[12],"'13)":[13],"proposed":[14],"a":[15,49,55,59,70,103,122],"theoretical":[16],"framework":[17],"for":[18,58],"problem.":[20,100],"Jobs":[21],"of":[22,62,85,114,127],"unit":[23],"processing":[24],"time":[25,60,110],"release":[27],"times":[28],"and":[29,80],"deadlines":[30],"are":[31],"to":[32,42,45,68,92,97],"be":[33,43],"scheduled":[34],"on":[35,54],"parallel":[36],"identical":[37],"machines.":[38],"The":[39,65],"machines":[40,115,128],"need":[41],"calibrated":[44],"run":[46],"jobs":[47,75],"while":[48],"single":[50],"calibration":[51],"remains":[52],"valid":[53],"machine":[56],"only":[57],"period":[61],"length":[63],"T.":[64],"objective":[66],"is":[67,116,129],"find":[69],"schedule":[71],"that":[72],"completes":[73],"all":[74],"within":[76],"their":[77],"timing":[78],"constraints":[79],"minimizes":[81],"total":[83],"number":[84,113,126],"this":[88],"paper,":[89],"we":[90,120],"aim":[91],"design":[93],"an":[94],"approximation":[95],"algorithm":[96,106],"solve":[98],"propose":[102],"dynamic":[104],"programming":[105],"polynomial":[108],"running":[109],"when":[111,124],"constant.":[117],"addition,":[119],"give":[121],"PTAS":[123],"input.":[130]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}