{"id":"https://openalex.org/W2918606681","doi":"https://doi.org/10.1145/3297156.3297222","title":"Semi-online Hierarchical Scheduling for Bag-of-tasks on Two Machines","display_name":"Semi-online Hierarchical Scheduling for Bag-of-tasks on Two Machines","publication_year":2018,"publication_date":"2018-12-08","ids":{"openalex":"https://openalex.org/W2918606681","doi":"https://doi.org/10.1145/3297156.3297222","mag":"2918606681"},"language":"en","primary_location":{"id":"doi:10.1145/3297156.3297222","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3297156.3297222","pdf_url":null,"source":{"id":"https://openalex.org/S4306523626","display_name":"Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence","raw_type":"proceedings-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/A5001977453","display_name":"Bingfei Dai","orcid":null},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Bingfei Dai","raw_affiliation_strings":["School of Mathematics and Statistics, Yunnan University, Kunming"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Yunnan University, Kunming","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018144399","display_name":"Jianping Li","orcid":"https://orcid.org/0000-0003-1508-1440"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianping Li","raw_affiliation_strings":["School of Mathematics and Statistics, Yunnan University, Kunming"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Yunnan University, Kunming","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054712771","display_name":"Weidong Li","orcid":"https://orcid.org/0000-0003-3094-4347"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weidong Li","raw_affiliation_strings":["School of Mathematics and Statistics, Yunnan University, Kunming"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Yunnan University, Kunming","institution_ids":["https://openalex.org/I189210763"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001977453"],"corresponding_institution_ids":["https://openalex.org/I189210763"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.35172414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"609","last_page":"614"},"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.9997000098228455,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9979000091552734,"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/competitive-analysis","display_name":"Competitive analysis","score":0.8573148846626282},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.77556312084198},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7399226427078247},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6179348826408386},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5054852962493896},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39028725028038025},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3121488392353058},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1755952537059784},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1669418215751648},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15038025379180908},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10353505611419678}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8573148846626282},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.77556312084198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7399226427078247},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6179348826408386},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5054852962493896},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39028725028038025},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3121488392353058},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1755952537059784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1669418215751648},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15038025379180908},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10353505611419678},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3297156.3297222","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3297156.3297222","pdf_url":null,"source":{"id":"https://openalex.org/S4306523626","display_name":"Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1993163645","https://openalex.org/W1997228113","https://openalex.org/W2010486202","https://openalex.org/W2019300924","https://openalex.org/W2031740584","https://openalex.org/W2041066538","https://openalex.org/W2047837328","https://openalex.org/W2049110586","https://openalex.org/W2059289717","https://openalex.org/W2068191609","https://openalex.org/W2072712212","https://openalex.org/W2073932525","https://openalex.org/W2077500752","https://openalex.org/W2142471695","https://openalex.org/W2157098840","https://openalex.org/W2310430865","https://openalex.org/W2584909929","https://openalex.org/W2962940175"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405","https://openalex.org/W2098754607"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"the":[5,20,25,39,57],"problem":[6],"of":[7,36,52],"scheduling":[8],"for":[9],"bag-of-tasks":[10],"on":[11],"two":[12],"parallel":[13],"machines":[14],"under":[15],"a":[16,33,49],"grade-of-service":[17],"provision,":[18],"where":[19],"objective":[21],"is":[22,42,61],"to":[23],"minimize":[24],"makespan.":[26],"We":[27],"design":[28],"an":[29,45],"semi-online":[30,46],"algorithm":[31,47],"with":[32,48],"competitive":[34,50],"ratio":[35,51],"3/2":[37],"when":[38,56],"optimal":[40],"value":[41],"known":[43],"and":[44],"(\u221a5":[53],"+":[54],"1)/2":[55],"largest":[58],"processing":[59],"time":[60],"known.":[62]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}