{"id":"https://openalex.org/W2737371942","doi":"https://doi.org/10.1109/tpds.2017.2731843","title":"Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds","display_name":"Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds","publication_year":2017,"publication_date":"2017-07-25","ids":{"openalex":"https://openalex.org/W2737371942","doi":"https://doi.org/10.1109/tpds.2017.2731843","mag":"2737371942"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2017.2731843","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2017.2731843","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","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/A5013126405","display_name":"Longkun Guo","orcid":"https://orcid.org/0000-0003-2891-4253"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Longkun Guo","raw_affiliation_strings":["College of Mathematics and Computer Science, Fuzhou University, Fuzhou Shi, China"],"raw_orcid":"https://orcid.org/0000-0003-2891-4253","affiliations":[{"raw_affiliation_string":"College of Mathematics and Computer Science, Fuzhou University, Fuzhou Shi, China","institution_ids":["https://openalex.org/I80947539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070128994","display_name":"Hong Shen","orcid":"https://orcid.org/0000-0002-3663-6591"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]},{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU","CN"],"is_corresponding":false,"raw_author_name":"Hong Shen","raw_affiliation_strings":["School of Computer Science, University of Adelaide, Adelaide, SA, Australia","School of Information Science and Technology, Sun Yat-Sen University, Guangzhou, China"],"raw_orcid":"https://orcid.org/0000-0002-3663-6591","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"School of Information Science and Technology, Sun Yat-Sen University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7494,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.95212121,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"28","issue":"12","first_page":"3511","last_page":"3520"},"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.9991999864578247,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9965000152587891,"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/computer-science","display_name":"Computer science","score":0.7680904865264893},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6231191158294678},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6224601864814758},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.5846195220947266},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.539709210395813},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.519467294216156},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4903993606567383},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.4902053475379944},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4349752366542816},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41998058557510376},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3416121304035187},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1603190302848816},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09618031978607178}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7680904865264893},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6231191158294678},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6224601864814758},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.5846195220947266},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.539709210395813},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.519467294216156},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4903993606567383},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.4902053475379944},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4349752366542816},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41998058557510376},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3416121304035187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1603190302848816},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09618031978607178},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tpds.2017.2731843","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2017.2731843","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/110415","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/110415","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1109/tpds.2017.2731843","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G2527507928","display_name":null,"funder_award_id":"61300025","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5229960032","display_name":"Privacy-Preserving Classification for Big-Data Driven Network Traffic","funder_award_id":"DP150104871","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320320978","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321160","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71"},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W625187458","https://openalex.org/W1488422606","https://openalex.org/W1495318531","https://openalex.org/W1498382101","https://openalex.org/W1544515183","https://openalex.org/W1572977974","https://openalex.org/W1596968903","https://openalex.org/W1972300623","https://openalex.org/W1976306508","https://openalex.org/W1987325243","https://openalex.org/W2003902046","https://openalex.org/W2019712172","https://openalex.org/W2022191808","https://openalex.org/W2025222277","https://openalex.org/W2055037276","https://openalex.org/W2057239927","https://openalex.org/W2076885483","https://openalex.org/W2077533566","https://openalex.org/W2087411299","https://openalex.org/W2089269509","https://openalex.org/W2092461546","https://openalex.org/W2102201348","https://openalex.org/W2124881553","https://openalex.org/W2172331085","https://openalex.org/W2183243439","https://openalex.org/W2196761178","https://openalex.org/W3105569215","https://openalex.org/W4251797957","https://openalex.org/W4292027170","https://openalex.org/W6632396972","https://openalex.org/W6687320138"],"related_works":["https://openalex.org/W3008339103","https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W4247536566","https://openalex.org/W4241418540","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W1508895727","https://openalex.org/W2970302286","https://openalex.org/W2810352541"],"abstract_inverted_index":{"Clouds,":[0],"such":[1,31,90],"as":[2],"Amazon":[3],"Infrastructure-as-a-Service":[4],"(IaaS)":[5],"clouds":[6],"and":[7,43,59,122,156,182,248,257,272,291,307],"EMC":[8],"Hybrid":[9],"Cloud,":[10],"impose":[11],"growing":[12],"requirements":[13],"of":[14,25,40,46,49,67,83,95,127,133,150,195,224,231,246,261,281,289,305,312],"resource-efficiency":[15],"scheduling.":[16],"The":[17,76],"bounded":[18],"flexible":[19],"scheduling":[20,204],"(BFS)":[21],"problem":[22,77,280],"is":[23,51,78,103,117,124,171,197,216,252,263,302,309,331],"one":[24],"the":[26,64,71,84,88,92,96,118,125,128,131,145,172,217,221,229,232,259,278,303,310,321],"problems":[27],"proposed":[28],"to":[29,79,87,190,206,219],"meet":[30],"requirements.":[32],"In":[33],"BFS,":[34,114,140,247],"we":[35,235,267,318],"are":[36],"given":[37,85],"a":[38,44,53,55,57,60,108,165,176,203,237,243,269,316,324],"set":[39,45],"identical":[41],"machines":[42,68],"jobs,":[47],"each":[48],"which":[50,70,207,215],"with":[52,253],"value,":[54],"workload,":[56],"deadline":[58],"parallelism":[61,120],"degree,":[62],"i.e.,":[63,199],"maximum":[65,119,173],"number":[66,132,304,311],"on":[69,164],"job":[72],"can":[73,210],"execute":[74],"concurrently.":[75],"compute":[80],"an":[81,193,254,286],"assignment":[82],"jobs":[86,97,209,306],"machines,":[89],"that":[91,170,250,320],"total":[93],"value":[94],"successfully":[98],"completed":[99],"by":[100],"their":[101,213],"deadlines":[102,154,162],"maximized.":[104],"This":[105],"paper":[106],"presents":[107],"factor":[109],"C/C-k":[110,157],"approximation":[111,148,287,326],"algorithm":[112,271,276],"for":[113,152,160,242,277],"where":[115,300],"k":[116,138],"degree":[121],"C":[123,136],"capacity":[126],"system":[129],"(i.e.,":[130],"machines).":[134],"Since":[135],"\u226b":[137],"in":[139],"our":[141,225],"result":[142],"significantly":[143],"improves":[144],"known":[146],"best":[147],"ratio":[149,174,222,288],"(2C-k/C-k)(1-\u03f5)":[151],"tight":[153],"[17],":[155],"\u00b7":[158],"s/s-1/s":[159],"loose":[161],"[18]":[163],"slackness":[166],"ratios":[167],">":[168],"1":[169],"between":[175],"job's":[177],"earliest":[178],"actual":[179],"finish":[180,211],"time":[181,292,313],"its":[183,273],"deadline.":[184],"We":[185],"first":[186],"propose":[187],"feasibility":[188,233],"condition":[189],"determine":[191],"whether":[192,200],"instance":[194],"BFS":[196,262,322],"feasible,":[198],"there":[201],"exists":[202],"according":[205],"all":[208],"before":[212],"deadlines,":[214],"key":[218],"achieve":[220],"improvement":[223],"algorithm.":[226],"To":[227],"prove":[228],"correctness":[230],"condition,":[234],"give":[236],"simple":[238],"linear":[239],"program":[240],"(LP)":[241],"weaker":[244],"version":[245,260],"show":[249,319],"it":[251],"integral":[255],"polyhedron":[256],"hence":[258],"polynomial-time":[264,325],"solvable.":[265],"Then":[266],"present":[268],"greedy":[270],"equivalent":[274],"primal-dual":[275],"complementary":[279],"BFS.":[282],"Both":[283],"algorithms":[284],"have":[285],"C/C-k,":[290],"complexity":[293],"O(n":[294],"<sup":[295],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[296],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[297],"+":[298],"nT),":[299],"n":[301],"T":[308,330],"slots.":[314],"As":[315],"by-product,":[317],"admits":[323],"scheme":[327],"(PTAS)":[328],"when":[329],"fixed.":[332]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}