{"id":"https://openalex.org/W2632651774","doi":"https://doi.org/10.1109/access.2017.2715279","title":"Greedy-Ant: Ant Colony System-Inspired Workflow Scheduling for Heterogeneous Computing","display_name":"Greedy-Ant: Ant Colony System-Inspired Workflow Scheduling for Heterogeneous Computing","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2632651774","doi":"https://doi.org/10.1109/access.2017.2715279","mag":"2632651774"},"language":"en","primary_location":{"id":"doi:10.1109/access.2017.2715279","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2017.2715279","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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 Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2017.2715279","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061419190","display_name":"Bin Xiang","orcid":"https://orcid.org/0000-0003-4065-5557"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bin Xiang","raw_affiliation_strings":["Beijing University of Posts and Telecommunications, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0003-4065-5557","affiliations":[{"raw_affiliation_string":"Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090156476","display_name":"Bibo Zhang","orcid":"https://orcid.org/0000-0002-1582-901X"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bibo Zhang","raw_affiliation_strings":["Beijing University of Posts and Telecommunications, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100351907","display_name":"Lin Zhang","orcid":"https://orcid.org/0000-0003-0424-9965"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lin Zhang","raw_affiliation_strings":["Beijing University of Posts and Telecommunications, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":3.9968,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.94480841,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"5","issue":null,"first_page":"11404","last_page":"11412"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998000264167786,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998000264167786,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9902999997138977,"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/workflow","display_name":"Workflow","score":0.7708836197853088},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7642639875411987},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6947599649429321},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5991459488868713},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5641000866889954},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5362422466278076},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5094013810157776},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.46736475825309753},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4658437967300415},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.43544477224349976},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4292272627353668},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3336060643196106},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2258855402469635},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.19975534081459045},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18557488918304443},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.13511312007904053},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09336844086647034},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08011007308959961}],"concepts":[{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.7708836197853088},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7642639875411987},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6947599649429321},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5991459488868713},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5641000866889954},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5362422466278076},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5094013810157776},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.46736475825309753},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4658437967300415},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.43544477224349976},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4292272627353668},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3336060643196106},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2258855402469635},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.19975534081459045},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18557488918304443},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.13511312007904053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09336844086647034},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08011007308959961},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2017.2715279","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2017.2715279","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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 Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:d36a496f12614449b635e8c4060f2961","is_oa":true,"landing_page_url":"https://doaj.org/article/d36a496f12614449b635e8c4060f2961","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 5, Pp 11404-11412 (2017)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2017.2715279","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2017.2715279","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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 Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2303347","https://openalex.org/W190901438","https://openalex.org/W1979166756","https://openalex.org/W2011039300","https://openalex.org/W2063281062","https://openalex.org/W2099389501","https://openalex.org/W2106076593","https://openalex.org/W2149294210","https://openalex.org/W2154929945","https://openalex.org/W2156735965","https://openalex.org/W2172250608","https://openalex.org/W2339849049","https://openalex.org/W2378934329","https://openalex.org/W2404054523","https://openalex.org/W2460368434","https://openalex.org/W4285719527","https://openalex.org/W6607806164"],"related_works":["https://openalex.org/W2347951034","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2071981049","https://openalex.org/W2381829748","https://openalex.org/W2244460820","https://openalex.org/W2109336245","https://openalex.org/W2511325427","https://openalex.org/W2392795382","https://openalex.org/W2379177376"],"abstract_inverted_index":{"The":[0],"last":[1],"decades":[2],"have":[3],"seen":[4],"a":[5,33,63,97,111],"considerable":[6],"progress":[7],"on":[8,23,95],"workflow":[9,35],"scheduling":[10,36,61],"in":[11,26,50,134],"heterogeneous":[12,51],"computing":[13],"environments.":[14,52],"However,":[15],"existing":[16],"methods":[17],"still":[18],"need":[19],"to":[20,42,60,69,77,86,103,132],"be":[21],"improved":[22],"the":[24,27,54,88,126,129,135],"performance":[25],"makespan-based":[28],"metrics.":[29],"This":[30],"paper":[31],"proposes":[32],"novel":[34],"algorithm":[37],"named":[38],"<italic":[39,80,122],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[40,81,123],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">Greedy-Ant</i>":[41,124],"minimize":[43],"total":[44],"execution":[45],"time":[46],"of":[47,91,128,137],"an":[48],"application":[49],"First,":[53],"ant":[55],"colony":[56],"system":[57],"is":[58,84,101,116],"applied":[59],"from":[62],"new":[64,98],"standpoint":[65],"by":[66],"guiding":[67],"ants":[68,105],"explore":[70],"task":[71,108],"priorities":[72],"and":[73],"simultaneously":[74],"assign":[75],"tasks":[76],"machines.":[78],"Second,":[79],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">forward/backward":[82],"dependence</i>":[83],"defined":[85],"indicate":[87],"global":[89],"significance":[90],"each":[92],"node,":[93],"based":[94],"which,":[96],"heuristic":[99],"factor":[100],"proposed":[102],"help":[104],"search":[106],"for":[107],"sequences.":[109],"Finally,":[110],"greedy":[112],"machine":[113],"allocating":[114],"strategy":[115],"presented.":[117],"Experimental":[118],"results":[119],"demonstrate":[120],"that":[121],"outperforms":[125],"state":[127],"art":[130],"up":[131],"18%":[133],"metric":[136],"speedup.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}