{"id":"https://openalex.org/W2466917640","doi":"https://doi.org/10.17562/pb-53-10","title":"An Efficient Iterated Greedy Algorithm for the Makespan Blocking Flow Shop Scheduling Problem","display_name":"An Efficient Iterated Greedy Algorithm for the Makespan Blocking Flow Shop Scheduling Problem","publication_year":2016,"publication_date":"2016-01-31","ids":{"openalex":"https://openalex.org/W2466917640","doi":"https://doi.org/10.17562/pb-53-10","mag":"2466917640"},"language":"en","primary_location":{"id":"doi:10.17562/pb-53-10","is_oa":false,"landing_page_url":"https://doi.org/10.17562/pb-53-10","pdf_url":null,"source":{"id":"https://openalex.org/S4210186437","display_name":"Polibits","issn_l":"1870-9044","issn":["1870-9044","2395-8618"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Polibits","raw_type":"journal-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/A5006022282","display_name":"Nouha Nouri","orcid":"https://orcid.org/0000-0001-8468-0944"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nouha Nouri","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5071634333","display_name":"Talel Ladhari","orcid":"https://orcid.org/0000-0002-5648-1398"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Talel Ladhari","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006022282"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4246,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.69508533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"53","issue":null,"first_page":"91","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9979000091552734,"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":0.9979000091552734,"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.9882000088691711,"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.960099995136261,"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.8243213891983032},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7118856906890869},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6975427269935608},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.6488888263702393},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.616409420967102},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5459075570106506},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4762175977230072},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.44924044609069824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4397633373737335},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.43542274832725525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3313191533088684},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.07598268985748291}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8243213891983032},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7118856906890869},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6975427269935608},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.6488888263702393},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.616409420967102},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5459075570106506},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4762175977230072},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.44924044609069824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4397633373737335},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.43542274832725525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3313191533088684},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.07598268985748291},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.17562/pb-53-10","is_oa":false,"landing_page_url":"https://doi.org/10.17562/pb-53-10","pdf_url":null,"source":{"id":"https://openalex.org/S4210186437","display_name":"Polibits","issn_l":"1870-9044","issn":["1870-9044","2395-8618"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Polibits","raw_type":"journal-article"},{"id":"pmh:oai:redalyc.org:402646943011","is_oa":false,"landing_page_url":"https://www.redalyc.org/articulo.oa?id=402646943011","pdf_url":null,"source":{"id":"https://openalex.org/S4377196100","display_name":"Redalyc (Universidad Aut\u00f3noma del Estado de M\u00e9xico)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I179647637","host_organization_name":"Universidad Aut\u00f3noma del Estado de M\u00e9xico","host_organization_lineage":["https://openalex.org/I179647637"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Polibits (M\u00e9xico) Vol.53","raw_type":"art\u00edculo cient\u00edfico"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6299999952316284,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W26892725","https://openalex.org/W2559484340","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W3155166764"],"abstract_inverted_index":{"\"We":[0],"propose":[1],"in":[2,91],"this":[3],"paper":[4],"a":[5],"Blocking":[6],"Iterated":[7],"Greedy":[8],"algorithm":[9,39],"(BIG)":[10],"which":[11],"makes":[12],"an":[13,42],"adjustment":[14],"between":[15],"two":[16],"relevant":[17],"destruction":[18],"and":[19,30,59,67,87],"construction":[20],"stages":[21],"to":[22],"solve":[23],"the":[24,32,61,70,77],"blocking":[25],"flow":[26],"shop":[27],"scheduling":[28],"problem":[29],"minimize":[31],"maximum":[33],"completion":[34],"time":[35],"(makespan).":[36],"The":[37,65],"greedy":[38],"starts":[40],"from":[41,75],"initial":[43],"solution":[44],"generated":[45,85],"based":[46],"on":[47,81,88],"some":[48,56],"well-known":[49],"heuristic.":[50],"Then,":[51],"solutions":[52],"are":[53,73],"enhanced":[54],"till":[55],"stopping":[57],"condition":[58],"through":[60],"above":[62],"mentioned":[63],"stages.":[64],"effectiveness":[66],"efficiency":[68],"of":[69],"proposed":[71],"technique":[72],"deduced":[74],"all":[76],"experimental":[78],"results":[79],"obtained":[80],"both":[82],"small":[83],"randomly":[84],"instances":[86],"Taillard\u2019s":[89],"benchmark":[90],"comparison":[92],"with":[93],"state-of-the-art":[94],"methods.\"":[95]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}