{"id":"https://openalex.org/W2089364174","doi":"https://doi.org/10.1145/2576768.2598324","title":"NSGA-II with iterated greedy for a bi-objective three-stage assembly flowshop scheduling problem","display_name":"NSGA-II with iterated greedy for a bi-objective three-stage assembly flowshop scheduling problem","publication_year":2014,"publication_date":"2014-07-11","ids":{"openalex":"https://openalex.org/W2089364174","doi":"https://doi.org/10.1145/2576768.2598324","mag":"2089364174"},"language":"en","primary_location":{"id":"doi:10.1145/2576768.2598324","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598324","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","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/A5016436283","display_name":"Saulo Cunha Campos","orcid":null},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Saulo Cunha Campos","raw_affiliation_strings":["Universidade Federal de Vicosa, Vicosa MG, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Vicosa, Vicosa MG, Brazil","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048750231","display_name":"Jos\u00e9 Elias Claudio Arroyo","orcid":"https://orcid.org/0000-0003-3403-4770"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 Elias Claudio Arroyo","raw_affiliation_strings":["Universidade Federal de Vicosa, Vicosa MG, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Vicosa, Vicosa MG, Brazil","institution_ids":["https://openalex.org/I146165071"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016436283"],"corresponding_institution_ids":["https://openalex.org/I146165071"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.20027336,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"429","last_page":"436"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9990000128746033,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9987000226974487,"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/tardiness","display_name":"Tardiness","score":0.742392897605896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7151013612747192},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5852120518684387},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5695559978485107},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5598472952842712},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5551389455795288},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.42393144965171814},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4126112759113312},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.32875311374664307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2945602536201477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2628527283668518}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.742392897605896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7151013612747192},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5852120518684387},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5695559978485107},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5598472952842712},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5551389455795288},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42393144965171814},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4126112759113312},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.32875311374664307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2945602536201477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2628527283668518},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2576768.2598324","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598324","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.6100000143051147,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320322980","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","ror":"https://ror.org/00nc55f03"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1521316934","https://openalex.org/W1554263409","https://openalex.org/W1558919105","https://openalex.org/W1603784330","https://openalex.org/W1977133017","https://openalex.org/W1978633877","https://openalex.org/W1991385365","https://openalex.org/W1994097602","https://openalex.org/W1996023388","https://openalex.org/W1997353791","https://openalex.org/W2044336241","https://openalex.org/W2057012624","https://openalex.org/W2068003474","https://openalex.org/W2087875896","https://openalex.org/W2089988414","https://openalex.org/W2090032764","https://openalex.org/W2090069860","https://openalex.org/W2091363003","https://openalex.org/W2095330332","https://openalex.org/W2122510010","https://openalex.org/W2126105956","https://openalex.org/W2135971727","https://openalex.org/W2148772665","https://openalex.org/W2157793635","https://openalex.org/W2157846217"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265"],"abstract_inverted_index":{"In":[0,118],"this":[1],"paper":[2],"we":[3,126],"address":[4],"a":[5,20,42,143,176],"three-stage":[6],"assembly":[7,29],"flowshop":[8,153],"scheduling":[9,154],"problem":[10,102],"where":[11],"there":[12],"are":[13,44,58,72,98],"m":[14],"machines":[15,86],"at":[16,23,31],"the":[17,24,32,36,52,55,63,67,70,85,92,96,111,162,166,169,191,194],"first":[18,37],"stage,":[19,38,54,69],"transportation":[21],"machine":[22,30],"second":[25,53],"stage":[26],"and":[27,60,91,108,175,185],"an":[28,128],"third":[33,68],"stage.":[34,65],"At":[35,51,66],"different":[39,152],"parts":[40,57,71],"of":[41,95,113,188,193],"product":[43],"manufactured":[45,56],"independently":[46],"on":[47,84,182],"parallel":[48],"production":[49],"lines.":[50],"collected":[59],"transferred":[61],"to":[62,80,110,120],"next":[64],"assembled":[73],"into":[74],"final":[75],"products.":[76],"The":[77],"objective":[78],"is":[79,142,159],"schedule":[81],"n":[82],"jobs":[83,97],"so":[87],"that":[88,146],"total":[89,93],"flowtime":[90],"tardiness":[94],"minimized":[99],"simultaneously.":[100],"This":[101],"has":[103,147],"many":[104],"applications":[105],"in":[106],"industry":[107],"belongs":[109],"class":[112],"NP-Hard":[114],"combinatorial":[115],"optimization":[116],"problems.":[117,155],"order":[119],"obtain":[121],"near":[122],"Pareto":[123],"optimal":[124],"solutions,":[125],"propose":[127],"Elitist":[129],"Non-dominated":[130],"Sorting":[131],"Genetic":[132],"Algorithm":[133],"(NSGA-II)":[134],"coupled":[135],"with":[136,172],"Iterated":[137],"Greedy":[138],"(IG)":[139],"strategy.":[140],"IG":[141,173],"simple":[144],"heuristic":[145],"shown":[148],"excellent":[149],"results":[150,163,181],"for":[151],"A":[156],"comparative":[157],"study":[158],"presented":[160],"between":[161],"obtained":[164],"using":[165],"standard":[167],"NSGA-II,":[168],"enhanced":[170],"NSGA-II":[171,196],"approach":[174],"single-objective":[177],"GRASP":[178],"heuristic.":[179],"Experimental":[180],"both":[183],"medium":[184],"large":[186],"size":[187],"instances":[189],"show":[190],"efficiency":[192],"hybrid":[195],"approach.":[197]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}