{"id":"https://openalex.org/W2766033250","doi":"https://doi.org/10.3390/a10040121","title":"Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems","display_name":"Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems","publication_year":2017,"publication_date":"2017-10-28","ids":{"openalex":"https://openalex.org/W2766033250","doi":"https://doi.org/10.3390/a10040121","mag":"2766033250"},"language":"en","primary_location":{"id":"doi:10.3390/a10040121","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a10040121","pdf_url":"https://www.mdpi.com/1999-4893/10/4/121/pdf?version=1509188565","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/10/4/121/pdf?version=1509188565","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075575094","display_name":"Laxmi Bewoor","orcid":"https://orcid.org/0000-0003-3470-421X"},"institutions":[{"id":"https://openalex.org/I875944469","display_name":"Koneru Lakshmaiah Education Foundation","ror":"https://ror.org/02k949197","country_code":"IN","type":"education","lineage":["https://openalex.org/I875944469"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Laxmi Bewoor","raw_affiliation_strings":["Department of Computer Science and Engineering, K. L. University, Andhra Pradesh, Guntur 522502, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, K. L. University, Andhra Pradesh, Guntur 522502, India","institution_ids":["https://openalex.org/I875944469"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041270204","display_name":"V. Chandra Prakash","orcid":"https://orcid.org/0000-0002-5030-1122"},"institutions":[{"id":"https://openalex.org/I875944469","display_name":"Koneru Lakshmaiah Education Foundation","ror":"https://ror.org/02k949197","country_code":"IN","type":"education","lineage":["https://openalex.org/I875944469"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"V. Chandra Prakash","raw_affiliation_strings":["Department of Computer Science and Engineering, K. L. University, Andhra Pradesh, Guntur 522502, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, K. L. University, Andhra Pradesh, Guntur 522502, India","institution_ids":["https://openalex.org/I875944469"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035944595","display_name":"Sagar U. Sapkal","orcid":"https://orcid.org/0000-0002-0839-7773"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sagar Sapkal","raw_affiliation_strings":["Department of Mechanical Engineering, Walchand College of Engineering, Maharashtra, Sangli 416415, India"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Walchand College of Engineering, Maharashtra, Sangli 416415, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075575094"],"corresponding_institution_ids":["https://openalex.org/I875944469"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":2.7097,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.91157652,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"10","issue":"4","first_page":"121","last_page":"121"},"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.9965999722480774,"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/T12288","display_name":"Optimization and Search Problems","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7010982632637024},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6808385848999023},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6792198419570923},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6312413811683655},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.6144667267799377},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5875985622406006},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5782476663589478},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.49695852398872375},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4627070426940918},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.4498139023780823},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44409266114234924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25566983222961426}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7010982632637024},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6808385848999023},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6792198419570923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6312413811683655},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6144667267799377},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5875985622406006},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5782476663589478},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.49695852398872375},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4627070426940918},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.4498139023780823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44409266114234924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25566983222961426},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a10040121","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a10040121","pdf_url":"https://www.mdpi.com/1999-4893/10/4/121/pdf?version=1509188565","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:doaj.org/article:aedf603f19e849f2b6187bb0d0ec2a9c","is_oa":true,"landing_page_url":"https://doaj.org/article/aedf603f19e849f2b6187bb0d0ec2a9c","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 10, Iss 4, p 121 (2017)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/10/4/121/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a10040121","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 10; Issue 4; Pages: 121","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a10040121","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a10040121","pdf_url":"https://www.mdpi.com/1999-4893/10/4/121/pdf?version=1509188565","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":[{"display_name":"Industry, innovation and infrastructure","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2766033250.pdf","grobid_xml":"https://content.openalex.org/works/W2766033250.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1948967705","https://openalex.org/W1965334058","https://openalex.org/W1970140199","https://openalex.org/W1972789041","https://openalex.org/W1972819258","https://openalex.org/W1984642568","https://openalex.org/W2011008176","https://openalex.org/W2013827997","https://openalex.org/W2019703523","https://openalex.org/W2022506544","https://openalex.org/W2031144267","https://openalex.org/W2034282101","https://openalex.org/W2039568841","https://openalex.org/W2052272326","https://openalex.org/W2053215673","https://openalex.org/W2056630065","https://openalex.org/W2060146414","https://openalex.org/W2079003114","https://openalex.org/W2079896882","https://openalex.org/W2087275785","https://openalex.org/W2090069860","https://openalex.org/W2101097701","https://openalex.org/W2109364787","https://openalex.org/W2117332871","https://openalex.org/W2129449782","https://openalex.org/W2156391157","https://openalex.org/W2159427933","https://openalex.org/W2168079536","https://openalex.org/W2168397479","https://openalex.org/W2170716909","https://openalex.org/W2407506046","https://openalex.org/W2539426768","https://openalex.org/W2557297710","https://openalex.org/W2568371585","https://openalex.org/W2736658921","https://openalex.org/W4235332010","https://openalex.org/W6646557988","https://openalex.org/W6672959708","https://openalex.org/W6685177314","https://openalex.org/W6730106569"],"related_works":["https://openalex.org/W4321504838","https://openalex.org/W2794855054","https://openalex.org/W2081475278","https://openalex.org/W2005169299","https://openalex.org/W150166259","https://openalex.org/W2606087467","https://openalex.org/W2085776465","https://openalex.org/W1540477665","https://openalex.org/W2314520391","https://openalex.org/W3087663609"],"abstract_inverted_index":{"The":[0,26,49,159,250],"no-wait":[1,30,112],"flow":[2,31,113,124],"shop":[3,32,114],"is":[4,13,255],"a":[5,29,80,89,137,155,189],"flowshop":[6],"in":[7,43,69,197,239,252],"which":[8,42],"the":[9,56,62,118,122,140,147,166,178,203,232,236,247],"scheduling":[10,27,59,115],"of":[11,28,38,58,64,120,126,152,180,206,241,260],"jobs":[12,39],"continuous":[14,148],"and":[15,72,95,171,200,209,225,244],"simultaneous":[16],"through":[17],"all":[18],"machines":[19],"without":[20],"waiting":[21],"for":[22,40,54,60,110,145,246],"any":[23],"consecutive":[24],"machines.":[25],"requires":[33,87],"finding":[34,55,88],"an":[35,101,173],"appropriate":[36,204],"sequence":[37],"scheduling,":[41],"turn":[44],"reduces":[45],"total":[46,123],"processing":[47],"time.":[48],"classical":[50],"brute":[51],"force":[52],"method":[53],"probabilities":[57],"improving":[61],"utilization":[63],"resources":[65],"may":[66],"become":[67],"trapped":[68],"local":[70,190,198,210],"optima,":[71],"this":[73],"problem":[74,85,248],"can":[75],"hence":[76],"be":[77],"observed":[78],"as":[79,182,184],"typical":[81],"NP-hard":[82],"combinatorial":[83],"optimization":[84],"that":[86,231],"near":[90],"optimal":[91],"solution":[92,138,253],"with":[93,117,165,227],"heuristic":[94,169],"metaheuristic":[96,108],"techniques.":[97],"This":[98,128],"paper":[99],"proposes":[100],"effective":[102],"hybrid":[103],"Particle":[104,131],"Swarm":[105,132],"Optimization":[106,133],"(PSO)":[107],"algorithm":[109,135,161,234],"solving":[111],"problems":[116],"objective":[119],"minimizing":[121],"time":[125],"jobs.":[127],"Proposed":[129],"Hybrid":[130],"(PHPSO)":[134],"presents":[136],"by":[139,177,257],"random":[141],"key":[142],"representation":[143],"rule":[144],"converting":[146],"position":[149],"information":[150],"values":[151],"particles":[153],"to":[154,193,201],"discrete":[156],"job":[157],"permutation.":[158],"proposed":[160],"initializes":[162],"population":[163],"efficiently":[164],"Nawaz-Enscore-Ham":[167],"(NEH)":[168],"technique":[170],"uses":[172],"evolutionary":[174],"search":[175,192,243],"guided":[176],"mechanism":[179],"PSO,":[181],"well":[183],"simulated":[185],"annealing":[186],"based":[187,218],"on":[188,219],"neighborhood":[191],"avoid":[194],"getting":[195],"stuck":[196],"optima":[199],"provide":[202],"balance":[205],"global":[207],"exploration":[208],"exploitation.":[211],"Extensive":[212],"computational":[213],"experiments":[214],"are":[215],"carried":[216],"out":[217],"Taillard\u2019s":[220],"benchmark":[221],"suite.":[222],"Computational":[223],"results":[224],"comparisons":[226],"existing":[228,237],"metaheuristics":[229],"show":[230],"PHPSO":[233],"outperforms":[235],"methods":[238],"terms":[240],"quality":[242,254],"robustness":[245],"considered.":[249],"improvement":[251],"confirmed":[256],"statistical":[258],"tests":[259],"significance.":[261]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}