{"id":"https://openalex.org/W3022593200","doi":"https://doi.org/10.3390/a13050112","title":"Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion","display_name":"Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion","publication_year":2020,"publication_date":"2020-04-29","ids":{"openalex":"https://openalex.org/W3022593200","doi":"https://doi.org/10.3390/a13050112","mag":"3022593200"},"language":"en","primary_location":{"id":"doi:10.3390/a13050112","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13050112","pdf_url":"https://www.mdpi.com/1999-4893/13/5/112/pdf?version=1588169865","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/13/5/112/pdf?version=1588169865","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083849525","display_name":"Christophe Sauvey","orcid":null},"institutions":[{"id":"https://openalex.org/I4387155471","display_name":"Laboratoire de G\u00e9nie Informatique, de Production et de Maintenance","ror":"https://ror.org/04xykxd72","country_code":null,"type":"facility","lineage":["https://openalex.org/I4210150706","https://openalex.org/I4387155471","https://openalex.org/I90183372","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Christophe Sauvey","raw_affiliation_strings":["Universit\u00e9 de Lorraine, LGIPM, F-57000 Metz, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lorraine, LGIPM, F-57000 Metz, France","institution_ids":["https://openalex.org/I90183372","https://openalex.org/I4387155471"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081982851","display_name":"Nathalie Sauer","orcid":null},"institutions":[{"id":"https://openalex.org/I4387155471","display_name":"Laboratoire de G\u00e9nie Informatique, de Production et de Maintenance","ror":"https://ror.org/04xykxd72","country_code":null,"type":"facility","lineage":["https://openalex.org/I4210150706","https://openalex.org/I4387155471","https://openalex.org/I90183372","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nathalie Sauer","raw_affiliation_strings":["Universit\u00e9 de Lorraine, LGIPM, F-57000 Metz, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lorraine, LGIPM, F-57000 Metz, France","institution_ids":["https://openalex.org/I90183372","https://openalex.org/I4387155471"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083849525"],"corresponding_institution_ids":["https://openalex.org/I4387155471","https://openalex.org/I90183372"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":2.5293,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.90554499,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"13","issue":"5","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.9925000071525574,"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.9912999868392944,"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.664090096950531},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6453166007995605},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6354027390480042},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6352365612983704},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5875555872917175},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5290994644165039},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5273980498313904},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5229859352111816},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.46616560220718384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43741652369499207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.418023020029068},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12927204370498657}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.664090096950531},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6453166007995605},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6354027390480042},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6352365612983704},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5875555872917175},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5290994644165039},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5273980498313904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5229859352111816},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.46616560220718384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43741652369499207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.418023020029068},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12927204370498657},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a13050112","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13050112","pdf_url":"https://www.mdpi.com/1999-4893/13/5/112/pdf?version=1588169865","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:HAL:hal-02559030v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02559030","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, 2020, 13 (5), pp.112. &#x27E8;10.3390/a13050112&#x27E9;","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:2f0a83f9c95946e7916a8e6be16c7460","is_oa":true,"landing_page_url":"https://doaj.org/article/2f0a83f9c95946e7916a8e6be16c7460","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 13, Iss 5, p 112 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/5/112/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a13050112","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","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13050112","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13050112","pdf_url":"https://www.mdpi.com/1999-4893/13/5/112/pdf?version=1588169865","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":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3022593200.pdf","grobid_xml":"https://content.openalex.org/works/W3022593200.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1965349461","https://openalex.org/W1993433489","https://openalex.org/W1995660472","https://openalex.org/W1996504887","https://openalex.org/W2006751452","https://openalex.org/W2015178471","https://openalex.org/W2019192981","https://openalex.org/W2024085737","https://openalex.org/W2038757212","https://openalex.org/W2059073981","https://openalex.org/W2086738348","https://openalex.org/W2088582625","https://openalex.org/W2090069860","https://openalex.org/W2092732888","https://openalex.org/W2094859983","https://openalex.org/W2110406003","https://openalex.org/W2111060121","https://openalex.org/W2118371226","https://openalex.org/W2136523903","https://openalex.org/W2149027038","https://openalex.org/W2156391157","https://openalex.org/W2530577942","https://openalex.org/W2624035465","https://openalex.org/W2766033250","https://openalex.org/W2774370703","https://openalex.org/W2795923574","https://openalex.org/W2911232601","https://openalex.org/W2911963438","https://openalex.org/W2932876104","https://openalex.org/W2991676291","https://openalex.org/W3000241456","https://openalex.org/W3000265975","https://openalex.org/W6674420161","https://openalex.org/W6676766049"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2739612537","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W2148608945","https://openalex.org/W3112689649","https://openalex.org/W2998357381","https://openalex.org/W2951352292","https://openalex.org/W2382039200"],"abstract_inverted_index":{"Since":[0],"its":[1],"creation":[2],"by":[3],"Nawaz,":[4],"Enscore,":[5],"and":[6,136],"Ham":[7],"in":[8,64,72,87],"1983,":[9],"NEH":[10,157,213],"remains":[11],"the":[12,22,29,56,61,65,106,111,133,141,159,178,190,194,206,211],"best":[13,160],"heuristic":[14],"method":[15,66,115,128,180],"to":[16,45,54,98,104,109,124,148,176],"solve":[17],"flowshop":[18],"scheduling":[19],"problems.":[20],"In":[21,47,102],"large":[23],"body":[24],"of":[25,31,74,139,166,183,193,197,203,210],"literature":[26],"dealing":[27],"with":[28,189],"application":[30],"this":[32,48],"heuristic,":[33],"it":[34],"can":[35,96],"be":[36,70],"clearly":[37],"noted":[38],"that":[39],"results":[40,92,187,209],"differ":[41],"from":[42],"one":[43],"paper":[44],"another.":[46],"paper,":[49],"two":[50,62,77,91,195],"methods":[51,196],"are":[52,93],"proposed":[53],"improve":[55],"original":[57,212],"NEH,":[58,110],"based":[59],"on":[60],"points":[63],"where":[67,156],"choices":[68],"must":[69],"made,":[71],"case":[73],"equivalence":[75],"between":[76],"job":[78],"orders":[79],"or":[80],"partial":[81,161,168],"sequences.":[82],"When":[83],"an":[84,200],"equality":[85],"occurs":[86],"a":[88,120,125,164,181],"sorting":[89],"method,":[90],"equivalent,":[94],"but":[95],"lead":[97],"different":[99],"final":[100],"results.":[101],"order":[103],"propose":[105],"first":[107,134],"improvement":[108,153,198,202],"factorial":[112],"basis":[113],"decomposition":[114],"is":[116,129,154,170],"introduced,":[117],"which":[118],"makes":[119],"number":[121],"computationally":[122],"correspond":[123],"permutation.":[126],"This":[127],"very":[130],"helpful":[131],"for":[132,144],"improvement,":[135],"allows":[137],"testing":[138],"all":[140],"sequencing":[142],"possibilities":[143],"problems":[145],"counting":[146],"up":[147],"50":[149],"jobs.":[150],"The":[151,186],"second":[152],"located":[155],"keeps":[158],"sequence.":[162],"Similarly,":[163],"list":[165],"equivalent":[167],"sequences":[169],"kept,":[171],"rather":[172],"than":[173],"only":[174],"one,":[175],"provide":[177],"global":[179],"chance":[182],"better":[184],"performance.":[185],"obtained":[188],"successive":[191],"use":[192],"present":[199],"average":[201],"19%":[204],"over":[205],"already":[207],"effective":[208],"method.":[214]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}
