{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:09:44Z","timestamp":1740175784453,"version":"3.37.3"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T00:00:00Z","timestamp":1733356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T00:00:00Z","timestamp":1733356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004488","name":"Hrvatska Zaklada za Znanost","doi-asserted-by":"publisher","award":["IP-2022-10-5398"],"award-info":[{"award-number":["IP-2022-10-5398"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Spanish Government","award":["MCINN-23-PID2022"],"award-info":[{"award-number":["MCINN-23-PID2022"]}]},{"name":"European Union - NextGenerationEU","award":["NPOO.C3.2.R2-I1.06.0110"],"award-info":[{"award-number":["NPOO.C3.2.R2-I1.06.0110"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The concept of green scheduling, which deals with the environmental impact of the scheduling process, is becoming increasingly important due to growing environmental concerns. Most green scheduling problem variants focus on modelling the energy consumption during the execution of the schedule. However, the dynamic unrelated machines environment is rarely considered, mainly because it is difficult to manually design simple heuristics, called dispatching rules (DRs), which are suitable for solving dynamic, non-standard scheduling problems. Using hyperheuristics, especially genetic programming (GP), alleviates the problem since it enables the automatic design of new DRs. In this study, we apply GP to automatically design DRs for solving the green scheduling problem in the unrelated machines environment under dynamic conditions. The total energy consumed during the system execution is optimised along with two standard scheduling criteria. The three most commonly investigated green scheduling problem variants from the literature are selected, and GP is adapted to generate appropriate DRs for each. The experiments show that GP-generated DRs efficiently solve the problem under dynamic conditions, providing a trade-off between optimising standard and energy-related criteria.<\/jats:p>","DOI":"10.1007\/s40747-024-01677-9","type":"journal-article","created":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T08:22:02Z","timestamp":1733386922000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated generation of dispatching rules for the green unrelated machines scheduling problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Nikolina","family":"Frid","sequence":"first","affiliation":[]},{"given":"Marko","family":"\u0189urasevi\u0107","sequence":"additional","affiliation":[]},{"given":"Francisco Javier","family":"Gil-Gala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,5]]},"reference":[{"key":"1677_CR1","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.jclepro.2018.10.048","volume":"208","author":"JB Abikarram","year":"2019","unstructured":"Abikarram JB, McConky K, Proano R (2019) Energy cost minimization for unrelated parallel machine scheduling under real time and demand charge pricing. J Clean Prod 208:232\u2013242. https:\/\/doi.org\/10.1016\/j.jclepro.2018.10.048","journal-title":"J Clean Prod"},{"issue":"2","key":"1677_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1162\/EVCO_a_00131","volume":"23","author":"J Branke","year":"2015","unstructured":"Branke J, Hildebrandt T, Scholz-Reiter B (2015) Hyper-heuristic evolution of dispatching rules: a comparison of rule representations. Evol Comput 23(2):249\u2013277. https:\/\/doi.org\/10.1162\/EVCO_a_00131","journal-title":"Evol Comput"},{"issue":"1","key":"1677_CR3","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/TEVC.2015.2429314","volume":"20","author":"J Branke","year":"2016","unstructured":"Branke J, Nguyen S, Pickardt CW, Zhang M (2016) Automated design of production scheduling heuristics: a review. IEEE Trans Evol Comput 20(1):110\u2013124. https:\/\/doi.org\/10.1109\/TEVC.2015.2429314","journal-title":"IEEE Trans Evol Comput"},{"issue":"12","key":"1677_CR4","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc 64(12):1695\u20131724. https:\/\/doi.org\/10.1057\/jors.2013.71","journal-title":"J Oper Res Soc"},{"key":"1677_CR5","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ins.2017.12.013","volume":"432","author":"S Chand","year":"2018","unstructured":"Chand S, Huynh Q, Singh H, Ray T, Wagner M (2018) On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems. Inf Sci 432:146\u2013163. https:\/\/doi.org\/10.1016\/j.ins.2017.12.013","journal-title":"Inf Sci"},{"key":"1677_CR6","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.jclepro.2017.04.018","volume":"156","author":"A Che","year":"2017","unstructured":"Che A, Zhang S, Wu X (2017) Energy-conscious unrelated parallel machine scheduling under time-of-use electricity tariffs. J Clean Prod 156:688\u2013697. https:\/\/doi.org\/10.1016\/j.jclepro.2017.04.018","journal-title":"J Clean Prod"},{"issue":"2","key":"1677_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"1677_CR8","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0965-9978(00)00109-5","volume":"32","author":"C Dimopoulos","year":"2001","unstructured":"Dimopoulos C, Zalzala A (2001) Investigating the use of genetic programming for a classic one-machine scheduling problem. Adv Eng Softw 32(6):489\u2013498. https:\/\/doi.org\/10.1016\/S0965-9978(00)00109-5","journal-title":"Adv Eng Softw"},{"key":"1677_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2019\/5075671","volume":"2019","author":"T Erdeli\u0107","year":"2019","unstructured":"Erdeli\u0107 T, Cari\u0107 T (2019) A survey on the electric vehicle routing problem: variants and solution approaches. J Adv Transport 2019:1\u201348. https:\/\/doi.org\/10.1155\/2019\/5075671","journal-title":"J Adv Transport"},{"key":"1677_CR10","doi-asserted-by":"publisher","first-page":"120824","DOI":"10.1016\/j.jclepro.2020.120824","volume":"259","author":"M Ganji","year":"2020","unstructured":"Ganji M, Kazemipoor H, Molana SMH, Sajadi SM (2020) A green multi-objective integrated scheduling of production and distribution with heterogeneous fleet vehicle routing and time windows. J Clean Prod 259:120824. https:\/\/doi.org\/10.1016\/j.jclepro.2020.120824","journal-title":"J Clean Prod"},{"issue":"2\u20133","key":"1677_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1080\/09537287.2011.591619","volume":"23","author":"M Garetti","year":"2012","unstructured":"Garetti M, Taisch M (2012) Sustainable manufacturing: trends and research challenges. Prod Plan Control 23(2\u20133):83\u2013104. https:\/\/doi.org\/10.1080\/09537287.2011.591619","journal-title":"Prod Plan Control"},{"key":"1677_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.cie.2018.05.014","volume":"121","author":"R Gedik","year":"2018","unstructured":"Gedik R, Kalathia D, Egilmez G, Kirac E (2018) A constraint programming approach for solving unrelated parallel machine scheduling problem. Comput Ind Eng 121:139\u2013149. https:\/\/doi.org\/10.1016\/j.cie.2018.05.014","journal-title":"Comput Ind Eng"},{"key":"1677_CR13","doi-asserted-by":"publisher","first-page":"105782","DOI":"10.1016\/j.asoc.2019.105782","volume":"85","author":"FJ Gil-Gala","year":"2019","unstructured":"Gil-Gala FJ, Menc\u00eda C, Sierra MR, Varela R (2019) Evolving priority rules for on-line scheduling of jobs on a single machine with variable capacity over time. Appl Soft Comput 85:105782. https:\/\/doi.org\/10.1016\/j.asoc.2019.105782","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1677_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.3233\/ICA-200634","volume":"28","author":"FJ Gil-Gala","year":"2020","unstructured":"Gil-Gala FJ, Menc\u00eda C, Sierra MR, Varela R (2020) Learning ensembles of priority rules for online scheduling by hybrid evolutionary algorithms. Integr Comput-Aided Eng 28(1):65\u201380. https:\/\/doi.org\/10.3233\/ICA-200634","journal-title":"Integr Comput-Aided Eng"},{"key":"1677_CR15","doi-asserted-by":"publisher","unstructured":"Gil-Gala FJ, Sierra MR, Menc\u00eda C, Varela R (2020) Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling. Nat Comput. https:\/\/doi.org\/10.1007\/s11047-020-09793-4","DOI":"10.1007\/s11047-020-09793-4"},{"key":"1677_CR16","doi-asserted-by":"publisher","first-page":"100944","DOI":"10.1016\/j.swevo.2021.100944","volume":"66","author":"FJ Gil-Gala","year":"2021","unstructured":"Gil-Gala FJ, Sierra MR, Menc\u00eda C, Varela R (2021) Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity. Swarm and Evolutionary Computation 66:100944. https:\/\/doi.org\/10.1016\/j.swevo.2021.100944","journal-title":"Swarm and Evolutionary Computation"},{"issue":"2","key":"1677_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10710-005-7580-7","volume":"6","author":"E Hart","year":"2005","unstructured":"Hart E, Ross P, Corne D (2005) Evolutionary scheduling: a review. Genet Program Evol Mach 6(2):191\u2013220. https:\/\/doi.org\/10.1007\/s10710-005-7580-7","journal-title":"Genet Program Evol Mach"},{"issue":"4","key":"1677_CR18","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1162\/EVCO_a_00183","volume":"24","author":"E Hart","year":"2016","unstructured":"Hart E, Sim K (2016) A hyper-heuristic ensemble method for static job-shop scheduling. Evol Comput 24(4):609\u2013635. https:\/\/doi.org\/10.1162\/EVCO_a_00183","journal-title":"Evol Comput"},{"key":"1677_CR19","doi-asserted-by":"publisher","unstructured":"Huang Z, Mei Y, Zhang F, Zhang M (2024) Toward evolving dispatching rules with flow control operations by grammar-guided linear genetic programming. IEEE Trans Evol Comput. https:\/\/doi.org\/10.1109\/TEVC.2024.3353207","DOI":"10.1109\/TEVC.2024.3353207"},{"issue":"2","key":"1677_CR20","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/j.ejor.2021.06.058","volume":"299","author":"YC Hung","year":"2022","unstructured":"Hung YC, Lok HP, Michailidis G (2022) Optimal routing for electric vehicle charging systems with stochastic demand: a heavy traffic approximation approach. Eur J Oper Res 299(2):526\u2013541. https:\/\/doi.org\/10.1016\/j.ejor.2021.06.058","journal-title":"Eur J Oper Res"},{"key":"1677_CR21","doi-asserted-by":"publisher","first-page":"114548","DOI":"10.1016\/j.eswa.2020.114548","volume":"172","author":"K Jaklinovi\u0107","year":"2021","unstructured":"Jaklinovi\u0107 K, \u0110urasevi\u0107 M, Jakobovi\u0107 D (2021) Designing dispatching rules with genetic programming for the unrelated machines environment with constraints. Expert Syst Appl 172:114548. https:\/\/doi.org\/10.1016\/j.eswa.2020.114548","journal-title":"Expert Syst Appl"},{"key":"1677_CR22","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-540-71605-1_30","volume-title":"Genetic programming","author":"D Jakobovi\u0107","year":"2007","unstructured":"Jakobovi\u0107 D, Jelenkovi\u0107 L, Budin L (2007) Genetic programming heuristics for multiple machine scheduling. In: Ebner M, O\u2019Neill M, Ek\u00e1rt A, Vanneschi L, Esparcia-Alc\u00e1zar AI (eds) Genetic programming. Springer, Berlin, pp 321\u2013330. https:\/\/doi.org\/10.1007\/978-3-540-71605-1_30"},{"issue":"1","key":"1677_CR23","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0736-5845(02)00077-7","volume":"19","author":"DW Kim","year":"2003","unstructured":"Kim DW, Na DG, Chen FF (2003) Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robot Comput-Integr Manuf 19(1):173\u2013181. https:\/\/doi.org\/10.1016\/S0736-5845(02)00077-7","journal-title":"Robot Comput-Integr Manuf"},{"issue":"9\u201312","key":"1677_CR24","doi-asserted-by":"publisher","first-page":"2081","DOI":"10.1007\/s00170-013-5192-6","volume":"69","author":"JH Lee","year":"2013","unstructured":"Lee JH, Yu JM, Lee DH (2013) A tabu search algorithm for unrelated parallel machine scheduling with sequence- and machine-dependent setups: minimizing total tardiness. Int J Adv Manuf Technol 69(9\u201312):2081\u20132089. https:\/\/doi.org\/10.1007\/s00170-013-5192-6","journal-title":"Int J Adv Manuf Technol"},{"key":"1677_CR25","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10951-005-4781-0","volume":"8","author":"X Li","year":"2005","unstructured":"Li X, Olafsson S (2005) Discovering dispatching rules using data mining. J Sched 8:515\u2013527. https:\/\/doi.org\/10.1007\/s10951-005-4781-0","journal-title":"J Sched"},{"key":"1677_CR26","doi-asserted-by":"publisher","unstructured":"Liang P, Dong Yang H, Sheng Liu G, Hua Guo J (2015) An ant optimization model for unrelated parallel machine scheduling with energy consumption and total tardiness. Math Probl Eng 2015:1\u20138. https:\/\/doi.org\/10.1155\/2015\/907034","DOI":"10.1155\/2015\/907034"},{"issue":"1\u20134","key":"1677_CR27","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00170-013-4766-7","volume":"67","author":"CW Lin","year":"2013","unstructured":"Lin CW, Lin YK, Hsieh HT (2013) Ant colony optimization for unrelated parallel machine scheduling. Int J Adv Manuf Technol 67(1\u20134):35\u201345. https:\/\/doi.org\/10.1007\/s00170-013-4766-7","journal-title":"Int J Adv Manuf Technol"},{"key":"1677_CR28","doi-asserted-by":"publisher","first-page":"119071","DOI":"10.1016\/j.jclepro.2019.119071","volume":"246","author":"Z Liu","year":"2020","unstructured":"Liu Z, Yan J, Cheng Q, Yang C, Sun S, Xue D (2020) The mixed production mode considering continuous and intermittent processing for an energy-efficient hybrid flow shop scheduling. J Clean Prod 246:119071. https:\/\/doi.org\/10.1016\/j.jclepro.2019.119071","journal-title":"J Clean Prod"},{"key":"1677_CR29","doi-asserted-by":"publisher","unstructured":"Masood A, Chen G, Mei Y, Al-Sahaf H, Zhang M (2020) A fitness-based selection method for pareto local search for many-objective job shop scheduling. In: 2020 IEEE congress on evolutionary computation (CEC), vol\u00a059. IEEE, pp 1\u20138. https:\/\/doi.org\/10.1109\/cec48606.2020.9185881","DOI":"10.1109\/cec48606.2020.9185881"},{"key":"1677_CR30","doi-asserted-by":"publisher","unstructured":"Masood A, Mei Y, Chen G, Zhang M (2016) Many-objective genetic programming for job-shop scheduling. In: 2016 IEEE congress on evolutionary computation (CEC), pp 209\u2013216. https:\/\/doi.org\/10.1109\/CEC.2016.7743797","DOI":"10.1109\/CEC.2016.7743797"},{"key":"1677_CR31","unstructured":"Miyashita K (2000) Job-shop scheduling with genetic programming. In: Proceedings of the 2nd annual conference on genetic and evolutionary computation, GECCO\u201900. Morgan Kaufmann Publishers Inc., San Francisco, pp 505\u2013512"},{"key":"1677_CR32","doi-asserted-by":"publisher","unstructured":"Nanthapodej R, Liu CH, Nitisiri K, Pattanapairoj S (2021) Hybrid differential evolution algorithm and adaptive large neighborhood search to solve parallel machine scheduling to minimize energy consumption in consideration of machine-load balance problems. Sustainability 13(10). https:\/\/doi.org\/10.3390\/su13105470","DOI":"10.3390\/su13105470"},{"key":"1677_CR33","doi-asserted-by":"publisher","unstructured":"Nanthapodej R, Liu CH, Nitisiri K, Pattanapairoj S (2021) Variable neighborhood strategy adaptive search to solve parallel-machine scheduling to minimize energy consumption while considering job priority and control makespan. Appl Sci 11(11). https:\/\/doi.org\/10.3390\/app11115311","DOI":"10.3390\/app11115311"},{"issue":"1","key":"1677_CR34","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s40747-017-0036-x","volume":"3","author":"S Nguyen","year":"2017","unstructured":"Nguyen S, Mei Y, Zhang M (2017) Genetic programming for production scheduling: a survey with a unified framework. Complex Intell Syst 3(1):41\u201366. https:\/\/doi.org\/10.1007\/s40747-017-0036-x","journal-title":"Complex Intell Syst"},{"issue":"5","key":"1677_CR35","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TEVC.2012.2227326","volume":"17","author":"S Nguyen","year":"2013","unstructured":"Nguyen S, Zhang M, Johnston M, Tan KC (2013) A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem. IEEE Trans Evol Comput 17(5):621\u2013639. https:\/\/doi.org\/10.1109\/TEVC.2012.2227326","journal-title":"IEEE Trans Evol Comput"},{"key":"1677_CR36","doi-asserted-by":"publisher","unstructured":"Nguyen S, Zhang M, Johnston M, Tan KC (2013) Dynamic multi-objective job shop scheduling: A genetic programming approach. In: Studies in computational intelligence. Springer, Berlin, pp 251\u2013282. https:\/\/doi.org\/10.1007\/978-3-642-39304-4_10","DOI":"10.1007\/978-3-642-39304-4_10"},{"issue":"5\u20138","key":"1677_CR37","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s00170-010-2518-5","volume":"50","author":"L Nie","year":"2010","unstructured":"Nie L, Shao X, Gao L, Li W (2010) Evolving scheduling rules with gene expression programming for dynamic single-machine scheduling problems. Int J Adv Manuf Technol 50(5\u20138):729\u2013747. https:\/\/doi.org\/10.1007\/s00170-010-2518-5","journal-title":"Int J Adv Manuf Technol"},{"key":"1677_CR38","doi-asserted-by":"publisher","unstructured":"Pan Z, Lei D, Wang L (2020) A knowledge-based two-population optimization algorithm for distributed energy-efficient parallel machines scheduling. IEEE Trans Cybern, 1\u201313. https:\/\/doi.org\/10.1109\/TCYB.2020.3026571","DOI":"10.1109\/TCYB.2020.3026571"},{"key":"1677_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2018\/5914360","volume":"2018","author":"Z Pan","year":"2018","unstructured":"Pan Z, Lei D, Zhang Q (2018) A new imperialist competitive algorithm for multiobjective low carbon parallel machines scheduling. Math Probl Eng 2018:1\u201313. https:\/\/doi.org\/10.1155\/2018\/5914360","journal-title":"Math Probl Eng"},{"key":"1677_CR40","doi-asserted-by":"publisher","unstructured":"Park J, Mei Y, Nguyen S, Chen G, 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. https:\/\/doi.org\/10.1016\/j.asoc.2017.11.020","DOI":"10.1016\/j.asoc.2017.11.020"},{"key":"1677_CR41","doi-asserted-by":"publisher","unstructured":"Park J, Mei Y, Nguyen S, Chen G, Zhang M (2018) Investigating a machine breakdown genetic programming approach for dynamic job shop scheduling. In: Lecture Notes in Computer Science. Springer International Publishing, pp 253\u2013270. https:\/\/doi.org\/10.1007\/978-3-319-77553-1_16","DOI":"10.1007\/978-3-319-77553-1_16"},{"key":"1677_CR42","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-16501-1_8","volume-title":"Genetic programming","author":"J Park","year":"2015","unstructured":"Park J, Nguyen S, Zhang M, Johnston M (2015) Evolving ensembles of dispatching rules using genetic programming for job shop scheduling. In: Machado P, Heywood MI, McDermott J, Castelli M, Garc\u00eda-S\u00e1nchez P, Burelli P, Risi S, Sim K (eds) Genetic programming. Springer International Publishing, Cham, pp 92\u2013104. https:\/\/doi.org\/10.1007\/978-3-319-16501-1_8"},{"key":"1677_CR43","doi-asserted-by":"publisher","unstructured":"Pinedo ML (2012) Scheduling. Springer US. https:\/\/doi.org\/10.1007\/978-1-4614-2361-4","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"1677_CR44","doi-asserted-by":"publisher","first-page":"22886","DOI":"10.1109\/ACCESS.2022.3151346","volume":"10","author":"L Planini\u0107","year":"2022","unstructured":"Planini\u0107 L, Backovi\u0107 H, \u0110urasevi\u0107 M, Jakobovi\u0107 D (2022) A comparative study of dispatching rule representations in evolutionary algorithms for the dynamic unrelated machines environment. IEEE Access 10:22886\u201322901. https:\/\/doi.org\/10.1109\/ACCESS.2022.3151346","journal-title":"IEEE Access"},{"key":"1677_CR45","volume-title":"A field guide to genetic programming","author":"R Poli","year":"2008","unstructured":"Poli R, Langdon WB, McPhee NF (2008) A field guide to genetic programming. Lulu Enterprises, UK"},{"key":"1677_CR46","doi-asserted-by":"publisher","first-page":"119393","DOI":"10.1016\/j.jclepro.2019.119393","volume":"249","author":"H Saberi-Aliabad","year":"2020","unstructured":"Saberi-Aliabad H, Reisi-Nafchi M, Moslehi G (2020) Energy-efficient scheduling in an unrelated parallel-machine environment under time-of-use electricity tariffs. J Clean Prod 249:119393. https:\/\/doi.org\/10.1016\/j.jclepro.2019.119393","journal-title":"J Clean Prod"},{"key":"1677_CR47","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.jclepro.2019.01.166","volume":"217","author":"H Safarzadeh","year":"2019","unstructured":"Safarzadeh H, Niaki STA (2019) Bi-objective green scheduling in uniform parallel machine environments. J Clean Prod 217:559\u2013572. https:\/\/doi.org\/10.1016\/j.jclepro.2019.01.166","journal-title":"J Clean Prod"},{"key":"1677_CR48","doi-asserted-by":"publisher","unstructured":"Satopaa V, Albrecht J, Irwin D, Raghavan B (2011) Finding a \u201ckneedle\u201d in a haystack: Detecting knee points in system behavior. In: 2011 31st International conference on distributed computing systems workshops. IEEE. https:\/\/doi.org\/10.1109\/icdcsw.2011.20","DOI":"10.1109\/icdcsw.2011.20"},{"key":"1677_CR49","doi-asserted-by":"publisher","unstructured":"Sbihi A, Eglese RW (2007) Combinatorial optimization and green logistics. 4OR 5(2):99\u2013116. https:\/\/doi.org\/10.1007\/s10288-007-0047-3","DOI":"10.1007\/s10288-007-0047-3"},{"key":"1677_CR50","doi-asserted-by":"publisher","first-page":"119428","DOI":"10.1016\/j.jclepro.2019.119428","volume":"249","author":"H Soleimani","year":"2020","unstructured":"Soleimani H, Ghaderi H, Tsai PW, Zarbakhshnia N, Maleki M (2020) Scheduling of unrelated parallel machines considering sequence-related setup time, start time-dependent deterioration, position-dependent learning and power consumption minimization. J Clean Prod 249:119428. https:\/\/doi.org\/10.1016\/j.jclepro.2019.119428","journal-title":"J Clean Prod"},{"issue":"3","key":"1677_CR51","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.cie.2007.08.008","volume":"54","author":"JC Tay","year":"2008","unstructured":"Tay JC, Ho NB (2008) Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput Ind Eng 54(3):453\u2013473. https:\/\/doi.org\/10.1016\/j.cie.2007.08.008","journal-title":"Comput Ind Eng"},{"key":"1677_CR52","doi-asserted-by":"publisher","first-page":"107606","DOI":"10.1016\/j.asoc.2021.107606","volume":"110","author":"M \u0110umi\u0107","year":"2021","unstructured":"\u0110umi\u0107 M, Jakobovi\u0107 D (2021) Ensembles of priority rules for resource constrained project scheduling problem. Appl Soft Comput 110:107606. https:\/\/doi.org\/10.1016\/j.asoc.2021.107606","journal-title":"Appl Soft Comput"},{"key":"1677_CR53","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.future.2018.04.029","volume":"86","author":"M \u0110umi\u0107","year":"2018","unstructured":"\u0110umi\u0107 M, \u0160i\u0161ejkovi\u0107 D, \u010cori\u0107 R, Jakobovi\u0107 D (2018) Evolving priority rules for resource constrained project scheduling problem with genetic programming. Future Gen Comput Syst 86:211\u2013221. https:\/\/doi.org\/10.1016\/j.future.2018.04.029","journal-title":"Future Gen Comput Syst"},{"key":"1677_CR54","doi-asserted-by":"publisher","unstructured":"\u0110urasevi\u0107, Jakobovi\u0107 D (2022) Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey. Artif Intell Rev. https:\/\/doi.org\/10.1007\/s10462-022-10247-9","DOI":"10.1007\/s10462-022-10247-9"},{"issue":"1\u20132","key":"1677_CR55","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10710-017-9302-3","volume":"19","author":"M \u0110urasevi\u0107","year":"2017","unstructured":"\u0110urasevi\u0107 M, Jakobovi\u0107 D (2017) Comparison of ensemble learning methods for creating ensembles of dispatching rules for the unrelated machines environment. Genet Program Evol Mach 19(1\u20132):53\u201392. https:\/\/doi.org\/10.1007\/s10710-017-9302-3","journal-title":"Genet Program Evol Mach"},{"issue":"1\u20132","key":"1677_CR56","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10710-017-9310-3","volume":"19","author":"M \u0110urasevi\u0107","year":"2017","unstructured":"\u0110urasevi\u0107 M, Jakobovi\u0107 D (2017) Evolving dispatching rules for optimising many-objective criteria in the unrelated machines environment. Genet Program Evol Mach 19(1\u20132):9\u201351. https:\/\/doi.org\/10.1007\/s10710-017-9310-3","journal-title":"Genet Program Evol Mach"},{"key":"1677_CR57","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.eswa.2018.06.053","volume":"113","author":"M \u0110urasevi\u0107","year":"2018","unstructured":"\u0110urasevi\u0107 M, Jakobovi\u0107 D (2018) A survey of dispatching rules for the dynamic unrelated machines environment. Expert Syst Appl 113:555\u2013569. https:\/\/doi.org\/10.1016\/j.eswa.2018.06.053","journal-title":"Expert Syst Appl"},{"issue":"6","key":"1677_CR58","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s10732-019-09416-x","volume":"25","author":"M \u0110urasevi\u0107","year":"2019","unstructured":"\u0110urasevi\u0107 M, Jakobovi\u0107 D (2019) Creating dispatching rules by simple ensemble combination. J Heurist 25(6):959\u20131013. https:\/\/doi.org\/10.1007\/s10732-019-09416-x","journal-title":"J Heurist"},{"key":"1677_CR59","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.asoc.2016.07.025","volume":"48","author":"M \u0110urasevi\u0107","year":"2016","unstructured":"\u0110urasevi\u0107 M, Jakobovi\u0107 D, Kne\u017eevi\u0107 K (2016) Adaptive scheduling on unrelated machines with genetic programming. Appl Soft Comput 48:419\u2013430. https:\/\/doi.org\/10.1016\/j.asoc.2016.07.025","journal-title":"Appl Soft Comput"},{"key":"1677_CR60","doi-asserted-by":"publisher","unstructured":"\u0110urasevi\u0107 M, Planini\u0107 L, Gil-Gala FJ, Jakobovi\u0107 D (2022) Novel ensemble collaboration method for dynamic scheduling problems. In: Proceedings of the genetic and evolutionary computation conference, GECCO \u201922. Association for Computing Machinery, New York, pp 893\u2013901. https:\/\/doi.org\/10.1145\/3512290.3528807","DOI":"10.1145\/3512290.3528807"},{"key":"1677_CR61","doi-asserted-by":"publisher","first-page":"126093","DOI":"10.1016\/j.jclepro.2021.126093","volume":"293","author":"J Wang","year":"2021","unstructured":"Wang J, Liu Y, Ren S, Wang C, Wang W (2021) Evolutionary game based real-time scheduling for energy-efficient distributed and flexible job shop. J Clean Prod 293:126093. https:\/\/doi.org\/10.1016\/j.jclepro.2021.126093","journal-title":"J Clean Prod"},{"key":"1677_CR62","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ijpe.2018.04.013","volume":"201","author":"L Wu","year":"2018","unstructured":"Wu L, Wang S (2018) Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks. Int J Prod Econ 201:26\u201340. https:\/\/doi.org\/10.1016\/j.ijpe.2018.04.013","journal-title":"Int J Prod Econ"},{"key":"1677_CR63","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.omega.2018.01.001","volume":"82","author":"X Wu","year":"2019","unstructured":"Wu X, Che A (2019) A memetic differential evolution algorithm for energy-efficient parallel machine scheduling. Omega 82:155\u2013165. https:\/\/doi.org\/10.1016\/j.omega.2018.01.001","journal-title":"Omega"},{"key":"1677_CR64","doi-asserted-by":"publisher","first-page":"128867","DOI":"10.1016\/j.jclepro.2021.128867","volume":"320","author":"Y Xiao","year":"2021","unstructured":"Xiao Y, Zheng Y, Yu Y, Zhang L, Lin X, Li B (2021) A branch and bound algorithm for a parallel machine scheduling problem in green manufacturing industry considering time cost and power consumption. J Clean Prod 320:128867. https:\/\/doi.org\/10.1016\/j.jclepro.2021.128867","journal-title":"J Clean Prod"},{"issue":"1","key":"1677_CR65","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1162\/evco_a_00273","volume":"29","author":"B Xu","year":"2021","unstructured":"Xu B, Mei Y, Wang Y, Ji Z, Zhang M (2021) Genetic programming with delayed routing for multiobjective dynamic flexible job shop scheduling. Evol Comput 29(1):75\u2013105. https:\/\/doi.org\/10.1162\/evco_a_00273","journal-title":"Evol Comput"},{"issue":"11","key":"1677_CR66","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1023\/a:1016185412209","volume":"34","author":"L Yu","year":"2002","unstructured":"Yu L, Shih HM, Pfund M, Carlyle WM, Fowler JW (2002) Scheduling of unrelated parallel machines: an application to PWB manufacturing. IIE Trans 34(11):921\u2013931. https:\/\/doi.org\/10.1023\/a:1016185412209","journal-title":"IIE Trans"},{"key":"1677_CR67","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1016\/j.jclepro.2018.02.224","volume":"183","author":"Z Zeng","year":"2018","unstructured":"Zeng Z, Hong M, Man Y, Li J, Zhang Y, Liu H (2018) Multi-object optimization of flexible flow shop scheduling with batch process\u2014consideration total electricity consumption and material wastage. J Clean Prod 183:925\u2013939. https:\/\/doi.org\/10.1016\/j.jclepro.2018.02.224","journal-title":"J Clean Prod"},{"key":"1677_CR68","doi-asserted-by":"publisher","unstructured":"Zhang F, Mei Y, Nguyen S, Tan KC, Zhang M (2021) Multitask genetic programming-based generative hyperheuristics: a case study in dynamic scheduling. IEEE Trans Cybern, 1\u201314. https:\/\/doi.org\/10.1109\/TCYB.2021.3065340","DOI":"10.1109\/TCYB.2021.3065340"},{"key":"1677_CR69","doi-asserted-by":"publisher","unstructured":"Zhang F, Mei Y, Nguyen S, Zhang M (2021) Evolving scheduling heuristics via genetic programming with feature selection in dynamic flexible job-shop scheduling. IEEE Trans Cybern 51(4):1797\u20131811. https:\/\/doi.org\/10.1109\/TCYB.2020.3024849","DOI":"10.1109\/TCYB.2020.3024849"},{"issue":"7","key":"1677_CR70","doi-asserted-by":"publisher","first-page":"4473","DOI":"10.1109\/tcyb.2022.3196887","volume":"53","author":"F Zhang","year":"2023","unstructured":"Zhang F, Mei Y, Nguyen S, Zhang M (2023) Multitask multiobjective genetic programming for automated scheduling heuristic learning in dynamic flexible job-shop scheduling. IEEE Trans Cybern 53(7):4473\u20134486. https:\/\/doi.org\/10.1109\/tcyb.2022.3196887","journal-title":"IEEE Trans Cybern"},{"key":"1677_CR71","doi-asserted-by":"publisher","unstructured":"Zhang F, Mei Y, Nguyen S, Zhang M, Tan KC (2021) Surrogate-assisted evolutionary multitask genetic programming for dynamic flexible job shop scheduling. IEEE Trans Evol Comput 25(4):651\u2013665. https:\/\/doi.org\/10.1109\/TEVC.2021.3065707","DOI":"10.1109\/TEVC.2021.3065707"},{"key":"1677_CR72","doi-asserted-by":"publisher","first-page":"114843","DOI":"10.1016\/j.eswa.2021.114843","volume":"175","author":"L Zhang","year":"2021","unstructured":"Zhang L, Deng Q, Lin R, Gong G, Han W (2021) A combinatorial evolutionary algorithm for unrelated parallel machine scheduling problem with sequence and machine-dependent setup times, limited worker resources and learning effect. Expert Syst Appl 175:114843. https:\/\/doi.org\/10.1016\/j.eswa.2021.114843","journal-title":"Expert Syst Appl"},{"issue":"5","key":"1677_CR73","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1109\/TSMC.2016.2616347","volume":"48","author":"XL Zheng","year":"2018","unstructured":"Zheng XL, Wang L (2018) A collaborative multiobjective fruit fly optimization algorithm for the resource constrained unrelated parallel machine green scheduling problem. IEEE Trans Syst Man Cybern Syst 48(5):790\u2013800. https:\/\/doi.org\/10.1109\/TSMC.2016.2616347","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1677_CR74","doi-asserted-by":"publisher","first-page":"130541","DOI":"10.1016\/j.jclepro.2022.130541","volume":"337","author":"G Zhou","year":"2022","unstructured":"Zhou G, Chen Z, Zhang C, Chang F (2022) An adaptive ensemble deep forest based dynamic scheduling strategy for low carbon flexible job shop under recessive disturbance. J Clean Prod 337:130541. https:\/\/doi.org\/10.1016\/j.jclepro.2022.130541","journal-title":"J Clean Prod"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01677-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01677-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01677-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T20:22:28Z","timestamp":1738268548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01677-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,5]]},"references-count":74,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1677"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01677-9","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2024,12,5]]},"assertion":[{"value":"24 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"67"}}