{"id":"https://openalex.org/W3140892500","doi":"https://doi.org/10.3390/a14040112","title":"An Effective Decomposition-Based Stochastic Algorithm for Solving the Permutation Flow-Shop Scheduling Problem","display_name":"An Effective Decomposition-Based Stochastic Algorithm for Solving the Permutation Flow-Shop Scheduling Problem","publication_year":2021,"publication_date":"2021-03-30","ids":{"openalex":"https://openalex.org/W3140892500","doi":"https://doi.org/10.3390/a14040112","mag":"3140892500"},"language":"en","primary_location":{"id":"doi:10.3390/a14040112","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14040112","pdf_url":"https://www.mdpi.com/1999-4893/14/4/112/pdf?version=1618906729","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/4/112/pdf?version=1618906729","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034090061","display_name":"Mehrdad Amirghasemi","orcid":"https://orcid.org/0000-0001-8466-1380"},"institutions":[{"id":"https://openalex.org/I204824540","display_name":"University of Wollongong","ror":"https://ror.org/00jtmb277","country_code":"AU","type":"education","lineage":["https://openalex.org/I204824540"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Mehrdad Amirghasemi","raw_affiliation_strings":["SMART Infrastructure Facility, Faculty of Engineering and Information Sciences, University of Wollongong, Wollongong, NSW 2522, Australia"],"affiliations":[{"raw_affiliation_string":"SMART Infrastructure Facility, Faculty of Engineering and Information Sciences, University of Wollongong, Wollongong, NSW 2522, Australia","institution_ids":["https://openalex.org/I204824540"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034090061"],"corresponding_institution_ids":["https://openalex.org/I204824540"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.8895,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78028292,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":97},"biblio":{"volume":"14","issue":"4","first_page":"112","last_page":"112"},"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.9954000115394592,"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.9940000176429749,"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/permutation","display_name":"Permutation (music)","score":0.7229218482971191},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.5692538619041443},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5336132049560547},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5335633754730225},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5321140885353088},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5234736204147339},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5077720284461975},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5069213509559631},{"id":"https://openalex.org/keywords/random-permutation","display_name":"Random permutation","score":0.5042301416397095},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46825844049453735},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.464089572429657},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4218597412109375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3850957453250885},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.3718665540218353},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.0848529040813446},{"id":"https://openalex.org/keywords/symmetric-group","display_name":"Symmetric group","score":0.07405322790145874}],"concepts":[{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.7229218482971191},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5692538619041443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5336132049560547},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5335633754730225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5321140885353088},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5234736204147339},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5077720284461975},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5069213509559631},{"id":"https://openalex.org/C200985842","wikidata":"https://www.wikidata.org/wiki/Q3375503","display_name":"Random permutation","level":3,"score":0.5042301416397095},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46825844049453735},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.464089572429657},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4218597412109375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3850957453250885},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.3718665540218353},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0848529040813446},{"id":"https://openalex.org/C128622974","wikidata":"https://www.wikidata.org/wiki/Q849512","display_name":"Symmetric group","level":2,"score":0.07405322790145874},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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":4,"locations":[{"id":"doi:10.3390/a14040112","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14040112","pdf_url":"https://www.mdpi.com/1999-4893/14/4/112/pdf?version=1618906729","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:ro.uow.edu.au:test2021-2345","is_oa":false,"landing_page_url":"https://ro.uow.edu.au/test2021/1336","pdf_url":null,"source":{"id":"https://openalex.org/S4306400510","display_name":"Research Online (University of Wollongong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I204824540","host_organization_name":"University of Wollongong","host_organization_lineage":["https://openalex.org/I204824540"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Test Series for Scopus Harvesting 2021","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:d5051684391f4556b80b082530b2f399","is_oa":true,"landing_page_url":"https://doaj.org/article/d5051684391f4556b80b082530b2f399","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 4, p 112 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/4/112/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14040112","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 14; Issue 4; Pages: 112","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14040112","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14040112","pdf_url":"https://www.mdpi.com/1999-4893/14/4/112/pdf?version=1618906729","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3140892500.pdf","grobid_xml":"https://content.openalex.org/works/W3140892500.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W1965598761","https://openalex.org/W1970320473","https://openalex.org/W1971769204","https://openalex.org/W1972819258","https://openalex.org/W1985351347","https://openalex.org/W1986945669","https://openalex.org/W2001080175","https://openalex.org/W2004512235","https://openalex.org/W2006389447","https://openalex.org/W2006751452","https://openalex.org/W2008665401","https://openalex.org/W2018028283","https://openalex.org/W2024085737","https://openalex.org/W2031757528","https://openalex.org/W2032257665","https://openalex.org/W2037524044","https://openalex.org/W2038757212","https://openalex.org/W2049852265","https://openalex.org/W2052516622","https://openalex.org/W2052558990","https://openalex.org/W2073601282","https://openalex.org/W2076293397","https://openalex.org/W2078211329","https://openalex.org/W2089155447","https://openalex.org/W2090069860","https://openalex.org/W2092732888","https://openalex.org/W2096166399","https://openalex.org/W2111972521","https://openalex.org/W2118371226","https://openalex.org/W2119225931","https://openalex.org/W2123411720","https://openalex.org/W2125827607","https://openalex.org/W2137849348","https://openalex.org/W2148948822","https://openalex.org/W2153137830","https://openalex.org/W2156391157","https://openalex.org/W2157846217","https://openalex.org/W2162535720","https://openalex.org/W2262063692","https://openalex.org/W2273663414","https://openalex.org/W2530577942","https://openalex.org/W2600961830","https://openalex.org/W2624035465","https://openalex.org/W3027963920","https://openalex.org/W3047612592","https://openalex.org/W3089152325","https://openalex.org/W3123901663"],"related_works":["https://openalex.org/W2184131469","https://openalex.org/W30690955","https://openalex.org/W2612803944","https://openalex.org/W2978804656","https://openalex.org/W4321748008","https://openalex.org/W2074196947","https://openalex.org/W2797610470","https://openalex.org/W1887300513","https://openalex.org/W4312051210","https://openalex.org/W133107828"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3,60,111],"effective":[4],"stochastic":[5],"algorithm":[6,27,155],"that":[7,188],"embeds":[8],"a":[9,15,30,33,36,88,115,191,204,217],"large":[10,122],"neighborhood":[11,17,90,123],"decomposition":[12,106,137],"technique":[13],"into":[14,52],"variable":[16,89],"search":[18,91],"for":[19,57,114],"solving":[20],"the":[21,40,47,67,72,80,85,96,105,120,125,128,136,149,154,160,179,183,196,211,220,228],"permutation":[22,31,62,161],"flow-shop":[23],"scheduling":[24],"problem.":[25,43,70],"The":[26,93,173],"first":[28,97],"constructs":[29],"as":[32,95],"seed":[34],"using":[35],"recursive":[37],"application":[38,86],"of":[39,87,117,127,148,159,175,195,210],"extended":[41,68],"two-machine":[42,69],"In":[44,119,151,208],"this":[45,99,152],"method,":[46],"jobs":[48],"are":[49,199],"recursively":[50],"decomposed":[51],"two":[53],"separate":[54],"groups,":[55],"and,":[56],"each":[58],"group,":[59],"optimal":[61,112],"is":[63,76,82,101],"calculated":[64,200],"based":[65,103],"on":[66,104,169,178,203],"Then":[71],"overall":[73],"permutation,":[74],"which":[75,162],"obtained":[77],"by":[78],"integrating":[79],"sub-solutions,":[81],"improved":[83],"through":[84],"technique.":[92],"same":[94],"technique,":[98],"one":[100],"also":[102],"paradigm":[107],"and":[108,142,167],"can":[109],"find":[110],"arrangement":[113],"subset":[116],"jobs.":[118],"employed":[121],"search,":[124],"concept":[126],"critical":[129],"path":[130],"has":[131],"been":[132],"used":[133],"to":[134,215],"help":[135],"process":[138],"avoid":[139],"unfruitful":[140],"computation":[141],"arrange":[143],"only":[144],"promising":[145],"contiguous":[146],"parts":[147,158],"permutation.":[150],"fashion,":[153],"leaves":[156],"those":[157],"already":[163],"have":[164],"high-quality":[165,218],"arrangements":[166],"concentrates":[168],"modifying":[170],"other":[171],"parts.":[172],"results":[174],"computational":[176],"experiments":[177],"benchmark":[180],"instances":[181],"indicate":[182],"procedure":[184,221],"works":[185],"effectively,":[186],"demonstrating":[187],"solutions,":[189,198],"in":[190,227],"very":[192],"short":[193],"distance":[194],"best-known":[197],"within":[201],"seconds":[202],"typical":[205],"personal":[206],"computer.":[207],"terms":[209],"required":[212],"running":[213],"time":[214],"reach":[216],"solution,":[219],"outperforms":[222],"some":[223],"well-known":[224],"metaheuristic":[225],"algorithms":[226],"literature.":[229]},"counts_by_year":[{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}