{"id":"https://openalex.org/W2015178104","doi":"https://doi.org/10.1145/2739482.2764697","title":"A Novel Heuristic Generator for JSSP Using a Tree-Based Representation of Dispatching Rules","display_name":"A Novel Heuristic Generator for JSSP Using a Tree-Based Representation of Dispatching Rules","publication_year":2015,"publication_date":"2015-07-10","ids":{"openalex":"https://openalex.org/W2015178104","doi":"https://doi.org/10.1145/2739482.2764697","mag":"2015178104"},"language":"en","primary_location":{"id":"doi:10.1145/2739482.2764697","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739482.2764697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://researchrepository.napier.ac.uk/id/eprint/8053","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":["Edinburgh Napier University, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Edinburgh Napier University, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I251738"]}]},{"author_position":"last","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":false,"raw_author_name":"Emma Hart","raw_affiliation_strings":["Edinburgh Napier University, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Edinburgh Napier University, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I251738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059180650"],"corresponding_institution_ids":["https://openalex.org/I251738"],"apc_list":null,"apc_paid":null,"fwci":1.1317,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81223818,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1485","last_page":"1486"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9955999851226807,"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.9918000102043152,"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/tardiness","display_name":"Tardiness","score":0.9022412896156311},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.808826208114624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6766221523284912},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6706643104553223},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5690955519676208},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5362581014633179},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5278009176254272},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5142998099327087},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.48754948377609253},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.467746764421463},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45917442440986633},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2939457297325134},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27491602301597595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20771226286888123},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.14410710334777832},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.09016817808151245}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9022412896156311},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.808826208114624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6766221523284912},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6706643104553223},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5690955519676208},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5362581014633179},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5278009176254272},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5142998099327087},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.48754948377609253},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.467746764421463},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45917442440986633},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2939457297325134},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27491602301597595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20771226286888123},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.14410710334777832},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.09016817808151245},{"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/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2739482.2764697","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739482.2764697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:napier-surface.worktribe.com:170838","is_oa":true,"landing_page_url":"http://researchrepository.napier.ac.uk/id/eprint/8053","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceeding"},{"id":"pmh:oai:repository@napier.ac.uk:170838","is_oa":true,"landing_page_url":"https://napier-repository.worktribe.com/170838/1/A%20Novel%20Heuristic%20Generator%20for%20JSSP%20Using%20a%20Tree-Based%20Representation%20of%20Dispatching%20Rules","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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:170838","is_oa":true,"landing_page_url":"http://researchrepository.napier.ac.uk/id/eprint/8053","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceeding"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.7300000190734863}],"awards":[{"id":"https://openalex.org/G6148339645","display_name":"Real World Optimisation with Life-Long Learning","funder_award_id":"EP/J021628/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"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":4,"referenced_works":["https://openalex.org/W1972928373","https://openalex.org/W2044747137","https://openalex.org/W2073870328","https://openalex.org/W2131422526"],"related_works":["https://openalex.org/W1999247335","https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W3119129187","https://openalex.org/W1628567638","https://openalex.org/W3186374002","https://openalex.org/W2109775141","https://openalex.org/W2521454154","https://openalex.org/W2107678394"],"abstract_inverted_index":{"A":[0,33],"previously":[1],"described":[2],"hyper-heuristic":[3],"framework":[4],"named":[5],"NELLI":[6],"is":[7,37,83],"adapted":[8],"for":[9,78],"the":[10,29,73],"classic":[11],"Job":[12],"Shop":[13],"Scheduling":[14],"Problem":[15],"(JSSP)":[16],"and":[17,85,100,128],"used":[18],"to":[19,27],"find":[20],"ensembles":[21,115],"of":[22,58,91,116,136],"reusable":[23],"heuristics":[24,63,118],"that":[25,39,112],"cooperate":[26],"cover":[28],"heuristic":[30,35,127],"search":[31],"space.":[32],"new":[34,62,81],"generator":[36],"incorporated":[38],"creates":[40],"novel":[41],"heuristics,":[42],"formulated":[43,53],"as":[44,54,65,103],"GP-like":[45],"tree":[46],"structures,":[47],"by":[48],"combining":[49],"problem":[50,95],"specific":[51],"information":[52],"a":[55,88,129,133],"large":[56,89,134],"set":[57,90,135],"terminal":[59],"nodes.":[60],"The":[61,80],"operate":[64],"dynamic":[66],"dispatching":[67],"rules,":[68],"selecting":[69],"at":[70],"each":[71],"iteration":[72],"highest":[74],"priority":[75],"operation":[76],"available":[77],"scheduling.":[79],"system":[82],"trained":[84],"tested":[86],"on":[87,107],"1400":[92],"newly":[93],"generated":[94],"instances,":[96],"using":[97],"both":[98],"makespan":[99],"weighted":[101],"tardiness":[102],"fitness":[104],"metrics.":[105],"Results":[106],"unseen":[108],"test":[109],"instances":[110],"show":[111],"relatively":[113],"small":[114],"evolved":[117],"significantly":[119],"outperform":[120],"any":[121],"individual":[122],"\"one":[123],"size":[124],"fits\"":[125],"all":[126],"greedy":[130],"selection":[131],"from":[132],"existing":[137],"rules.":[138]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}