{"id":"https://openalex.org/W2538050777","doi":"https://doi.org/10.1109/icta.2015.7426935","title":"A parallel algorithm for solving the PFSP with load balancing on the grid: An empirical study","display_name":"A parallel algorithm for solving the PFSP with load balancing on the grid: An empirical study","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2538050777","doi":"https://doi.org/10.1109/icta.2015.7426935","mag":"2538050777"},"language":"en","primary_location":{"id":"doi:10.1109/icta.2015.7426935","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icta.2015.7426935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 5th International Conference on Information & Communication Technology and Accessibility (ICTA)","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/A5084231941","display_name":"Samia Kouki","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Samia Kouki","raw_affiliation_strings":["ENSIT, University of Tunis, Tunis, Tunisia"],"affiliations":[{"raw_affiliation_string":"ENSIT, University of Tunis, Tunis, Tunisia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062847316","display_name":"Mohamed Jemni","orcid":"https://orcid.org/0000-0001-8841-5224"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohamed Jemni","raw_affiliation_strings":["ENSIT, University of Tunis, Tunis, Tunisia"],"affiliations":[{"raw_affiliation_string":"ENSIT, University of Tunis, Tunis, Tunisia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071634333","display_name":"Talel Ladhari","orcid":"https://orcid.org/0000-0002-5648-1398"},"institutions":[{"id":"https://openalex.org/I199693650","display_name":"Umm al-Qura University","ror":"https://ror.org/01xjqrm90","country_code":"SA","type":"education","lineage":["https://openalex.org/I199693650"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Talel Ladhari","raw_affiliation_strings":["Umm Al-Qura University, La Mecque, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Umm Al-Qura University, La Mecque, Saudi Arabia","institution_ids":["https://openalex.org/I199693650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084231941"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.32852067,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9941999912261963,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9915000200271606,"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/computer-science","display_name":"Computer science","score":0.7382725477218628},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7349730134010315},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5603741407394409},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5566580295562744},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.504292368888855},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.48568639159202576},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.449063241481781},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42536792159080505},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4012411832809448},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3612399697303772},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1910436451435089}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7382725477218628},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7349730134010315},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5603741407394409},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5566580295562744},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.504292368888855},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.48568639159202576},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.449063241481781},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42536792159080505},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4012411832809448},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3612399697303772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1910436451435089},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icta.2015.7426935","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icta.2015.7426935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 5th International Conference on Information & Communication Technology and Accessibility (ICTA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6299999952316284,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1828053834","https://openalex.org/W1988714922","https://openalex.org/W2024085737","https://openalex.org/W2068610773","https://openalex.org/W2122967269","https://openalex.org/W2128451186"],"related_works":["https://openalex.org/W2366206435","https://openalex.org/W2594778474","https://openalex.org/W4250527476","https://openalex.org/W2029861847","https://openalex.org/W1931020284","https://openalex.org/W2389899617","https://openalex.org/W1591098987","https://openalex.org/W4319942994","https://openalex.org/W4394849239","https://openalex.org/W2182290077"],"abstract_inverted_index":{"Solving":[0],"NP-hard":[1],"combinatorial":[2],"optimization":[3],"problems":[4],"by":[5],"exact":[6,20],"search":[7],"methods,":[8],"such":[9],"as":[10,91,93],"Branch-and-Bound,":[11],"may":[12],"degenerate":[13],"to":[14,24,34,51,63,121],"complete":[15],"enumeration.":[16],"For":[17],"that":[18],"reason,":[19],"approaches":[21],"limits":[22],"us":[23],"solve":[25,122],"only":[26],"small":[27],"or":[28],"moderate":[29,126],"size":[30,43],"problem":[31,42,90],"instances,":[32],"due":[33],"the":[35,47,54,85,115,118],"exponential":[36],"increase":[37],"in":[38,125],"CPU":[39,127],"time":[40],"when":[41],"increases.":[44],"One":[45],"of":[46,57,60,67,104,117],"most":[48],"promising":[49,110],"ways":[50],"reduce":[52],"significantly":[53],"computational":[55],"burden":[56],"sequential":[58],"versions":[59,66],"Branch-and-Bound":[61,79],"is":[62],"design":[64],"parallel":[65,78,107,119],"these":[68],"algorithms":[69],"which":[70],"employ":[71],"several":[72],"processors.":[73],"This":[74],"paper":[75],"describes":[76],"a":[77,97],"algorithm":[80,108],"called":[81],"GALB":[82],"for":[83],"solving":[84],"classical":[86],"permutation":[87],"flowshop":[88],"scheduling":[89],"well":[92],"its":[94],"implementation":[95],"on":[96],"Grid":[98],"computing":[99],"infrastructure.":[100],"The":[101],"experimental":[102],"study":[103],"our":[105],"distributed":[106],"gives":[109],"results":[111],"and":[112],"shows":[113],"clearly":[114],"benefit":[116],"paradigm":[120],"large-scale":[123],"instances":[124],"time.":[128]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}