{"id":"https://openalex.org/W4413159063","doi":"https://doi.org/10.1109/sose66311.2025.11083862","title":"Hamming Distance-Based Heuristic for Flexible Job-Shop Scheduling Problems","display_name":"Hamming Distance-Based Heuristic for Flexible Job-Shop Scheduling Problems","publication_year":2025,"publication_date":"2025-06-08","ids":{"openalex":"https://openalex.org/W4413159063","doi":"https://doi.org/10.1109/sose66311.2025.11083862"},"language":"en","primary_location":{"id":"doi:10.1109/sose66311.2025.11083862","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sose66311.2025.11083862","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 20th Annual System of Systems Engineering Conference (SoSE)","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/A5028002342","display_name":"Alessandro Bozzi","orcid":"https://orcid.org/0000-0002-2436-0946"},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alessandro Bozzi","raw_affiliation_strings":["University of Genoa,Department of Informatics, Bioengineering, Robotics and Systems Engineering (DIBRIS),Genoa,Italy,16145"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Genoa,Department of Informatics, Bioengineering, Robotics and Systems Engineering (DIBRIS),Genoa,Italy,16145","institution_ids":["https://openalex.org/I83816512"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Massimo D'Inc\u00e0","orcid":null},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Massimo D'Inc\u00e0","raw_affiliation_strings":["University of Genoa,Department of Informatics, Bioengineering, Robotics and Systems Engineering (DIBRIS),Genoa,Italy,16145"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Genoa,Department of Informatics, Bioengineering, Robotics and Systems Engineering (DIBRIS),Genoa,Italy,16145","institution_ids":["https://openalex.org/I83816512"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053276966","display_name":"Enrico Zero","orcid":"https://orcid.org/0000-0002-9995-1724"},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Enrico Zero","raw_affiliation_strings":["University of Genoa,Department of Informatics, Bioengineering, Robotics and Systems Engineering (DIBRIS),Genoa,Italy,16145"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Genoa,Department of Informatics, Bioengineering, Robotics and Systems Engineering (DIBRIS),Genoa,Italy,16145","institution_ids":["https://openalex.org/I83816512"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83816512"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25488571,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9972000122070312,"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.9972000122070312,"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.9819999933242798,"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.9016000032424927,"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/computer-science","display_name":"Computer science","score":0.6559158563613892},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5843858122825623},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.558935284614563},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5422703623771667},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5218007564544678},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5183559656143188},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3776733875274658},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3301028609275818},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20613175630569458},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20566505193710327},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15279555320739746},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.09476849436759949},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.0633191168308258}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6559158563613892},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5843858122825623},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.558935284614563},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5422703623771667},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5218007564544678},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5183559656143188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3776733875274658},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3301028609275818},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20613175630569458},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20566505193710327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15279555320739746},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.09476849436759949},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0633191168308258}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/sose66311.2025.11083862","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sose66311.2025.11083862","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 20th Annual System of Systems Engineering Conference (SoSE)","raw_type":"proceedings-article"},{"id":"pmh:oai:unige.iris.cineca.it:11567/1280662","is_oa":false,"landing_page_url":"https://hdl.handle.net/11567/1280662","pdf_url":null,"source":{"id":"https://openalex.org/S4377196291","display_name":"CINECA IRIS Institutial Research Information System (University of Genoa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83816512","host_organization_name":"University of Genoa","host_organization_lineage":["https://openalex.org/I83816512"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6800000071525574}],"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/W2069961172","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W3155166764"],"abstract_inverted_index":{"The":[0],"flexible":[1],"job-shop":[2],"scheduling":[3],"problem":[4],"(FJSSP)":[5],"has":[6],"gained":[7],"significant":[8],"attention":[9],"due":[10,35],"to":[11,14,27,36,44,52,84,108,117],"its":[12],"adaptability":[13],"modern":[15],"manufacturing":[16],"systems.":[17],"However,":[18],"for":[19,134],"large-scale":[20],"production":[21],"chains,":[22],"finding":[23],"the":[24,29,37,40,45,57,63,76,80,87,97,105],"optimal":[25],"schedule":[26],"minimize":[28],"makespan":[30],"quickly":[31],"becomes":[32],"computationally":[33],"infeasible":[34],"complexity":[38],"of":[39,47,130],"solution":[41,88],"space,":[42],"leading":[43],"rise":[46],"heuristic":[48,72,98],"and":[49,94],"metaheuristic":[50],"methods":[51],"obtain":[53],"near-optimal":[54],"solutions.":[55],"In":[56],"same":[58],"direction,":[59],"this":[60],"paper":[61],"models":[62],"FJSSP":[64],"using":[65],"mixed-integer":[66],"linear":[67],"programming":[68],"(MILP),":[69],"proposing":[70],"a":[71,123,131],"method":[73],"based":[74,126],"on":[75,127],"Hamming":[77],"distance":[78],"between":[79],"problem's":[81],"binary":[82],"variables":[83],"efficiently":[85],"navigate":[86],"space.":[89],"By":[90],"iteratively":[91],"adjusting":[92],"routing":[93],"sequencing":[95],"variables,":[96],"produces":[99],"intermediate":[100],"solutions":[101,110],"that":[102],"gradually":[103],"improve":[104],"makespan,":[106],"converging":[107],"epsilon-optimal":[109],"with":[111],"considerably":[112],"reduced":[113],"computation":[114],"times":[115],"compared":[116],"exact":[118],"optimization,":[119],"as":[120],"demonstrated":[121],"in":[122],"case":[124],"study":[125],"an":[128],"instance":[129],"well-known":[132],"benchmark":[133],"FJSSP.":[135]},"counts_by_year":[],"updated_date":"2025-12-28T23:10:05.387466","created_date":"2025-10-10T00:00:00"}