{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T19:14:40Z","timestamp":1740165280772,"version":"3.37.3"},"reference-count":61,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T00:00:00Z","timestamp":1704412800000},"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"],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"Dynamic scheduling represents an important class of combinatorial optimisation problems that are usually solved with simple heuristics, the so-called dispatching rules (DRs). Designing efficient DRs is a tedious task, which is why it has been automated through the application of genetic programming (GP). Various approaches have been used to improve the results of automatically generated DRs, with ensemble learning being one of the best-known. The goal of ensemble learning is to create sets of automatically designed DRs that perform better together. One of the main problems in ensemble learning is the selection of DRs to form the ensemble. To this end, various ensemble construction methods have been proposed over the years. However, these methods are quite computationally intensive and require a lot of computation time to obtain good ensembles. Therefore, in this study, we propose several simple heuristic ensemble construction methods that can be used to construct ensembles quite efficiently and without the need to evaluate their performance. The proposed methods construct the ensembles solely based on certain properties of the individual DRs used for their construction. The experimental study shows that some of the proposed heuristic construction methods perform better than more complex state-of-the-art approaches for constructing ensembles.<\/jats:p>","DOI":"10.3390\/axioms13010037","type":"journal-article","created":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T15:06:43Z","timestamp":1704467203000},"page":"37","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic Ensemble Construction Methods of Automatically Designed Dispatching Rules for the Unrelated Machines Environment"],"prefix":"10.3390","volume":"13","author":[{"given":"Marko","family":"\u0110urasevi\u0107","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia"}]},{"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"}]}],"member":"1968","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"key":"ref_1","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_2","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_3","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_4","doi-asserted-by":"crossref","unstructured":"Pinedo, M.L. (2012). Scheduling, Springer.","DOI":"10.1007\/978-1-4614-2361-4"},{"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","first-page":"177","article-title":"Exploring Hyper-heuristic Methodologies with Genetic Programming","volume":"1","author":"Burke","year":"2009","journal-title":"Comput. Intell."},{"key":"ref_9","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_10","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_11","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_12","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_13","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_14","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), San Sebasti\u00e1n, Spain.","DOI":"10.1109\/CEC.2017.7969539"},{"key":"ref_15","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_16","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_17","unstructured":"Burke, E.K., Hyde, M.R., and Kendall, G. (2006). Parallel Problem Solving from Nature\u2014PPSN IX, Springer."},{"key":"ref_18","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_19","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_20","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_21","unstructured":"Miyashita, K. (2000, January 10\u201312). Job-Shop Scheduling with Genetic Programming. Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation, GECCO\u201900, San Francisco, CA, USA."},{"key":"ref_22","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_23","doi-asserted-by":"crossref","unstructured":"Zhang, F., Mei, Y., Nguyen, S., and Zhang, M. (2023). Survey on Genetic Programming and Machine Learning Techniques for Heuristic Design in Job Shop Scheduling. IEEE Trans. Evol. Comput., 1.","DOI":"10.1109\/TEVC.2023.3255246"},{"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","unstructured":"Nguyen, S., Zhang, M., Johnston, M., and Tan, K.C. (2013). Studies in Computational Intelligence, Springer."},{"key":"ref_27","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_28","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_29","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_30","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_31","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_32","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_33","doi-asserted-by":"crossref","first-page":"8142","DOI":"10.1109\/TCYB.2021.3050141","article-title":"Collaborative Multifidelity-Based Surrogate Models for Genetic Programming in Dynamic Flexible Job Shop Scheduling","volume":"52","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Cybern."},{"key":"ref_34","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_35","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_36","unstructured":"Zhang, F., Mei, Y., Nguyen, S., and Zhang, M. (2020). Lecture Notes in Computer Science, Springer International Publishing."},{"key":"ref_37","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 Genetic and Evolutionary Computation Conference, GECCO \u201919, Prague, Czech Republic.","DOI":"10.1145\/3321707.3321790"},{"key":"ref_38","unstructured":"Park, J., Mei, Y., Nguyen, S., Chen, G., Johnston, M., and Zhang, M. (2016). Lecture Notes in Computer Science, Springer International Publishing."},{"key":"ref_39","unstructured":"Hart, E., and Sim, K. (2014). Lecture Notes in Computer Science, Springer International Publishing."},{"key":"ref_40","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_41","doi-asserted-by":"crossref","unstructured":"Park, J., Mei, Y., Nguyen, S., Chen, G., and Zhang, M. (2017). An Investigation of Ensemble Combination Schemes for Genetic Programming based Hyper-heuristic Approaches to Dynamic Job Shop Scheduling. Appl. Soft Comput., 63.","DOI":"10.1016\/j.asoc.2017.11.020"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1007\/s10732-019-09416-x","article-title":"Creating dispatching rules by simple ensemble combination","volume":"25","year":"2019","journal-title":"J. Heuristics"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"107606","DOI":"10.1016\/j.asoc.2021.107606","article-title":"Ensembles of priority rules for resource constrained project scheduling problem","volume":"110","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_44","unstructured":"Gil-Gala, F.J., and Varela, R. (2019). From Bioinspired Systems and Biomedical Applications to Machine Learning, Springer International Publishing."},{"key":"ref_45","first-page":"553","article-title":"Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling","volume":"21","author":"Sierra","year":"2020","journal-title":"Nat. Comput."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"65","DOI":"10.3233\/ICA-200634","article-title":"Learning ensembles of priority rules for online scheduling by hybrid evolutionary algorithms","volume":"28","author":"Sierra","year":"2020","journal-title":"Integr. Comput.-Aided Eng."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/j.ins.2023.03.114","article-title":"Ensembles of priority rules to solve one machine scheduling problem in real-time","volume":"634","author":"Varela","year":"2023","journal-title":"Inf. Sci."},{"key":"ref_48","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_49","doi-asserted-by":"crossref","first-page":"275","DOI":"10.3233\/ICA-230704","article-title":"Constructing ensembles of dispatching rules for multi-objective tasks in the unrelated machines environment","volume":"30","year":"2023","journal-title":"Integr. Comput.-Aided Eng."},{"key":"ref_50","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_51","doi-asserted-by":"crossref","unstructured":"Wang, S., Mei, Y., and Zhang, M. (2019, January 13\u201317). Novel ensemble genetic programming hyper-heuristics for uncertain capacitated arc routing problem. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201919, Prague, Czech Republic.","DOI":"10.1145\/3321707.3321797"},{"key":"ref_52","unstructured":"Leung, J.Y.T. (2004). Handbook of Scheduling, Chapman & Hall\/CRC."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey","volume":"Volume 5","author":"Hammer","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"ref_54","unstructured":"Koza, J.R. (1992). Genetic Programming, Complex Adaptive Systems, Bradford Books."},{"key":"ref_55","unstructured":"Poli, R., Langdon, W.B., and McPhee, N.F. (2008). A Field Guide to Genetic Programming, Lulu Enterprises, Ltd."},{"key":"ref_56","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_57","unstructured":"Mitchell, M. (1998). An Introduction to Genetic Algorithms, Complex Adaptive Systems, Bradford Books."},{"key":"ref_58","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_59","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/S0377-2217(95)00376-2","article-title":"Scheduling jobs on parallel machines with sequence-dependent setup times","volume":"100","author":"Lee","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"ref_60","unstructured":"Iba, H. (1999, January 13\u201317). Bagging, Boosting, and Bloating in Genetic Programming. Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation\u2014Volume 2, GECCO\u201999, Orlando, FL, USA."},{"key":"ref_61","unstructured":"Paris, G., Robilliard, D., and Fonlupt, C. (2001, January 29\u201331). Applying Boosting Techniques to Genetic Programming. Proceedings of the Artificial Evolution: 5th International Conference, Evolution Artificielle, EA 2001, Le Creusot, France."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/1\/37\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T05:13:34Z","timestamp":1704777214000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/1\/37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,5]]},"references-count":61,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["axioms13010037"],"URL":"https:\/\/doi.org\/10.3390\/axioms13010037","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2024,1,5]]}}}