{"id":"https://openalex.org/W2572533439","doi":"https://doi.org/10.1109/ispacs.2016.7824770","title":"A heuristic-genetic algorithm for client web service scheduling constrained by one I/O port","display_name":"A heuristic-genetic algorithm for client web service scheduling constrained by one I/O port","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2572533439","doi":"https://doi.org/10.1109/ispacs.2016.7824770","mag":"2572533439"},"language":"en","primary_location":{"id":"doi:10.1109/ispacs.2016.7824770","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispacs.2016.7824770","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","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/A5038526419","display_name":"Waralak Chongdarakul","orcid":null},"institutions":[{"id":"https://openalex.org/I34002243","display_name":"Mae Fah Luang University","ror":"https://ror.org/00mwhaw71","country_code":"TH","type":"education","lineage":["https://openalex.org/I34002243"]}],"countries":["TH"],"is_corresponding":true,"raw_author_name":"Waralak Chongdarakul","raw_affiliation_strings":["School of Information Technology, Mae Fah Luang University, Chiengrai, Thailand"],"affiliations":[{"raw_affiliation_string":"School of Information Technology, Mae Fah Luang University, Chiengrai, Thailand","institution_ids":["https://openalex.org/I34002243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038526419"],"corresponding_institution_ids":["https://openalex.org/I34002243"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18821702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2016","issue":null,"first_page":"1","last_page":"6"},"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.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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9994000196456909,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.9957000017166138,"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.8194540739059448},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7046387195587158},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6028644442558289},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5701730847358704},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.543655276298523},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5061764121055603},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.47498077154159546},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4520053267478943},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4381946623325348},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3758143186569214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3497244715690613},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34884703159332275},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.2973308563232422},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23583149909973145},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09262841939926147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0817224383354187}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8194540739059448},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7046387195587158},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6028644442558289},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5701730847358704},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.543655276298523},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5061764121055603},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.47498077154159546},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4520053267478943},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4381946623325348},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3758143186569214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3497244715690613},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34884703159332275},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.2973308563232422},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23583149909973145},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09262841939926147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0817224383354187}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ispacs.2016.7824770","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispacs.2016.7824770","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","raw_type":"proceedings-article"},{"id":"mag:3163395143","is_oa":false,"landing_page_url":"https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=201702267404174530","pdf_url":null,"source":{"id":"https://openalex.org/S4306512817","display_name":"IEEE Conference Proceedings","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":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEEE Conference Proceedings","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488887129","https://openalex.org/W1518561795","https://openalex.org/W2012024302","https://openalex.org/W2102102938","https://openalex.org/W2109854454","https://openalex.org/W2114296561","https://openalex.org/W2118173476","https://openalex.org/W2130281899","https://openalex.org/W2131646073","https://openalex.org/W2149294210","https://openalex.org/W2156901812","https://openalex.org/W2161608344","https://openalex.org/W2162021078","https://openalex.org/W2165239677","https://openalex.org/W2166790918","https://openalex.org/W2315597073","https://openalex.org/W2404727149","https://openalex.org/W2467426122","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2372008037","https://openalex.org/W3036719625","https://openalex.org/W2225350526","https://openalex.org/W2978148977","https://openalex.org/W4390711934","https://openalex.org/W2106332846","https://openalex.org/W2167574351","https://openalex.org/W4390722068"],"abstract_inverted_index":{"Enhancing":[0],"heterogeneous":[1],"distributed":[2],"computing":[3],"systems":[4],"requires":[5],"effective":[6],"scheduling":[7,19,52,84,178],"approach":[8,151,184],"to":[9,24,90,161],"achieve":[10,91],"high":[11,146],"performance":[12],"and":[13,26,39,68,129,135,192],"satisfy":[14],"the":[15,36,50,72,103,123,149,163,182],"clients":[16,28,124],"request.":[17],"Many":[18],"algorithms":[20],"have":[21],"been":[22],"proposed":[23,118,150,183],"map":[25],"order":[27],"requests":[29],"running":[30],"on":[31,71,121],"a":[32,62,79,86],"suitable":[33],"processor":[34],"at":[35],"minimum":[37,92,133,190],"makespan":[38,134,191],"maximum":[40],"resource":[41],"utilization.":[42],"However,":[43],"they":[44],"do":[45],"not":[46],"take":[47],"into":[48],"account":[49],"task":[51,83,115],"under":[53],"bounded":[54],"number":[55],"of":[56,108,126,173,189],"I/O":[57,73,81],"port":[58,74,82],"constraint":[59],"which":[60],"is":[61,110],"realistic":[63],"communications":[64],"model":[65],"between":[66],"client":[67],"server.":[69],"Based":[70],"constraint,":[75],"this":[76],"paper":[77],"proposes":[78],"one":[80],"using":[85],"hybrid":[87],"heuristicgenetic":[88],"algorithm":[89,119],"completion":[93],"time.":[94,170],"For":[95],"practical":[96],"scenario,":[97],"web":[98,127],"service":[99],"workflow":[100],"represented":[101],"by":[102],"Directed":[104],"Acyclic":[105],"Graph":[106],"(DAG)":[107],"tasks":[109],"implemented":[111],"as":[112],"an":[113],"input":[114],"set.":[116],"The":[117],"focuses":[120],"sending":[122],"request":[125],"services":[128],"receiving":[130],"results":[131,144],"having":[132],"delay.":[136,193],"Unlike":[137],"Genetic":[138,156],"Algorithm":[139,157],"(GA)":[140],"providing":[141],"near":[142],"optimal":[143],"but":[145],"time":[147],"complexity,":[148],"named":[152],"Critical":[153],"Path":[154],"with":[155,167,176],"(CPGA)":[158],"incorporates":[159],"GA":[160],"produce":[162],"good":[164],"quality":[165],"schedule":[166],"lower":[168],"processing":[169],"Preliminary":[171],"result":[172],"fair":[174],"comparisons":[175],"existing":[177],"methods":[179],"shows":[180],"that":[181],"outperforms":[185],"them":[186],"in":[187],"terms":[188]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}