{"id":"https://openalex.org/W4232195336","doi":"https://doi.org/10.1080/18756891.2010.9727747","title":"A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem","display_name":"A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W4232195336","doi":"https://doi.org/10.1080/18756891.2010.9727747"},"language":"en","primary_location":{"id":"doi:10.1080/18756891.2010.9727747","is_oa":true,"landing_page_url":"https://doi.org/10.1080/18756891.2010.9727747","pdf_url":null,"source":{"id":"https://openalex.org/S190680769","display_name":"International Journal of Computational Intelligence Systems","issn_l":"1875-6883","issn":["1875-6883","1875-6891"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1080/18756891.2010.9727747","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073080302","display_name":"Fardin Ahmadizar","orcid":"https://orcid.org/0000-0002-8615-9893"},"institutions":[{"id":"https://openalex.org/I3124704065","display_name":"University of Kurdistan","ror":"https://ror.org/04k89yk85","country_code":"IR","type":"education","lineage":["https://openalex.org/I3124704065"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Fardin Ahmadizar","raw_affiliation_strings":["Department of Industrial Engineering , University of Kurdistan , Pasdaran Boulvard, Sanandaj , Iran"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering , University of Kurdistan , Pasdaran Boulvard, Sanandaj , Iran","institution_ids":["https://openalex.org/I3124704065"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037493019","display_name":"Farnaz Barzinpour","orcid":"https://orcid.org/0000-0001-9692-4432"},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Farnaz Barzinpour","raw_affiliation_strings":["Department of Industrial Engineering , Iran University of Science and Technology , Narmak , Tehran , 16846_13114 , Iran E-mail: barzinpour@iust.ac.ir"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering , Iran University of Science and Technology , Narmak , Tehran , 16846_13114 , Iran E-mail: barzinpour@iust.ac.ir","institution_ids":["https://openalex.org/I67009956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073080302"],"corresponding_institution_ids":["https://openalex.org/I3124704065"],"apc_list":{"value":1390,"currency":"GBP","value_usd":1704},"apc_paid":{"value":1390,"currency":"GBP","value_usd":1704},"fwci":7.3065585,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.9664552,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"3","issue":"6","first_page":"853","last_page":"861"},"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.9962000250816345,"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.9951000213623047,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8191523551940918},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6921859979629517},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6450919508934021},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6291341781616211},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5372554659843445},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.530967116355896},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5154176950454712},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.4906577169895172},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4570886790752411},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4545627236366272},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4510098397731781},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44004765152931213},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4118420481681824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2478868067264557},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.10053268074989319}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8191523551940918},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6921859979629517},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6450919508934021},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6291341781616211},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5372554659843445},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.530967116355896},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5154176950454712},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.4906577169895172},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4570886790752411},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4545627236366272},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4510098397731781},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44004765152931213},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4118420481681824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2478868067264557},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.10053268074989319},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/18756891.2010.9727747","is_oa":true,"landing_page_url":"https://doi.org/10.1080/18756891.2010.9727747","pdf_url":null,"source":{"id":"https://openalex.org/S190680769","display_name":"International Journal of Computational Intelligence Systems","issn_l":"1875-6883","issn":["1875-6883","1875-6891"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1080/18756891.2010.9727747","is_oa":true,"landing_page_url":"https://doi.org/10.1080/18756891.2010.9727747","pdf_url":null,"source":{"id":"https://openalex.org/S190680769","display_name":"International Journal of Computational Intelligence Systems","issn_l":"1875-6883","issn":["1875-6883","1875-6891"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W250249669","https://openalex.org/W1965598761","https://openalex.org/W1970320473","https://openalex.org/W1975130490","https://openalex.org/W1984701290","https://openalex.org/W1986801119","https://openalex.org/W1989202771","https://openalex.org/W1992350316","https://openalex.org/W1997363303","https://openalex.org/W2002147970","https://openalex.org/W2004274396","https://openalex.org/W2008665401","https://openalex.org/W2011334426","https://openalex.org/W2014330046","https://openalex.org/W2014933665","https://openalex.org/W2015178471","https://openalex.org/W2018028283","https://openalex.org/W2018353230","https://openalex.org/W2021332592","https://openalex.org/W2022369810","https://openalex.org/W2023170315","https://openalex.org/W2026694496","https://openalex.org/W2027762661","https://openalex.org/W2032257665","https://openalex.org/W2033524525","https://openalex.org/W2037524044","https://openalex.org/W2038757212","https://openalex.org/W2041091377","https://openalex.org/W2044347520","https://openalex.org/W2050942141","https://openalex.org/W2052115917","https://openalex.org/W2052516622","https://openalex.org/W2053215673","https://openalex.org/W2065768294","https://openalex.org/W2073730493","https://openalex.org/W2076293397","https://openalex.org/W2079003114","https://openalex.org/W2082856046","https://openalex.org/W2083289500","https://openalex.org/W2087079830","https://openalex.org/W2088123758","https://openalex.org/W2090069860","https://openalex.org/W2095004245","https://openalex.org/W2095150268","https://openalex.org/W2107941094","https://openalex.org/W2108186618","https://openalex.org/W2117503054","https://openalex.org/W2148948822","https://openalex.org/W2154929945","https://openalex.org/W2156391157","https://openalex.org/W2157846217","https://openalex.org/W2333964891","https://openalex.org/W2506108511"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2182624400"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3,123],"the":[4,15,71,85,98,119,132,135,138],"permutation":[5],"flow":[6],"shop":[7],"scheduling":[8],"problem.":[9],"The":[10,52,109],"objective":[11],"is":[12,48,55,80,112],"to":[13,29,56,60,83,104,114,130],"minimize":[14],"maximum":[16],"completion":[17],"time,":[18],"or":[19],"makespan.":[20],"To":[21],"solve":[22],"this":[23],"problem":[24],"which":[25],"has":[26],"been":[27],"proved":[28],"be":[30],"strongly":[31],"NP-hard,":[32],"a":[33,40,44,65,105],"combination":[34],"between":[35],"an":[36],"ant":[37],"colony":[38],"algorithm,":[39],"heuristic":[41,73],"algorithm":[42,111,136],"and":[43,50,74,121,142],"local":[45,78],"search":[46,79],"procedure":[47],"proposed":[49,110],"presented.":[51],"hybrid":[53],"approach":[54],"use":[57],"artificial":[58],"ants":[59,93],"construct":[61],"solutions":[62],"by":[63],"applying":[64],"stochastic":[66],"greedy":[67],"rule":[68],"based":[69],"on":[70],"Gupta's":[72],"pheromone":[75,99],"trails.":[76],"A":[77],"then":[81],"performed":[82],"improve":[84],"performance":[86],"quality":[87,139],"of":[88,134,140],"constructed":[89],"solutions.":[90],"Once":[91],"all":[92],"have":[94],"terminated":[95],"their":[96],"generations,":[97],"trails":[100],"are":[101,128],"modified":[102],"according":[103],"global":[106],"updating":[107],"rule.":[108],"applied":[113],"benchmark":[115],"problems":[116],"taken":[117],"from":[118],"literature":[120],"compared":[122],"other":[124],"metaheuristics.":[125],"Computational":[126],"experiments":[127],"given":[129],"demonstrate":[131],"superiority":[133],"in":[137],"solution":[141],"CPU":[143],"time.":[144]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}