{"id":"https://openalex.org/W4391576617","doi":"https://doi.org/10.3390/a17020067","title":"Assessing the Ability of Genetic Programming for Feature Selection in Constructing Dispatching Rules for Unrelated Machine Environments","display_name":"Assessing the Ability of Genetic Programming for Feature Selection in Constructing Dispatching Rules for Unrelated Machine Environments","publication_year":2024,"publication_date":"2024-02-04","ids":{"openalex":"https://openalex.org/W4391576617","doi":"https://doi.org/10.3390/a17020067"},"language":"en","primary_location":{"id":"doi:10.3390/a17020067","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a17020067","pdf_url":"https://www.mdpi.com/1999-4893/17/2/67/pdf?version=1707118989","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/17/2/67/pdf?version=1707118989","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027293846","display_name":"Marko \u00d0urasevi\u0107","orcid":"https://orcid.org/0000-0001-8732-4769"},"institutions":[{"id":"https://openalex.org/I181343428","display_name":"University of Zagreb","ror":"https://ror.org/00mv6sv71","country_code":"HR","type":"education","lineage":["https://openalex.org/I181343428"]}],"countries":["HR"],"is_corresponding":true,"raw_author_name":"Marko \u0110urasevi\u0107","raw_affiliation_strings":["Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia","institution_ids":["https://openalex.org/I181343428"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029689278","display_name":"Domagoj Jakobovi\u0107","orcid":"https://orcid.org/0000-0002-9201-2994"},"institutions":[{"id":"https://openalex.org/I181343428","display_name":"University of Zagreb","ror":"https://ror.org/00mv6sv71","country_code":"HR","type":"education","lineage":["https://openalex.org/I181343428"]}],"countries":["HR"],"is_corresponding":false,"raw_author_name":"Domagoj Jakobovi\u0107","raw_affiliation_strings":["Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia"],"raw_orcid":"https://orcid.org/0000-0002-9201-2994","affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia","institution_ids":["https://openalex.org/I181343428"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024072796","display_name":"Stjepan Picek","orcid":"https://orcid.org/0000-0001-7509-4337"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Stjepan Picek","raw_affiliation_strings":["Digital Security Group, Radboud University, 6525 XZ Nijmegen, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-7509-4337","affiliations":[{"raw_affiliation_string":"Digital Security Group, Radboud University, 6525 XZ Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069577574","display_name":"Luca Mariot","orcid":"https://orcid.org/0000-0003-3089-6517"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Luca Mariot","raw_affiliation_strings":["Semantics, Cybersecurity and Services Group, University of Twente, 7522 NB Enschede, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-3089-6517","affiliations":[{"raw_affiliation_string":"Semantics, Cybersecurity and Services Group, University of Twente, 7522 NB Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027293846"],"corresponding_institution_ids":["https://openalex.org/I181343428"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.2213,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51139606,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"17","issue":"2","first_page":"67","last_page":"67"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9980000257492065,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7972842454910278},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.781060516834259},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6575826406478882},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5809441804885864},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.5411185026168823},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.5365749597549438},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4848259687423706},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.48058319091796875},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4334970712661743},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3310350477695465},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2953988313674927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09139060974121094},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05576980113983154}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7972842454910278},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.781060516834259},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6575826406478882},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5809441804885864},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.5411185026168823},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.5365749597549438},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4848259687423706},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.48058319091796875},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4334970712661743},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3310350477695465},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2953988313674927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09139060974121094},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05576980113983154}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.3390/a17020067","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a17020067","pdf_url":"https://www.mdpi.com/1999-4893/17/2/67/pdf?version=1707118989","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:boa.unimib.it:10281/502379","is_oa":true,"landing_page_url":"https://hdl.handle.net/10281/502379","pdf_url":"https://boa.unimib.it/bitstream/10281/502379/1/Durasevic-2024-Algorithms-VoR.pdf","source":{"id":"https://openalex.org/S4306401259","display_name":"BOA (University of Milano-Bicocca)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"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":"info:eu-repo/semantics/article"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/303962","is_oa":true,"landing_page_url":"https://hdl.handle.net/2066/303962","pdf_url":"https://repository.ubn.ru.nl//bitstream/handle/2066/303962/303962.pdf","source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article / Letter to editor"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/6544e94b-0cdb-4638-b97b-d925d9084b17","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/6544e94b-0cdb-4638-b97b-d925d9084b17","pdf_url":"https://ris.utwente.nl/ws/files/362148964/algorithms-17-00067-v2.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"\u0110urasevi\u0107, M, Jakobovi\u0107, D, Picek, S & Mariot, L 2024, 'Assessing the Ability of Genetic Programming for Feature Selection in Constructing Dispatching Rules for Unrelated Machine Environments', Algorithms, vol. 17, no. 2, 67. https://doi.org/10.3390/a17020067","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:2394a5d4ef49493daaae143533e686b2","is_oa":true,"landing_page_url":"https://doaj.org/article/2394a5d4ef49493daaae143533e686b2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 17, Iss 2, p 67 (2024)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/17/2/67/","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17020067","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"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":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a17020067","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a17020067","pdf_url":"https://www.mdpi.com/1999-4893/17/2/67/pdf?version=1707118989","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/1","display_name":"No poverty"}],"awards":[{"id":"https://openalex.org/G1042398408","display_name":null,"funder_award_id":"IP-2019-04","funder_id":"https://openalex.org/F4320322674","funder_display_name":"Hrvatska Zaklada za Znanost"},{"id":"https://openalex.org/G7048537238","display_name":"Hyperheuristic Design of Dispatching Rules","funder_award_id":"IP-2019-04-4333","funder_id":"https://openalex.org/F4320322674","funder_display_name":"Hrvatska Zaklada za Znanost"}],"funders":[{"id":"https://openalex.org/F4320322674","display_name":"Hrvatska Zaklada za Znanost","ror":"https://ror.org/03n51vw80"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4391576617.pdf"},"referenced_works_count":56,"referenced_works":["https://openalex.org/W1487321909","https://openalex.org/W1488422606","https://openalex.org/W1516813955","https://openalex.org/W1536647479","https://openalex.org/W1566877019","https://openalex.org/W1981029154","https://openalex.org/W1993798301","https://openalex.org/W1996467378","https://openalex.org/W2012493517","https://openalex.org/W2037343293","https://openalex.org/W2072395453","https://openalex.org/W2072441740","https://openalex.org/W2119924737","https://openalex.org/W2132196970","https://openalex.org/W2140003718","https://openalex.org/W2165829462","https://openalex.org/W2275596639","https://openalex.org/W2344265714","https://openalex.org/W2398671303","https://openalex.org/W2493430091","https://openalex.org/W2558359969","https://openalex.org/W2590959390","https://openalex.org/W2604208500","https://openalex.org/W2727324160","https://openalex.org/W2754593347","https://openalex.org/W2759520914","https://openalex.org/W2770310616","https://openalex.org/W2773606106","https://openalex.org/W2801916413","https://openalex.org/W2803412322","https://openalex.org/W2805454413","https://openalex.org/W2810729466","https://openalex.org/W2827336656","https://openalex.org/W2941531126","https://openalex.org/W2953681220","https://openalex.org/W2954270276","https://openalex.org/W3006795224","https://openalex.org/W3049292607","https://openalex.org/W3093994124","https://openalex.org/W3136165312","https://openalex.org/W3136536335","https://openalex.org/W3185469365","https://openalex.org/W3194343069","https://openalex.org/W4212986570","https://openalex.org/W4238645461","https://openalex.org/W4249247926","https://openalex.org/W4251879489","https://openalex.org/W4255654664","https://openalex.org/W4293213129","https://openalex.org/W4304161159","https://openalex.org/W4323896969","https://openalex.org/W4327972610","https://openalex.org/W4367294698","https://openalex.org/W4387939003","https://openalex.org/W6601339270","https://openalex.org/W6632244569"],"related_works":["https://openalex.org/W2968285896","https://openalex.org/W206299888","https://openalex.org/W2102997898","https://openalex.org/W2549153708","https://openalex.org/W2140816515","https://openalex.org/W4205762803","https://openalex.org/W2381504162","https://openalex.org/W4285805598","https://openalex.org/W4318240128","https://openalex.org/W4391850111"],"abstract_inverted_index":{"The":[0,153],"automated":[1],"design":[2,57,159,222],"of":[3,21,36,60,77,83,100,136,144,162],"dispatching":[4],"rules":[5,52],"(DRs)":[6],"with":[7],"genetic":[8],"programming":[9],"(GP)":[10],"has":[11],"become":[12],"an":[13],"important":[14,24,218],"research":[15],"direction":[16],"in":[17,26,108,118],"recent":[18],"years.":[19],"One":[20],"the":[22,34,37,44,56,65,75,78,81,89,109,120,141,158,172,179,189,206],"most":[23],"decisions":[25],"applying":[27],"GP":[28,84,123],"to":[29,40,92,197,221,227],"generate":[30],"DRs":[31,128,203],"is":[32,147,194,220],"determining":[33],"features":[35,66,90,101,121,137,146,164,209],"scheduling":[38,132],"problem":[39,105,208],"be":[41],"used":[42,184,211],"during":[43],"evolution":[45],"process.":[46],"Unfortunately,":[47],"there":[48],"are":[49,67,138,165,183,210],"no":[50],"clear":[51],"or":[53,58,97],"guidelines":[54],"for":[55,102,129,167],"selection":[59,99,151,161],"such":[61],"features,":[62],"and":[63,94,140,160],"often":[64],"simply":[68],"defined":[69],"without":[70,185],"investigating":[71],"their":[72],"influence":[73],"on":[74,88],"performance":[76,82],"algorithm.":[79],"However,":[80],"can":[85,106],"depend":[86],"significantly":[87],"provided":[91],"it,":[93],"a":[95,103],"poor":[96],"inadequate":[98],"given":[104],"result":[107],"algorithm":[110],"performing":[111],"poorly.":[112],"In":[113,187],"this":[114],"study,":[115],"we":[116],"examine":[117],"detail":[119],"that":[122,157,192],"should":[124],"use":[125],"when":[126,177,204],"developing":[127],"unrelated":[130],"machine":[131],"problems.":[133],"Different":[134],"types":[135],"investigated,":[139],"best":[142],"combination":[143],"these":[145],"determined":[148],"using":[149],"two":[150],"methods.":[152],"obtained":[154],"results":[155,173,190],"show":[156,191],"appropriate":[163,223],"crucial":[166],"GP,":[168],"as":[169,212],"they":[170],"improve":[171],"by":[174],"about":[175],"7%":[176],"only":[178,205],"simplest":[180,207],"terminal":[181,213,225],"nodes":[182,226],"selection.":[186],"addition,":[188],"it":[193,219],"not":[195],"possible":[196],"outperform":[198],"more":[199],"sophisticated":[200],"manually":[201],"designed":[202],"nodes.":[214],"This":[215],"shows":[216],"how":[217],"composite":[224],"produce":[228],"high-quality":[229],"DRs.":[230]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}