{"id":"https://openalex.org/W2032639764","doi":"https://doi.org/10.1109/cec.2014.6900285","title":"Multi-objective Flexible Job-Shop scheduling problem with DIPSO: More diversity, greater efficiency","display_name":"Multi-objective Flexible Job-Shop scheduling problem with DIPSO: More diversity, greater efficiency","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2032639764","doi":"https://doi.org/10.1109/cec.2014.6900285","mag":"2032639764"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2014.6900285","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900285","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5015319704","display_name":"Luiz Carlos Felix Carvalho","orcid":"https://orcid.org/0000-0002-5874-5676"},"institutions":[{"id":"https://openalex.org/I80850581","display_name":"Universidade Federal de Uberl\u00e2ndia","ror":"https://ror.org/04x3wvr31","country_code":"BR","type":"education","lineage":["https://openalex.org/I80850581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Luiz Carlos Felix Carvalho","raw_affiliation_strings":["Universidade Federal de Uberlandia, Uberlandia, MG, BR","Luiz Carlos Felix Carvalho and M\u00e1rcia Aparecida Fernandes belong to the Graduate Program in Computer Science, Federal University of Uberl\u00e2ndia, Minas Gerais, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade Federal de Uberlandia, Uberlandia, MG, BR","institution_ids":["https://openalex.org/I80850581"]},{"raw_affiliation_string":"Luiz Carlos Felix Carvalho and M\u00e1rcia Aparecida Fernandes belong to the Graduate Program in Computer Science, Federal University of Uberl\u00e2ndia, Minas Gerais, Brazil","institution_ids":["https://openalex.org/I80850581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008796162","display_name":"M\u00e1rcia A. Fernandes","orcid":"https://orcid.org/0000-0003-3572-612X"},"institutions":[{"id":"https://openalex.org/I80850581","display_name":"Universidade Federal de Uberl\u00e2ndia","ror":"https://ror.org/04x3wvr31","country_code":"BR","type":"education","lineage":["https://openalex.org/I80850581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcia Aparecida Fernandes","raw_affiliation_strings":["Graduate Program in Computer Science, Federal University of Uberlandia, Minas Gerais, Brazil","Luiz Carlos Felix Carvalho and M\u00e1rcia Aparecida Fernandes belong to the Graduate Program in Computer Science, Federal University of Uberl\u00e2ndia, Minas Gerais, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate Program in Computer Science, Federal University of Uberlandia, Minas Gerais, Brazil","institution_ids":["https://openalex.org/I80850581"]},{"raw_affiliation_string":"Luiz Carlos Felix Carvalho and M\u00e1rcia Aparecida Fernandes belong to the Graduate Program in Computer Science, Federal University of Uberl\u00e2ndia, Minas Gerais, Brazil","institution_ids":["https://openalex.org/I80850581"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I80850581"],"apc_list":null,"apc_paid":null,"fwci":3.3987,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.92123894,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"4029","issue":null,"first_page":"282","last_page":"289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.7357653379440308},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7251187562942505},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7052379846572876},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"Premature convergence","score":0.6204769611358643},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6097633838653564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5760860443115234},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.550340473651886},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.5018255710601807},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4993560314178467},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4919254779815674},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4780636131763458},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4530255198478699},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4489525854587555},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.4474067687988281},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.442383348941803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26258212327957153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20910462737083435},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14882409572601318}],"concepts":[{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7357653379440308},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7251187562942505},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7052379846572876},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.6204769611358643},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6097633838653564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5760860443115234},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.550340473651886},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.5018255710601807},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4993560314178467},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4919254779815674},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4780636131763458},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4530255198478699},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4489525854587555},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.4474067687988281},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.442383348941803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26258212327957153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20910462737083435},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14882409572601318},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2014.6900285","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900285","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6899999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1555410326","https://openalex.org/W1741952675","https://openalex.org/W1953766815","https://openalex.org/W1964674593","https://openalex.org/W1967271207","https://openalex.org/W1986834168","https://openalex.org/W1988698908","https://openalex.org/W2005233446","https://openalex.org/W2037597655","https://openalex.org/W2037678563","https://openalex.org/W2043932195","https://openalex.org/W2057091568","https://openalex.org/W2073169693","https://openalex.org/W2099235707","https://openalex.org/W2102620188","https://openalex.org/W2107125002","https://openalex.org/W2118591900","https://openalex.org/W2126105956","https://openalex.org/W2142822379","https://openalex.org/W2152195021","https://openalex.org/W2159440015","https://openalex.org/W6640895745"],"related_works":["https://openalex.org/W2161494499","https://openalex.org/W2911636622","https://openalex.org/W2116814709","https://openalex.org/W2890524932","https://openalex.org/W3020868696","https://openalex.org/W2807679627","https://openalex.org/W2351996051","https://openalex.org/W2354218176","https://openalex.org/W2568269143","https://openalex.org/W1532417015"],"abstract_inverted_index":{"The":[0,134,153],"Flexible":[1],"Job":[2],"Shop":[3],"Problem":[4],"is":[5],"one":[6],"of":[7,112,136],"the":[8,37,75,118,144],"most":[9],"important":[10],"NP-hard":[11],"combinatorial":[12],"optimization":[13],"problems.":[14],"Evolutionary":[15,167],"computation":[16],"has":[17,46,131],"been":[18,132],"widely":[19],"used":[20],"in":[21,71,114,141],"research":[22],"concerning":[23],"this":[24,54,79,137],"problem":[25],"due":[26],"to":[27,39,73,107,116,143,157],"its":[28],"ability":[29],"for":[30,120,170],"dealing":[31],"with":[32,90,99],"large":[33],"search":[34,69,119],"spaces":[35],"and":[36,84,102,177],"possibility":[38],"optimize":[40],"multiple":[41],"objectives.":[42],"Particle":[43,87,95],"Swarm":[44,88,96],"Optimization":[45,89,97],"shown":[47,162],"good":[48,163],"results,":[49],"but":[50],"algorithms":[51],"based":[52,93],"on":[53,94],"technique":[55],"have":[56,62,161],"premature":[57],"convergence,":[58,126],"therefore":[59],"some":[60],"proposals":[61],"introduced":[63],"genetic":[64,100],"operators":[65,101],"or":[66],"other":[67,158],"local":[68,76],"methods":[70],"order":[72,115],"avoid":[74],"minima.":[77],"Therefore,":[78],"paper":[80],"presents":[81],"a":[82,109,121,127],"hybrid":[83],"multi-objective":[85],"algorithm,":[86],"Diversity":[91],"(DIPSO),":[92],"along":[98],"Fast":[103],"Non-dominated":[104],"Sorting.":[105],"Thus,":[106],"maintain":[108],"high":[110],"degree":[111],"diversity":[113],"guide":[117],"better":[122],"solution":[123],"while":[124],"ensuring":[125],"new":[128],"crossover":[129],"operator":[130,138],"introduced.":[133],"efficiency":[135],"was":[139],"tested":[140],"relation":[142],"proposed":[145],"objectives":[146],"by":[147,165],"using":[148],"typical":[149],"examples":[150],"from":[151],"literature.":[152],"results":[154,164],"were":[155],"compared":[156],"studies":[159],"that":[160],"means":[166],"Computation":[168],"technique,":[169],"instance":[171],"MOEA-GLS,":[172],"MOGA,":[173],"PSO":[174,178],"+":[175,179],"SA":[176],"TS.":[180]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}