{"id":"https://openalex.org/W2786195493","doi":"https://doi.org/10.1109/ssci.2017.8285185","title":"Evaluating decomposition strategies to enable scalable scheduling for a real-world multi-line steel scheduling problem","display_name":"Evaluating decomposition strategies to enable scalable scheduling for a real-world multi-line steel scheduling problem","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2786195493","doi":"https://doi.org/10.1109/ssci.2017.8285185","mag":"2786195493"},"language":"en","primary_location":{"id":"doi:10.1109/ssci.2017.8285185","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8285185","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://discovery.ucl.ac.uk/10059808/1/IEEE_SSCI17.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008041851","display_name":"Manal T. Adham","orcid":null},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Manal T. Adham","raw_affiliation_strings":["University College London Computer Science, London"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College London Computer Science, London","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017277682","display_name":"Peter J. Bentley","orcid":"https://orcid.org/0000-0001-6744-9302"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Peter J. Bentley","raw_affiliation_strings":["University College London Computer Science, London"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College London Computer Science, London","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072225420","display_name":"Diego D\u00edaz","orcid":"https://orcid.org/0000-0003-1514-9935"},"institutions":[{"id":"https://openalex.org/I4210123752","display_name":"ArcelorMittal (Spain)","ror":"https://ror.org/02j3enb93","country_code":"ES","type":"company","lineage":["https://openalex.org/I4210123752","https://openalex.org/I50754188"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Diego Diaz","raw_affiliation_strings":["ArcelorMittal Global R&D R&D Asturias, Asturias"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ArcelorMittal Global R&D R&D Asturias, Asturias","institution_ids":["https://openalex.org/I4210123752"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28650202,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"43","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"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.9988999962806702,"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.9829999804496765,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9664999842643738,"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/computer-science","display_name":"Computer science","score":0.722050666809082},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6828085780143738},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6759931445121765},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.6537296772003174},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5973374843597412},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47651398181915283},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43332424759864807},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.43083661794662476},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.42582905292510986},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.4229956865310669},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4192246198654175},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.288127601146698},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1948224902153015},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17026928067207336},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1402735412120819},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.09301578998565674}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.722050666809082},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6828085780143738},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6759931445121765},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.6537296772003174},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5973374843597412},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47651398181915283},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43332424759864807},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.43083661794662476},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.42582905292510986},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.4229956865310669},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4192246198654175},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.288127601146698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1948224902153015},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17026928067207336},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1402735412120819},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.09301578998565674},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ssci.2017.8285185","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8285185","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10059808","is_oa":true,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10059808/","pdf_url":"https://discovery.ucl.ac.uk/10059808/1/IEEE_SSCI17.pdf","source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In:   (Proceedings) IEEE Symposium Series on Computational Intelligence (IEEE SSCI). (pp. pp. 3130-3137).  IEEE (2017)     ","raw_type":"Proceedings paper"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10059809","is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10059809/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In:   (Proceedings) 2017 IEEE Symposium Series on Computational Intelligence (SSCI). (pp. pp. 1-8).  IEEE (2017)     ","raw_type":"Proceedings paper"}],"best_oa_location":{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10059808","is_oa":true,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10059808/","pdf_url":"https://discovery.ucl.ac.uk/10059808/1/IEEE_SSCI17.pdf","source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In:   (Proceedings) IEEE Symposium Series on Computational Intelligence (IEEE SSCI). (pp. pp. 3130-3137).  IEEE (2017)     ","raw_type":"Proceedings paper"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4699999988079071}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321441","display_name":"ArcelorMittal","ror":"https://ror.org/02bez8p50"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2786195493.pdf"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W2266336","https://openalex.org/W65738273","https://openalex.org/W150416932","https://openalex.org/W1513575564","https://openalex.org/W1543233058","https://openalex.org/W1605569301","https://openalex.org/W1617230687","https://openalex.org/W1647225459","https://openalex.org/W1968594877","https://openalex.org/W1979806025","https://openalex.org/W1992419399","https://openalex.org/W2017902784","https://openalex.org/W2019175943","https://openalex.org/W2024060531","https://openalex.org/W2028047126","https://openalex.org/W2044525431","https://openalex.org/W2058937865","https://openalex.org/W2064924704","https://openalex.org/W2073459066","https://openalex.org/W2081845611","https://openalex.org/W2089783325","https://openalex.org/W2094426896","https://openalex.org/W2095095223","https://openalex.org/W2105560970","https://openalex.org/W2116872250","https://openalex.org/W2126160338","https://openalex.org/W2126926002","https://openalex.org/W2127218421","https://openalex.org/W2136858951","https://openalex.org/W2153130753","https://openalex.org/W2158363765","https://openalex.org/W2165684624","https://openalex.org/W2273832464","https://openalex.org/W2295939521","https://openalex.org/W2329354063","https://openalex.org/W2399100674","https://openalex.org/W2610302970","https://openalex.org/W3100427564","https://openalex.org/W4211015501"],"related_works":["https://openalex.org/W2956094179","https://openalex.org/W2245286458","https://openalex.org/W2545511463","https://openalex.org/W2106332846","https://openalex.org/W27741389","https://openalex.org/W2541348386","https://openalex.org/W2182592860","https://openalex.org/W2172075652","https://openalex.org/W2369829641","https://openalex.org/W1570967612"],"abstract_inverted_index":{"Steel":[0],"scheduling":[1,11,46],"is":[2,14,50,107,124],"recognised":[3],"as":[4],"one":[5],"of":[6,20,41],"the":[7,38,75,141],"most":[8],"difficult":[9],"real-world":[10,43],"problems.":[12],"It":[13],"characterised":[15],"by":[16],"a":[17,31,42,72,84,108,117],"wide":[18],"range":[19],"operational":[21],"constraints,":[22],"variable":[23],"dependencies":[24],"and":[25,33,64,95,120,129],"multiple":[26],"objectives.":[27],"This":[28,111],"paper":[29,112],"uses":[30],"divide":[32,128],"conquer":[34,130],"method":[35],"to":[36,70,74,126,131,140],"reduce":[37],"combinatorial":[39],"complexity":[40],"multi-line":[44],"steel":[45],"problem.":[47,77],"The":[48],"problem":[49],"first":[51],"decomposed":[52],"into":[53],"sub-problems":[54,67],"which":[55],"are":[56,68,81],"solved":[57],"individually":[58],"in":[59],"parallel":[60,62],"using":[61,103],"branch":[63],"bound,":[65],"then":[66],"combined":[69],"form":[71],"solution":[73,142],"original":[76],"Three":[78],"decomposition":[79,106],"strategies":[80],"compared,":[82],"specifically:":[83],"manual":[85],"heuristic":[86],"domain":[87],"knowledge":[88],"(DOM)":[89],"intensive":[90],"strategy,":[91],"K-means++":[92],"(KM)":[93],"clustering":[94],"Self-organising":[96],"maps":[97],"(SOM).":[98],"Experimental":[99],"results":[100],"show":[101],"that":[102,114],"SOM":[104],"for":[105],"promising":[109],"approach.":[110],"demonstrates":[113],"despite":[115],"being":[116],"highly":[118],"complex":[119],"constrained":[121],"problem,":[122],"it":[123],"possible":[125],"use":[127],"achieve":[132],"potentially":[133],"good":[134],"scalability":[135],"characteristics":[136],"without":[137],"significant":[138],"detriment":[139],"quality.":[143]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}