{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:46:08Z","timestamp":1760143568833,"version":"build-2065373602"},"reference-count":63,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2024,2,4]],"date-time":"2024-02-04T00:00:00Z","timestamp":1707004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004488","name":"Croatian Science Foundation","doi-asserted-by":"publisher","award":["IP-2019-04-4333"],"award-info":[{"award-number":["IP-2019-04-4333"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The automated design of dispatching rules (DRs) with genetic programming (GP) has become an important research direction in recent years. One of the most important decisions in applying GP to generate DRs is determining the features of the scheduling problem to be used during the evolution process. Unfortunately, there are no clear rules or guidelines for the design or selection of such features, and often the features are simply defined without investigating their influence on the performance of the algorithm. However, the performance of GP can depend significantly on the features provided to it, and a poor or inadequate selection of features for a given problem can result in the algorithm performing poorly. In this study, we examine in detail the features that GP should use when developing DRs for unrelated machine scheduling problems. Different types of features are investigated, and the best combination of these features is determined using two selection methods. The obtained results show that the design and selection of appropriate features are crucial for GP, as they improve the results by about 7% when only the simplest terminal nodes are used without selection. In addition, the results show that it is not possible to outperform more sophisticated manually designed DRs when only the simplest problem features are used as terminal nodes. This shows how important it is to design appropriate composite terminal nodes to produce high-quality DRs.<\/jats:p>","DOI":"10.3390\/a17020067","type":"journal-article","created":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T05:36:43Z","timestamp":1707197803000},"page":"67","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Assessing the Ability of Genetic Programming for Feature Selection in Constructing Dispatching Rules for Unrelated Machine Environments"],"prefix":"10.3390","volume":"17","author":[{"given":"Marko","family":"\u0110urasevi\u0107","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9201-2994","authenticated-orcid":false,"given":"Domagoj","family":"Jakobovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7509-4337","authenticated-orcid":false,"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[{"name":"Digital Security Group, Radboud University, 6525 XZ Nijmegen, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3089-6517","authenticated-orcid":false,"given":"Luca","family":"Mariot","sequence":"additional","affiliation":[{"name":"Semantics, Cybersecurity and Services Group, University of Twente, 7522 NB Enschede, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,2,4]]},"reference":[{"key":"ref_1","unstructured":"Leung, J.Y.T. (2004). Handbook of Scheduling, Chapman & Hall\/CRC."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.ijpe.2018.04.013","article-title":"Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks","volume":"201","author":"Wu","year":"2018","journal-title":"Int. J. Prod. Econ."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.cie.2018.05.014","article-title":"A constraint programming approach for solving unrelated parallel machine scheduling problem","volume":"121","author":"Gedik","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1080\/07408170208928923","article-title":"Scheduling of unrelated parallel machines: An application to PWB manufacturing","volume":"34","author":"Yu","year":"2002","journal-title":"IIE Trans."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10710-005-7580-7","article-title":"Evolutionary Scheduling: A Review","volume":"6","author":"Hart","year":"2005","journal-title":"Genet. Program. Evolvable Mach."},{"key":"ref_6","first-page":"3181","article-title":"Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: A survey","volume":"56","year":"2022","journal-title":"Artif. Intell. Rev."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.eswa.2018.06.053","article-title":"A survey of dispatching rules for the dynamic unrelated machines environment","volume":"113","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/TEVC.2015.2429314","article-title":"Automated Design of Production Scheduling Heuristics: A Review","volume":"20","author":"Branke","year":"2016","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s40747-017-0036-x","article-title":"Genetic programming for production scheduling: A survey with a unified framework","volume":"3","author":"Nguyen","year":"2017","journal-title":"Complex Intell. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TEVC.2023.3255246","article-title":"Survey on Genetic Programming and Machine Learning Techniques for Heuristic Design in Job Shop Scheduling","volume":"28","author":"Zhang","year":"2023","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_11","unstructured":"Poli, R., Langdon, W.B., and McPhee, N.F. (2008). A Field Guide to Genetic Programming, Lulu Enterprises, UK Ltd."},{"key":"ref_12","unstructured":"Koza, J.R. (1992). Genetic Programming, Bradford Books. Complex Adaptive Systems."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10710-010-9112-3","article-title":"Human-competitive results produced by genetic programming","volume":"11","author":"Koza","year":"2010","journal-title":"Genet. Program. Evolvable Mach."},{"key":"ref_14","first-page":"177","article-title":"Exploring Hyper-heuristic Methodologies with Genetic Programming","volume":"1","author":"Burke","year":"2009","journal-title":"Comput. Intell."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1162\/EVCO_a_00044","article-title":"Automating the Packing Heuristic Design Process with Genetic Programming","volume":"20","author":"Burke","year":"2012","journal-title":"Evol. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.asoc.2016.07.025","article-title":"Adaptive scheduling on unrelated machines with genetic programming","volume":"48","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Hunt, R., Johnston, M., and Zhang, M. (2014, January 12\u201316). Evolving \u201cless-myopic\u201d scheduling rules for dynamic job shop scheduling with genetic programming. Proceedings of the GECCO \u201914: 2014 Annual Conference on Genetic and Evolutionary Computation, Vancouver, BC, Canada.","DOI":"10.1145\/2576768.2598224"},{"key":"ref_18","unstructured":"Miyashita, K. (2000, January 10\u201312). Job-Shop Scheduling with Genetic Programming. Proceedings of the GECCO\u201900: 2nd Annual Conference on Genetic and Evolutionary Computation, San Francisco, CA, USA."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/S0965-9978(00)00109-5","article-title":"Investigating the use of genetic programming for a classic one-machine scheduling problem","volume":"32","author":"Dimopoulos","year":"2001","journal-title":"Adv. Eng. Softw."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Collet, P., Tomassini, M., Ebner, M., Gustafson, S., and Ek\u00e1rt, A. (2006, January 10\u201312). Dynamic Scheduling with Genetic Programming. Proceedings of the Genetic Programming, Budapest, Hungary.","DOI":"10.1007\/11729976"},{"key":"ref_21","unstructured":"Ho, N., and Tay, J.C. (2005, January 2\u20135). Evolving Dispatching Rules for solving the Flexible Job-Shop Problem. Proceedings of the 2005 IEEE Congress on Evolutionary Computation, Edinburgh, UK."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.ins.2017.12.013","article-title":"On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems","volume":"432","author":"Chand","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_23","unstructured":"Gil-Gala, F.J., and Varela, R. (2019). From Bioinspired Systems and Biomedical Applications to Machine Learning, Springer International Publishing."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/TEVC.2012.2227326","article-title":"A Computational Study of Representations in Genetic Programming to Evolve Dispatching Rules for the Job Shop Scheduling Problem","volume":"17","author":"Nguyen","year":"2013","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1162\/EVCO_a_00131","article-title":"Hyper-heuristic Evolution of Dispatching Rules: A Comparison of Rule Representations","volume":"23","author":"Branke","year":"2015","journal-title":"Evol. Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"22886","DOI":"10.1109\/ACCESS.2022.3151346","article-title":"A Comparative Study of Dispatching Rule Representations in Evolutionary Algorithms for the Dynamic Unrelated Machines Environment","volume":"10","year":"2022","journal-title":"IEEE Access"},{"key":"ref_27","unstructured":"Nguyen, S., Zhang, M., Johnston, M., and Tan, K.C. (2013). Studies in Computational Intelligence, Springer."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Nguyen, S., Zhang, M., and Tan, K.C. (2015, January 25\u201328). Enhancing genetic programming based hyper-heuristics for dynamic multi-objective job shop scheduling problems. Proceedings of the 2015 IEEE Congress on Evolutionary Computation (CEC), Sendai, Japan.","DOI":"10.1109\/CEC.2015.7257234"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Masood, A., Mei, Y., Chen, G., and Zhang, M. (2016, January 24\u201329). Many-objective genetic programming for job-shop scheduling. Proceedings of the 2016 IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Canada.","DOI":"10.1109\/CEC.2016.7743797"},{"key":"ref_30","first-page":"9","article-title":"Evolving dispatching rules for optimising many-objective criteria in the unrelated machines environment","volume":"19","year":"2017","journal-title":"Genet. Program. Evolvable Mach."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Machado, P., Heywood, M.I., McDermott, J., Castelli, M., Garc\u00eda-S\u00e1nchez, P., Burelli, P., Risi, S., and Sim, K. (2015, January 8\u201310). Evolving Ensembles of Dispatching Rules Using Genetic Programming for Job Shop Scheduling. Proceedings of the Genetic Programming, Copenhagen, Denmark.","DOI":"10.1007\/978-3-319-16501-1"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1162\/EVCO_a_00183","article-title":"A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling","volume":"24","author":"Hart","year":"2016","journal-title":"Evol. Comput."},{"key":"ref_33","first-page":"53","article-title":"Comparison of ensemble learning methods for creating ensembles of dispatching rules for the unrelated machines environment","volume":"19","year":"2017","journal-title":"Genet. Program. Evolvable Mach."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.asoc.2017.11.020","article-title":"An Investigation of Ensemble Combination Schemes for Genetic Programming based Hyper-heuristic Approaches to Dynamic Job Shop Scheduling","volume":"63","author":"Park","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"106096","DOI":"10.1016\/j.engappai.2023.106096","article-title":"Collaboration methods for ensembles of dispatching rules for the dynamic unrelated machines environment","volume":"122","year":"2023","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"101318","DOI":"10.1016\/j.swevo.2023.101318","article-title":"Combining single objective dispatching rules into multi-objective ensembles for the dynamic unrelated machines environment","volume":"80","author":"Coello","year":"2023","journal-title":"Swarm Evol. Comput."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"2951","DOI":"10.1109\/TCYB.2016.2562674","article-title":"Surrogate-Assisted Genetic Programming with Simplified Models for Automated Design of Dispatching Rules","volume":"47","author":"Nguyen","year":"2017","journal-title":"IEEE Trans. Cybern."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/TEVC.2021.3065707","article-title":"Surrogate-Assisted Evolutionary Multitask Genetic Programming for Dynamic Flexible Job Shop Scheduling","volume":"25","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"100944","DOI":"10.1016\/j.swevo.2021.100944","article-title":"Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity","volume":"66","author":"Sierra","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"10515","DOI":"10.1109\/TCYB.2021.3065340","article-title":"Multitask Genetic Programming-Based Generative Hyperheuristics: A Case Study in Dynamic Scheduling","volume":"52","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Cybern."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/TETCI.2017.2743758","article-title":"An Efficient Feature Selection Algorithm for Evolving Job Shop Scheduling Rules with Genetic Programming","volume":"1","author":"Mei","year":"2017","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Zhang, F., Mei, Y., and Zhang, M. (2019, January 13\u201317). A two-stage genetic programming hyper-heuristic approach with feature selection for dynamic flexible job shop scheduling. Proceedings of the GECCO \u201919: Genetic and Evolutionary Computation Conference, Prague, Czech Republic.","DOI":"10.1145\/3321707.3321790"},{"key":"ref_43","unstructured":"Zhang, F., Mei, Y., Nguyen, S., and Zhang, M. (2020). Lecture Notes in Computer Science, Springer International Publishing."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1109\/TCYB.2020.3024849","article-title":"Evolving Scheduling Heuristics via Genetic Programming with Feature Selection in Dynamic Flexible Job-Shop Scheduling","volume":"51","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Cybern."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Yska, D., Mei, Y., and Zhang, M. (2018, January 15\u201319). Feature construction in genetic programming hyper-heuristic for dynamic flexible job shop scheduling. Proceedings of the GECCO \u201918: Genetic and Evolutionary Computation Conference Companion, Kyoto, Japan.","DOI":"10.1145\/3205651.3205741"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Pinedo, M.L. (2012). Scheduling, Springer.","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"ref_47","first-page":"287","article-title":"Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey","volume":"Volume 5","author":"Hammer","year":"1979","journal-title":"Discrete Optimization II"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"106637","DOI":"10.1016\/j.asoc.2020.106637","article-title":"Comparison of schedule generation schemes for designing dispatching rules with genetic programming in the unrelated machines environment","volume":"96","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","article-title":"Hyper-heuristics: A survey of the state of the art","volume":"64","author":"Burke","year":"2013","journal-title":"J. Oper. Res. Soc."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1162\/evco_a_00230","article-title":"A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching Rules","volume":"27","author":"Nguyen","year":"2019","journal-title":"Evol. Comput."},{"key":"ref_51","unstructured":"Zhang, F., Mei, Y., Nguyen, S., and Zhang, M. (2020). Lecture Notes in Computer Science, Springer International Publishing."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Duflo, G., Kieffer, E., Brust, M.R., Danoy, G., and Bouvry, P. (2019, January 20\u201324). A GP Hyper-Heuristic Approach for Generating TSP Heuristics. Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Rio de Janeiro, Brazil.","DOI":"10.1109\/IPDPSW.2019.00094"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/s11047-023-09968-9","article-title":"Evolving ensembles of heuristics for the travelling salesman problem","volume":"22","author":"Sierra","year":"2023","journal-title":"Nat. Comput."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Jacobsen-Grocott, J., Mei, Y., Chen, G., and Zhang, M. (2017, January 5\u20138). Evolving heuristics for Dynamic Vehicle Routing with Time Windows using genetic programming. Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), Donostia, Spain.","DOI":"10.1109\/CEC.2017.7969539"},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Wang, S., Mei, Y., Park, J., and Zhang, M. (2019, January 6\u20139). Evolving Ensembles of Routing Policies using Genetic Programming for Uncertain Capacitated Arc Routing Problem. Proceedings of the 2019 IEEE Symposium Series on Computational Intelligence (SSCI), Xiamen, China.","DOI":"10.1109\/SSCI44817.2019.9002749"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1162\/evco_a_00256","article-title":"A Predictive-Reactive Approach with Genetic Programming and Cooperative Coevolution for the Uncertain Capacitated Arc Routing Problem","volume":"28","author":"Liu","year":"2020","journal-title":"Evol. Comput."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"109696","DOI":"10.1016\/j.asoc.2022.109696","article-title":"Automated design of heuristics for the container relocation problem using genetic programming","volume":"130","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_58","unstructured":"Burke, E.K., Hyde, M.R., and Kendall, G. (2006). Parallel Problem Solving from Nature\u2014PPSN IX, Springer."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3233\/IDA-1997-1302","article-title":"Feature selection for classification","volume":"1","author":"DASH","year":"1997","journal-title":"Intell. Data Anal."},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Jovic, A., Brkic, K., and Bogunovic, N. (2015, January 25\u201329). A review of feature selection methods with applications. Proceedings of the 2015 38th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), Opatija, Croatia.","DOI":"10.1109\/MIPRO.2015.7160458"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"15091","DOI":"10.1007\/s00521-021-06406-8","article-title":"A systematic review of emerging feature selection optimization methods for optimal text classification: The present state and prospective opportunities","volume":"33","author":"Abiodun","year":"2021","journal-title":"Neural Comput. Appl."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1162\/evco.2006.14.3.309","article-title":"A Comparison of Bloat Control Methods for Genetic Programming","volume":"14","author":"Luke","year":"2006","journal-title":"Evol. Comput."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1162\/evco.2010.18.2.18206","article-title":"Bloat Control Operators and Diversity in Genetic Programming: A Comparative Study","volume":"18","author":"Merelo","year":"2010","journal-title":"Evol. Comput."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/2\/67\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T13:54:44Z","timestamp":1760104484000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/2\/67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,4]]},"references-count":63,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,2]]}},"alternative-id":["a17020067"],"URL":"https:\/\/doi.org\/10.3390\/a17020067","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2024,2,4]]}}}