{"id":"https://openalex.org/W2344265714","doi":"https://doi.org/10.1162/evco_a_00183","title":"A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling","display_name":"A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling","publication_year":2016,"publication_date":"2016-04-27","ids":{"openalex":"https://openalex.org/W2344265714","doi":"https://doi.org/10.1162/evco_a_00183","mag":"2344265714","pmid":"https://pubmed.ncbi.nlm.nih.gov/27120113"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00183","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00183","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://napier-surface.worktribe.com/168544/1/A%20hyper-heuristic%20ensemble%20method%20for%20static%20job-shop%20scheduling.","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006992974","display_name":"Emma Hart","orcid":"https://orcid.org/0000-0002-5405-4413"},"institutions":[{"id":"https://openalex.org/I251738","display_name":"Edinburgh Napier University","ror":"https://ror.org/03zjvnn91","country_code":"GB","type":"education","lineage":["https://openalex.org/I251738"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Emma Hart","raw_affiliation_strings":["School of Computing, Edinburgh Napier University, Edinburgh, EH10, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing, Edinburgh Napier University, Edinburgh, EH10, UK","institution_ids":["https://openalex.org/I251738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059180650","display_name":"Kevin Sim","orcid":"https://orcid.org/0000-0001-6555-7721"},"institutions":[{"id":"https://openalex.org/I251738","display_name":"Edinburgh Napier University","ror":"https://ror.org/03zjvnn91","country_code":"GB","type":"education","lineage":["https://openalex.org/I251738"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Kevin Sim","raw_affiliation_strings":["School of Computing, Edinburgh Napier University, Edinburgh, EH10, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing, Edinburgh Napier University, Edinburgh, EH10, UK","institution_ids":["https://openalex.org/I251738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006992974","https://openalex.org/A5059180650"],"corresponding_institution_ids":["https://openalex.org/I251738"],"apc_list":null,"apc_paid":null,"fwci":10.6138,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.98414674,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"24","issue":"4","first_page":"609","last_page":"635"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9972000122070312,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/heuristics","display_name":"Heuristics","score":0.7923376560211182},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.6536083221435547},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.635373592376709},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6179566979408264},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5917646884918213},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.550705075263977},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48852694034576416},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47689178586006165},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4755023419857025},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3621219992637634},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3538705110549927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3334137797355652},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28015363216400146}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7923376560211182},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.6536083221435547},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.635373592376709},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6179566979408264},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5917646884918213},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.550705075263977},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48852694034576416},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47689178586006165},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4755023419857025},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3621219992637634},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3538705110549927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3334137797355652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28015363216400146},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[{"descriptor_ui":"D000067508","descriptor_name":"Computer Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000067508","descriptor_name":"Computer Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000067508","descriptor_name":"Computer Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000069550","descriptor_name":"Machine Learning","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000069550","descriptor_name":"Machine Learning","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000069550","descriptor_name":"Machine Learning","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D006801","descriptor_name":"Humans","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D006801","descriptor_name":"Humans","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D006801","descriptor_name":"Humans","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D010561","descriptor_name":"Personnel Staffing and Scheduling","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D010561","descriptor_name":"Personnel Staffing and Scheduling","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D010561","descriptor_name":"Personnel Staffing and Scheduling","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D014937","descriptor_name":"Work","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D014937","descriptor_name":"Work","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D014937","descriptor_name":"Work","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":4,"locations":[{"id":"doi:10.1162/evco_a_00183","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00183","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:27120113","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/27120113","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null},{"id":"pmh:oai:napier-surface.worktribe.com:168544","is_oa":true,"landing_page_url":"https://napier-surface.worktribe.com/168544/1/A%20hyper-heuristic%20ensemble%20method%20for%20static%20job-shop%20scheduling.","pdf_url":null,"source":{"id":"https://openalex.org/S4306400544","display_name":"Research Output (Edinburgh Napier University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I251738","host_organization_name":"Edinburgh Napier University","host_organization_lineage":["https://openalex.org/I251738"],"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":"","raw_type":"Journal Article"},{"id":"pmh:oai:repository@napier.ac.uk:168544","is_oa":true,"landing_page_url":"http://researchrepository.napier.ac.uk/id/eprint/9844","pdf_url":null,"source":{"id":"https://openalex.org/S4306402591","display_name":"Edinburgh Napier Research Repository (Edinburgh Napier University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I251738","host_organization_name":"Edinburgh Napier University","host_organization_lineage":["https://openalex.org/I251738"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"}],"best_oa_location":{"id":"pmh:oai:napier-surface.worktribe.com:168544","is_oa":true,"landing_page_url":"https://napier-surface.worktribe.com/168544/1/A%20hyper-heuristic%20ensemble%20method%20for%20static%20job-shop%20scheduling.","pdf_url":null,"source":{"id":"https://openalex.org/S4306400544","display_name":"Research Output (Edinburgh Napier University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I251738","host_organization_name":"Edinburgh Napier University","host_organization_lineage":["https://openalex.org/I251738"],"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":"","raw_type":"Journal Article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G7817878130","display_name":null,"funder_award_id":"EP/J021628/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W32649994","https://openalex.org/W138769222","https://openalex.org/W819578930","https://openalex.org/W820949624","https://openalex.org/W1488422606","https://openalex.org/W1509092951","https://openalex.org/W1570754865","https://openalex.org/W1576818901","https://openalex.org/W1590121190","https://openalex.org/W1665359133","https://openalex.org/W1964335576","https://openalex.org/W1972928373","https://openalex.org/W1976618788","https://openalex.org/W1981029154","https://openalex.org/W1994806929","https://openalex.org/W1998510734","https://openalex.org/W2010839146","https://openalex.org/W2012493517","https://openalex.org/W2014034914","https://openalex.org/W2015178104","https://openalex.org/W2023002456","https://openalex.org/W2025318596","https://openalex.org/W2029481182","https://openalex.org/W2031409887","https://openalex.org/W2044747137","https://openalex.org/W2058919894","https://openalex.org/W2067363195","https://openalex.org/W2071306171","https://openalex.org/W2071948161","https://openalex.org/W2073870328","https://openalex.org/W2078885513","https://openalex.org/W2087376002","https://openalex.org/W2100211715","https://openalex.org/W2103660812","https://openalex.org/W2119924737","https://openalex.org/W2131422526","https://openalex.org/W2150322710","https://openalex.org/W2154842529","https://openalex.org/W2156391157","https://openalex.org/W2165780324","https://openalex.org/W2166858694","https://openalex.org/W2188526275","https://openalex.org/W2275596639","https://openalex.org/W2339444107","https://openalex.org/W2531563875","https://openalex.org/W2799114752","https://openalex.org/W2912934387","https://openalex.org/W3004042307","https://openalex.org/W3022839551","https://openalex.org/W3103026370","https://openalex.org/W4212883601","https://openalex.org/W4230124487"],"related_works":["https://openalex.org/W1985012061","https://openalex.org/W3050209628","https://openalex.org/W2126201612","https://openalex.org/W2026890163","https://openalex.org/W1068348394","https://openalex.org/W2021796553","https://openalex.org/W4285137126","https://openalex.org/W2105094221","https://openalex.org/W2506945462","https://openalex.org/W2137654273"],"abstract_inverted_index":{"We":[0],"describe":[1,148],"a":[2,22,30,48,67,75,89,95,109],"new":[3,99,142],"hyper-heuristic":[4,123],"method":[5,43],"NELLI-GP":[6,38],"for":[7],"solving":[8],"job-shop":[9],"scheduling":[10],"problems":[11,114],"(JSSP)":[12],"that":[13,52,146],"evolves":[14,53],"an":[15,40],"ensemble":[16,20,42,79,135],"of":[17,33,56,59,98,111,127],"heuristics.":[18],"The":[19],"adopts":[21],"divide-and-conquer":[23],"approach":[24],"in":[25,132],"which":[26],"each":[27,62,139],"heuristic":[28,50],"solves":[29,140],"unique":[31],"subset":[32],"the":[34,78,116,128,133,137],"instance":[35],"set":[36,97,110],"considered.":[37],"extends":[39],"existing":[41,85],"called":[44],"NELLI":[45],"by":[46],"introducing":[47],"novel":[49],"generator":[51],"heuristics":[54,131],"composed":[55],"linear":[57],"sequences":[58],"dispatching":[60,86],"rules:":[61],"rule":[63],"is":[64,71,80],"represented":[65],"using":[66],"tree":[68],"structure":[69],"and":[70,88,136],"itself":[72],"evolved.":[73],"Following":[74],"training":[76],"period,":[77],"shown":[81],"to":[82,120],"outperform":[83],"both":[84],"rules":[87],"standard":[90],"genetic":[91],"programming":[92],"algorithm":[93],"on":[94,108],"large":[96],"test":[100],"instances.":[101,150],"In":[102],"addition,":[103],"it":[104],"obtains":[105],"superior":[106],"results":[107],"210":[112],"benchmark":[113],"from":[115],"literature":[117],"when":[118],"compared":[119],"two":[121],"state-of-the-art":[122],"approaches.":[124],"Further":[125],"analysis":[126],"relationship":[129],"between":[130],"evolved":[134],"instances":[138],"provides":[141],"insights":[143],"into":[144],"features":[145],"might":[147],"similar":[149]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":6},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}