{"id":"https://openalex.org/W1566884832","doi":"https://doi.org/10.1109/cec.2005.1554849","title":"Performance of Single Stage Representation Genetic Algorithms in Scheduling Flexible Flow Shops","display_name":"Performance of Single Stage Representation Genetic Algorithms in Scheduling Flexible Flow Shops","publication_year":2005,"publication_date":"2005-12-13","ids":{"openalex":"https://openalex.org/W1566884832","doi":"https://doi.org/10.1109/cec.2005.1554849","mag":"1566884832"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2005.1554849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","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/A5112884234","display_name":"Jos\u00e9 Antonio V\u00e1zquez Rodr\u00edguez","orcid":null},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"J.A. Vazquez Rodriguez","raw_affiliation_strings":["Department of Mathematical Sciences, University of Essex, UK","Dept. of Math. Sci., Essex Univ., Wivenhoe Park, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, University of Essex, UK","institution_ids":["https://openalex.org/I110002522"]},{"raw_affiliation_string":"Dept. of Math. Sci., Essex Univ., Wivenhoe Park, UK","institution_ids":["https://openalex.org/I110002522"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044495613","display_name":"Abdellah Salhi","orcid":"https://orcid.org/0000-0003-2433-2627"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. Salhi","raw_affiliation_strings":["Department of Mathematics Sciences, University of Essex, UK","Dept. of Math. Sci., Essex Univ., Wivenhoe Park, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics Sciences, University of Essex, UK","institution_ids":["https://openalex.org/I110002522"]},{"raw_affiliation_string":"Dept. of Math. Sci., Essex Univ., Wivenhoe Park, UK","institution_ids":["https://openalex.org/I110002522"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I110002522"],"apc_list":null,"apc_paid":null,"fwci":2.8462,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.88641798,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"1364","last_page":"1371"},"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.9947999715805054,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9936000108718872,"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.673431396484375},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5163339376449585},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.48174524307250977},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.48013851046562195},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4680732488632202},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.46279239654541016},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.44070714712142944},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4376462996006012},{"id":"https://openalex.org/keywords/stage","display_name":"Stage (stratigraphy)","score":0.41710221767425537},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4118730127811432},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3103507459163666},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.29906243085861206},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2568991780281067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1511179506778717},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.13581663370132446},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0828082263469696},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07440394163131714},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.06138148903846741}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.673431396484375},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5163339376449585},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.48174524307250977},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.48013851046562195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4680732488632202},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.46279239654541016},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.44070714712142944},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4376462996006012},{"id":"https://openalex.org/C146357865","wikidata":"https://www.wikidata.org/wiki/Q1123245","display_name":"Stage (stratigraphy)","level":2,"score":0.41710221767425537},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4118730127811432},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3103507459163666},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.29906243085861206},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2568991780281067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1511179506778717},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.13581663370132446},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0828082263469696},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07440394163131714},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.06138148903846741},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2005.1554849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1512383952","https://openalex.org/W1970329178","https://openalex.org/W2028826326","https://openalex.org/W2037201010","https://openalex.org/W2088304441","https://openalex.org/W2089278409","https://openalex.org/W2110224475","https://openalex.org/W2137272305","https://openalex.org/W2142183404","https://openalex.org/W2163648708","https://openalex.org/W2168079536","https://openalex.org/W2168200219","https://openalex.org/W2229348764"],"related_works":["https://openalex.org/W1513409726","https://openalex.org/W1793401994","https://openalex.org/W1567341438","https://openalex.org/W3174582865","https://openalex.org/W1832544741","https://openalex.org/W2997221951","https://openalex.org/W2045607085","https://openalex.org/W1790524900","https://openalex.org/W1508026007","https://openalex.org/W2157237248"],"abstract_inverted_index":{"This":[0],"is":[1,118],"a":[2,8],"report":[3],"on":[4,110,142],"the":[5,13,16,27,63,78,101,106,113,123,136],"performance":[6,124],"of":[7,10,15,18,26,77,83,100,125],"set":[9],"techniques":[11],"for":[12,81],"solution":[14],"problem":[17,80],"scheduling":[19],"flexible":[20],"flow":[21],"shops":[22],"(FFS).":[23],"Four":[24],"variants":[25],"single":[28],"stage":[29],"representation":[30],"genetic":[31],"algorithm":[32],"(SSRGA)":[33],"and":[34,53,95],"four":[35,84],"well":[36,61,140,152],"known":[37],"dispatching":[38,126],"rules,":[39],"first":[40,42],"in":[41,105,130],"out":[43,121],"(FIFO),":[44],"shortest":[45,54],"processing":[46,50],"times":[47,51,94],"(SPT),":[48],"longest":[49],"(LPT),":[52],"due":[55],"dates":[56],"(SDD),":[57],"are":[58,71,156],"considered":[59,129],"as":[60,62,139,141,151,153],"shifting":[64],"bottleneck":[65],"procedure":[66],"(SBP).":[67],"These":[68],"nine":[69],"approaches":[70],"applied":[72],"to":[73,119],"randomly":[74],"generated":[75],"instances":[76],"FFS":[79,143],"each":[82],"different":[85,146],"optimisation":[86,147],"criteria:":[87],"makespan,":[88],"maximum":[89],"tardiness,":[90],"total":[91,96],"weighted":[92,97],"completion":[93],"tardiness.":[98],"Because":[99],"rather":[102],"wide":[103],"gaps":[104],"previous":[107],"experimental":[108],"work":[109],"this":[111,116,131],"topic,":[112],"motivation":[114],"behind":[115],"study":[117],"find":[120],"about":[122],"rules":[127],"not":[128],"framework,":[132],"i.e.":[133],"combined":[134],"with":[135,145],"SSRGA,":[137],"before,":[138],"problems":[144],"criteria.":[148],"Computational":[149],"results":[150],"implementation":[154],"details":[155],"included.":[157]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}