{"id":"https://openalex.org/W3162108930","doi":"https://doi.org/10.1145/3409964.3461795","title":"Analysis of Busy-Time Scheduling on Heterogeneous Machines","display_name":"Analysis of Busy-Time Scheduling on Heterogeneous Machines","publication_year":2021,"publication_date":"2021-06-30","ids":{"openalex":"https://openalex.org/W3162108930","doi":"https://doi.org/10.1145/3409964.3461795","mag":"3162108930"},"language":"en","primary_location":{"id":"doi:10.1145/3409964.3461795","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3409964.3461795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2105.06287","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mozhengfu Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Mozhengfu Liu","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":null,"display_name":"Xueyan Tang","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Xueyan Tang","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"340","last_page":"350"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9976999759674072,"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.9976999759674072,"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.9973999857902527,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9952999949455261,"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/scheduling","display_name":"Scheduling (production processes)","score":0.593999981880188},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4481000006198883},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.44279998540878296},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4311000108718872},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.430400013923645},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.40950000286102295},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.3944000005722046},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.35850000381469727}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.682200014591217},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.593999981880188},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4481000006198883},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.44279998540878296},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4311000108718872},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.430400013923645},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.40950000286102295},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4025000035762787},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.3944000005722046},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.35850000381469727},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.35199999809265137},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.29840001463890076},{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29120001196861267},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.28220000863075256},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.28200000524520874},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.27630001306533813},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.27230000495910645},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.26899999380111694},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26589998602867126},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2619999945163727}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3409964.3461795","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3409964.3461795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2105.06287","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.06287","pdf_url":"https://arxiv.org/pdf/2105.06287","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:2105.06287","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.06287","pdf_url":"https://arxiv.org/pdf/2105.06287","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1590696547","https://openalex.org/W1770425921","https://openalex.org/W2023661795","https://openalex.org/W2032570272","https://openalex.org/W2048348088","https://openalex.org/W2089278681","https://openalex.org/W2131641675","https://openalex.org/W2176549387","https://openalex.org/W2469847610","https://openalex.org/W2505550437","https://openalex.org/W2560689012","https://openalex.org/W2624258401","https://openalex.org/W2736690157","https://openalex.org/W2905987001","https://openalex.org/W3036358974","https://openalex.org/W3042299100"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"a":[3,17,22,30,33,49,71],"generalized":[4],"busy-time":[5],"scheduling":[6],"model":[7,15],"on":[8,48,70],"heterogeneous":[9],"machines.":[10],"The":[11,63,115],"input":[12],"to":[13,45,83,101,118,124],"the":[14,67,78,92,102,120,126,131,140,148,154],"includes":[16],"set":[18,23],"of":[19,24,55,66,88,129,160],"jobs":[20,68,87,121],"and":[21,32,60,143],"machine":[25,50,72,93,96],"types.":[26,94],"Each":[27,42,95],"job":[28,43,156],"has":[29],"size":[31,65],"time":[34,103],"interval":[35],"during":[36],"which":[37,106,161],"it":[38,107,111],"should":[39],"be":[40,46,75],"processed.":[41],"is":[44,98,108,112,117,153],"placed":[47],"for":[51,86],"execution.":[52],"Different":[53],"types":[54],"machines":[56,123,132],"have":[57],"distinct":[58],"capacities":[59],"cost":[61,128],"rates.":[62],"total":[64,127],"running":[69],"must":[73],"always":[74],"kept":[76],"within":[77],"machine's":[79],"capacity,":[80],"giving":[81],"rise":[82],"placement":[84],"restrictions":[85],"various":[89],"sizes":[90],"among":[91],"used":[97],"charged":[99],"according":[100],"duration":[104],"in":[105,139,147],"busy,":[109],"i.e.,":[110],"processing":[113],"jobs.":[114],"objective":[116],"schedule":[119],"onto":[122],"minimize":[125],"all":[130],"used.":[133],"We":[134],"develop":[135],"an":[136,144],"O(1)-approximation":[137],"algorithm":[138,146],"offline":[141],"setting":[142,150],"O(\u03bc)-competitive":[145],"online":[149],"(where":[151],"\u03bc":[152],"max/min":[155],"length":[157],"ratio),":[158],"both":[159],"are":[162],"asymptotically":[163],"optimal.":[164]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2021-05-24T00:00:00"}