{"id":"https://openalex.org/W2070097793","doi":"https://doi.org/10.1109/cec.2013.6557755","title":"A memetic algorithm for Permutation Flow Shop Problems","display_name":"A memetic algorithm for Permutation Flow Shop Problems","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2070097793","doi":"https://doi.org/10.1109/cec.2013.6557755","mag":"2070097793"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2013.6557755","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557755","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on 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/A5041169672","display_name":"Humyun Fuad Rahman","orcid":"https://orcid.org/0000-0002-6097-7978"},"institutions":[{"id":"https://openalex.org/I188329596","display_name":"University of Canberra","ror":"https://ror.org/04s1nv328","country_code":"AU","type":"education","lineage":["https://openalex.org/I188329596"]},{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Humyun F. Rahman","raw_affiliation_strings":["School of Engineering and Information Technology, University of New South Wales, Canberra, Australia","School of Engineering and Information Technology, University of New South Wales, Canberra, NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Information Technology, University of New South Wales, Canberra, Australia","institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"]},{"raw_affiliation_string":"School of Engineering and Information Technology, University of New South Wales, Canberra, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027440671","display_name":"Ruhul Sarker","orcid":"https://orcid.org/0000-0002-1363-2774"},"institutions":[{"id":"https://openalex.org/I188329596","display_name":"University of Canberra","ror":"https://ror.org/04s1nv328","country_code":"AU","type":"education","lineage":["https://openalex.org/I188329596"]},{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ruhul A. Sarker","raw_affiliation_strings":["School of Engineering and Information Technology, University of New South Wales, Canberra, Australia","School of Engineering and Information Technology, University of New South Wales, Canberra, NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Information Technology, University of New South Wales, Canberra, Australia","institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"]},{"raw_affiliation_string":"School of Engineering and Information Technology, University of New South Wales, Canberra, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003507463","display_name":"Daryl Essam","orcid":"https://orcid.org/0000-0002-6923-7079"},"institutions":[{"id":"https://openalex.org/I188329596","display_name":"University of Canberra","ror":"https://ror.org/04s1nv328","country_code":"AU","type":"education","lineage":["https://openalex.org/I188329596"]},{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Daryl L. Essam","raw_affiliation_strings":["School of Engineering and Information Technology, University of New South Wales, Canberra, Australia","School of Engineering and Information Technology, University of New South Wales, Canberra, NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Information Technology, University of New South Wales, Canberra, Australia","institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"]},{"raw_affiliation_string":"School of Engineering and Information Technology, University of New South Wales, Canberra, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1941,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.93502342,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"17","issue":null,"first_page":"1618","last_page":"1625"},"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.989300012588501,"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.9872000217437744,"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.7892482280731201},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7338578701019287},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6803905963897705},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6095627546310425},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6087985038757324},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6081725358963013},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5813093781471252},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4579041004180908},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44371670484542847},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.41636693477630615},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.28621017932891846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21964171528816223},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10052517056465149}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.7892482280731201},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7338578701019287},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6803905963897705},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6095627546310425},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6087985038757324},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6081725358963013},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5813093781471252},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4579041004180908},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44371670484542847},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.41636693477630615},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.28621017932891846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21964171528816223},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10052517056465149},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2013.6557755","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557755","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1970320473","https://openalex.org/W1971769204","https://openalex.org/W1984701290","https://openalex.org/W1993433489","https://openalex.org/W2004512235","https://openalex.org/W2008665401","https://openalex.org/W2024085737","https://openalex.org/W2026541491","https://openalex.org/W2032257665","https://openalex.org/W2037524044","https://openalex.org/W2038757212","https://openalex.org/W2052516622","https://openalex.org/W2088123758","https://openalex.org/W2090069860","https://openalex.org/W2117503054","https://openalex.org/W2125827607","https://openalex.org/W2156391157","https://openalex.org/W2157846217"],"related_works":["https://openalex.org/W1835156121","https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018"],"abstract_inverted_index":{"The":[0,64,86],"Permutation":[1],"Flow":[2],"Shop":[3],"Scheduling":[4],"Problem":[5],"(PFSP)":[6],"is":[7,96],"a":[8,16,36,71],"well-known":[9],"combinatorial":[10],"optimization":[11],"problem.":[12],"In":[13],"this":[14],"paper,":[15],"Genetic":[17],"Algorithm":[18],"(GA)":[19],"based":[20],"approach":[21],"has":[22,66],"been":[23,55,67,81],"developed":[24],"to":[25,57,69],"solve":[26,70],"PFSP,":[27],"with":[28,83],"the":[29,33,59,62,78,90,94],"objective":[30],"of":[31,38,61,73,93],"minimizing":[32],"makespan":[34],"for":[35],"set":[37,72],"jobs.":[39],"Two":[40],"new":[41],"priority":[42],"rules;":[43],"such":[44],"as":[45],"Gap":[46],"Filling":[47],"(GF)":[48],"technique":[49],"and":[50,77],"Job":[51],"Shifting":[52],"(JS),":[53],"have":[54,80],"introduced":[56],"enhance":[58],"performance":[60,92],"GA.":[63],"algorithm":[65,95],"used":[68],"standard":[74],"benchmark":[75],"problems":[76],"results":[79],"compared":[82],"state-of-the-art":[84],"algorithms.":[85],"comparison":[87],"demonstrates":[88],"that":[89],"overall":[91],"quite":[97],"satisfactory.":[98]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}