{"id":"https://openalex.org/W2547304681","doi":"https://doi.org/10.1109/gol.2016.7731660","title":"A modified harmony search for flow shop scheduling problem","display_name":"A modified harmony search for flow shop scheduling problem","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2547304681","doi":"https://doi.org/10.1109/gol.2016.7731660","mag":"2547304681"},"language":"en","primary_location":{"id":"doi:10.1109/gol.2016.7731660","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gol.2016.7731660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 3rd International Conference on Logistics Operations Management (GOL)","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/A5030759123","display_name":"Hanna Zini","orcid":null},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":true,"raw_author_name":"Hanna Zini","raw_affiliation_strings":["Faculty of Sciences, Mohammed V University in Rabat, Morocco"],"affiliations":[{"raw_affiliation_string":"Faculty of Sciences, Mohammed V University in Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016337099","display_name":"Souad Elbernoussi","orcid":"https://orcid.org/0000-0001-7120-907X"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Souad ElBernoussi","raw_affiliation_strings":["Faculty of Sciences, Mohammed V University in Rabat, Morocco"],"affiliations":[{"raw_affiliation_string":"Faculty of Sciences, Mohammed V University in Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030759123"],"corresponding_institution_ids":["https://openalex.org/I126477371"],"apc_list":null,"apc_paid":null,"fwci":0.4246,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71918134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":null,"first_page":"1","last_page":"5"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.995199978351593,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/harmony-search","display_name":"Harmony search","score":0.8802427053451538},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7148545384407043},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.714176595211029},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6741306781768799},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6563481092453003},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5756033658981323},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.46453553438186646},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.459094375371933},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.44877752661705017},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.43534326553344727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3325275480747223},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3086243271827698},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.07671666145324707}],"concepts":[{"id":"https://openalex.org/C33099171","wikidata":"https://www.wikidata.org/wiki/Q26208718","display_name":"Harmony search","level":2,"score":0.8802427053451538},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7148545384407043},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.714176595211029},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6741306781768799},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6563481092453003},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5756033658981323},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.46453553438186646},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.459094375371933},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.44877752661705017},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.43534326553344727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3325275480747223},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3086243271827698},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.07671666145324707},{"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/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","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},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/gol.2016.7731660","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gol.2016.7731660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 3rd International Conference on Logistics Operations Management (GOL)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1794402733","https://openalex.org/W1965210974","https://openalex.org/W1977270579","https://openalex.org/W1993885071","https://openalex.org/W1996566969","https://openalex.org/W2016100316","https://openalex.org/W2038757212","https://openalex.org/W2039599707","https://openalex.org/W2053215673","https://openalex.org/W2059951675","https://openalex.org/W2061885878","https://openalex.org/W2083933508","https://openalex.org/W2086738348","https://openalex.org/W2090069860","https://openalex.org/W2111060121","https://openalex.org/W2517695413"],"related_works":["https://openalex.org/W2163159199","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/W101238908","https://openalex.org/W2165758382"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,29,36,43,53,58,83],"modified":[4],"harmony":[5],"search":[6],"(HS)":[7],"for":[8],"the":[9,15,19,65,69,74,103,108,118,121],"flow":[10],"shop":[11],"scheduling":[12],"problem,":[13],"with":[14],"objective":[16],"to":[17,41,67,97],"minimize":[18],"maximum":[20],"completion":[21],"time":[22],"of":[23,85,120,126],"all":[24],"jobs,":[25],"i.e.":[26],"makespan.":[27],"Firstly,":[28],"simple":[30],"memory":[31],"consideration":[32],"rule":[33],"based":[34],"on":[35],"recombination":[37],"operator":[38],"is":[39,50,62,95],"employed":[40],"generate":[42],"new":[44],"harmony.":[45],"Secondly,":[46],"an":[47],"insertion":[48],"procedure":[49],"used":[51],"as":[52],"pitch":[54],"adjustment":[55],"rule.":[56],"Thirdly,":[57],"neighborhood":[59],"local":[60],"strategy":[61],"embedded":[63],"into":[64],"algorithm":[66,94,123],"enhance":[68],"solution":[70,127],"quality.":[71,128],"To":[72],"validate":[73],"proposed":[75,122],"algorithm,":[76],"various":[77],"computational":[78],"tests":[79],"are":[80],"established":[81],"using":[82],"set":[84],"60":[86],"instances":[87],"from":[88,101],"Taillard":[89],"Benchmark":[90],"[1].":[91],"The":[92,114],"HS":[93],"compared":[96],"two":[98],"constructive":[99],"heuristics":[100],"literature,":[102],"NEH":[104],"heuristic":[105,111],"[2],":[106],"and":[107],"stochastic":[109],"greedy":[110],"(SG)":[112],"[6].":[113],"obtained":[115],"results":[116],"show":[117],"superiority":[119],"in":[124],"terms":[125]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-10T00:00:00"}