{"id":"https://openalex.org/W2625627622","doi":"https://doi.org/10.1093/comjnl/bxx059","title":"Multi-Objective Optimization Techniques for Task Scheduling Problem in Distributed Systems","display_name":"Multi-Objective Optimization Techniques for Task Scheduling Problem in Distributed Systems","publication_year":2017,"publication_date":"2017-05-24","ids":{"openalex":"https://openalex.org/W2625627622","doi":"https://doi.org/10.1093/comjnl/bxx059","mag":"2625627622"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxx059","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxx059","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","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/A5080189606","display_name":"S. Sarathambekai","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109528","display_name":"PSG INSTITUTE OF TECHNOLOGY AND APPLIED RESEARCH","ror":"https://ror.org/01sa9ng67","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210109528"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"S Sarathambekai","raw_affiliation_strings":["Department of Information Technology, PSG College of Technology, Peelamedu, Coimbatore 641 004, Tamil Nadu, India"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, PSG College of Technology, Peelamedu, Coimbatore 641 004, Tamil Nadu, India","institution_ids":["https://openalex.org/I4210109528"]}]},{"author_position":"last","author":{"id":null,"display_name":"K Umamaheswari","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109528","display_name":"PSG INSTITUTE OF TECHNOLOGY AND APPLIED RESEARCH","ror":"https://ror.org/01sa9ng67","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210109528"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K Umamaheswari","raw_affiliation_strings":["Department of Information Technology, PSG College of Technology, Peelamedu, Coimbatore 641 004, Tamil Nadu, India"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, PSG College of Technology, Peelamedu, Coimbatore 641 004, Tamil Nadu, India","institution_ids":["https://openalex.org/I4210109528"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080189606"],"corresponding_institution_ids":["https://openalex.org/I4210109528"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":0.9483,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.77370782,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"61","issue":"2","first_page":"248","last_page":"263"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9983000159263611,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7324346899986267},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6423625946044922},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6003693342208862},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5952187180519104},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5440182089805603},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5115231275558472},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.48437342047691345},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4829780161380768},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.46978822350502014},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4520735740661621},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4485522508621216},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18643951416015625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13203871250152588},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09195581078529358},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09138429164886475}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7324346899986267},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6423625946044922},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6003693342208862},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5952187180519104},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5440182089805603},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5115231275558472},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.48437342047691345},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4829780161380768},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.46978822350502014},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4520735740661621},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4485522508621216},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18643951416015625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13203871250152588},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09195581078529358},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09138429164886475},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/comjnl/bxx059","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxx059","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W62576224","https://openalex.org/W172801870","https://openalex.org/W375811165","https://openalex.org/W1982209383","https://openalex.org/W1999218527","https://openalex.org/W2006495033","https://openalex.org/W2035128439","https://openalex.org/W2053900989","https://openalex.org/W2078887729","https://openalex.org/W2085054178","https://openalex.org/W2089058099","https://openalex.org/W2116661285","https://openalex.org/W2126105956","https://openalex.org/W2153460141","https://openalex.org/W2181821283","https://openalex.org/W2188353048","https://openalex.org/W2403340506","https://openalex.org/W2513440362","https://openalex.org/W2525558513","https://openalex.org/W2561901116","https://openalex.org/W2740471852","https://openalex.org/W3037193185","https://openalex.org/W4246755893","https://openalex.org/W4285719527","https://openalex.org/W6607000711","https://openalex.org/W6612824507","https://openalex.org/W6663240100","https://openalex.org/W6672997949","https://openalex.org/W6685618380","https://openalex.org/W6713516871","https://openalex.org/W6727543106","https://openalex.org/W6742086926","https://openalex.org/W6981149603"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W4241467429","https://openalex.org/W2073147994","https://openalex.org/W2001591765","https://openalex.org/W2384474142","https://openalex.org/W3083133203","https://openalex.org/W1588199609","https://openalex.org/W2744462909","https://openalex.org/W1971520370","https://openalex.org/W1550055091"],"abstract_inverted_index":{"Task":[0],"Scheduling":[1],"is":[2,28],"one":[3],"of":[4,15,117,124],"the":[5,13,60,67,79,92,96,122,125],"challenging":[6],"issues":[7],"in":[8,18,21,59,74],"distributed":[9,75],"systems":[10,76],"due":[11],"to":[12,23,30,77,120],"allocation":[14],"multiple":[16],"tasks":[17],"many":[19,25],"processors,":[20],"order":[22],"achieve":[24],"objectives.":[26],"It":[27],"known":[29],"be":[31,38],"an":[32],"NP-hard":[33],"problem.":[34],"These":[35,87],"problems":[36,73],"can":[37],"efficiently":[39],"solved":[40],"by":[41,91],"population-based":[42,54],"models.":[43],"Discrete":[44],"particle":[45],"swarm":[46],"optimization":[47,55,100],"(DPSO)":[48],"has":[49],"been":[50],"a":[51,115],"recently":[52],"developed":[53],"technique":[56],"which":[57],"works":[58],"discrete":[61],"domain":[62],"efficiently.":[63],"This":[64],"paper":[65],"presents":[66],"DPSO":[68,93],"variants":[69],"for":[70],"task":[71],"scheduling":[72],"minimize":[78],"makespan,":[80],"mean":[81],"flow":[82],"time":[83],"and":[84,106],"reliability":[85],"cost.":[86],"objectives":[88],"are":[89,111],"optimized":[90],"algorithm":[94],"using":[95],"two":[97],"well-known":[98],"multi-objective":[99],"(MOO)":[101],"approaches":[102],"such":[103],"as":[104],"Aggregating":[105],"Pareto":[107],"dominance.":[108],"Computational":[109],"simulations":[110],"done":[112],"based":[113],"on":[114],"set":[116],"benchmark":[118],"instances":[119],"assess":[121],"performance":[123],"MOO":[126],"approaches.":[127]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}