{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T17:55:09Z","timestamp":1781373309911,"version":"3.54.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Royal Melbourne Institute of Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Scheduling is a fundamental component of dynamic and complex manufacturing systems, coordinating resources efficiently and ensuring timely production. However, designing efficient scheduling rules to maximize delivery performance and resource allocation is challenging due to uncertainty in job arrivals, machine status, and routing changes. Existing Genetic Programming (GP) approaches can automatically evolve scheduling rules but remain limited by their dependence on simulation models, extensive data requirements, and limited adaptability to changing conditions. The goal of this research is to overcome the above challenges by developing the first Online Genetic Programming (OGP) framework that learns scheduling strategies directly within the operating environment and without relying on prior knowledge or an explicit simulation models. The novelty of this research lies in the development of an adaptive fitness function that combines real-time performance feedback with predictive evaluation from a phenotypic archive, allowing the search process to balance short-term adaptability and long-term learning stability. A pre-selection strategy further refines candidate solutions while controlling rule complexity, and a soft restart mechanism sustains diversity during extended evolutionary runs. Dynamic flexible job shop scheduling problems (DFJSP) were used as representative test environments to evaluate the method\u2019s effectiveness. Experimental results on DFJSP demonstrate that OGP outperforms existing scheduling algorithms when jointly considering scheduling and routing decisions. When used as an automated heuristic design method, the proposed method can generate competitive rules compared to the state-of-the-art genetic programming methods in terms of test performance and the size of evolved rules. These findings highlight OGP as a robust and generalisable optimisation framework for dynamic decision-making in changing environments.<\/jats:p>","DOI":"10.1007\/s10710-025-09529-2","type":"journal-article","created":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T08:26:06Z","timestamp":1771835166000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards online genetic programming approach to dynamic flexible job shop scheduling"],"prefix":"10.1007","volume":"27","author":[{"given":"Su","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Binh","family":"Tran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuan Nam","family":"Ngo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Duy Thinh","family":"Tran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,2,23]]},"reference":[{"key":"9529_CR1","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/TEVC.2015.2429314","volume":"20","author":"J Branke","year":"2016","unstructured":"J. Branke, S. Nguyen, C.W. Pickardt, M. Zhang, Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20, 110\u2013124 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9529_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s40747-017-0036-x","volume":"3","author":"S Nguyen","year":"2017","unstructured":"S. Nguyen, Y. Mei, M. Zhang, Genetic programming for production scheduling: a survey with a unified framework. Complex Intell. Syst. 3, 41\u201366 (2017)","journal-title":"Complex Intell. Syst."},{"key":"9529_CR3","doi-asserted-by":"crossref","unstructured":"E. Burke, et al. in Exploring hyper-heuristic methodologies with genetic programming, ed. by C.L. Mumford, L.C. Jain (Springer, Berlin Heidelberg, 2009), Computational Intelligence, Vol. 1 of Intelligent Systems Reference Library 177\u2013201","DOI":"10.1007\/978-3-642-01799-5_6"},{"key":"9529_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1162\/EVCO_a_00044","volume":"20","author":"EK Burke","year":"2012","unstructured":"E.K. Burke, M.R. Hyde, G. Kendall, J. Woodward, Automating the packing heuristic design process with genetic programming. Evol. Comput. 20, 63\u201389 (2012)","journal-title":"Evol. Comput."},{"key":"9529_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1057\/jors.2010.132","volume":"62","author":"JA Vazquez-Rodriguez","year":"2011","unstructured":"J.A. Vazquez-Rodriguez, G. Ochoa, On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming. J. Oper. Res. Soc. 62, 381\u2013396 (2011)","journal-title":"J. Oper. Res. Soc."},{"key":"9529_CR6","doi-asserted-by":"crossref","unstructured":"J. Park, S. Nguyen, M. Zhang, M. Johnston, in Enhancing heuristics for order acceptance and scheduling using genetic programming, ed. by M. Zhang, K.C. Tan, Z. Zhu, H. Ishibuchi, Y.S. Ong, (Springer International Publishing, 2014), Simulated Evolution and Learning Lecture Notes in Computer Science, pp. 723\u2013734","DOI":"10.1007\/978-3-319-13563-2_61"},{"key":"9529_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100985","volume":"69","author":"L Cheng","year":"2022","unstructured":"L. Cheng, Q. Tang, L. Zhang, Z. Zhang, Multi-objective q-learning-based hyper-heuristic with bi-criteria selection for energy-aware mixed shop scheduling. Swarm Evol. Comput. 69, 100985 (2022)","journal-title":"Swarm Evol. Comput."},{"key":"9529_CR8","volume-title":"Genetic Programming: on the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"J.R. Koza, Genetic Programming: on the Programming of Computers by Means of Natural Selection (MIT Press, Cambridge, MA, 1992)"},{"key":"9529_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100807","volume":"60","author":"H-B Song","year":"2021","unstructured":"H.-B. Song, J. Lin, A genetic programming hyper-heuristic for the distributed assembly permutation flow-shop scheduling problem with sequence dependent setup times. Swarm Evol. Comput. 60, 100807 (2021)","journal-title":"Swarm Evol. Comput."},{"key":"9529_CR10","doi-asserted-by":"publisher","first-page":"4473","DOI":"10.1109\/TCYB.2022.3196887","volume":"53","author":"F Zhang","year":"2023","unstructured":"F. Zhang, Y. Mei, S. Nguyen, M. Zhang, Multitask multiobjective genetic programming for automated scheduling heuristic learning in dynamic flexible job-shop scheduling. IEEE Trans. Cybern. 53, 4473\u20134486 (2023)","journal-title":"IEEE Trans. Cybern."},{"key":"9529_CR11","doi-asserted-by":"crossref","unstructured":"T. Eguchi, F. Oba, T. Hirai, in A neural network approach to dynamic job shop scheduling, ed. by K. Mertins, O. Krause, B. Schallock, (Springer, New York, 1999) Global Production Management, Vol. 24 of IFIP - The International Federation for Information Processing pp. 152\u2013159","DOI":"10.1007\/978-0-387-35569-6_19"},{"key":"9529_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10845-008-0073-9","volume":"19","author":"GR Weckman","year":"2008","unstructured":"G.R. Weckman, C.V. Ganduri, D.A. Koonce, A neural network job-shop scheduler. J. Intell. Manuf. 19, 191\u2013201 (2008)","journal-title":"J. Intell. Manuf."},{"key":"9529_CR13","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ins.2014.11.036","volume":"298","author":"XN Shen","year":"2015","unstructured":"X.N. Shen, X. Yao, Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Inf. Sci. 298, 198\u2013224 (2015)","journal-title":"Inf. Sci."},{"key":"9529_CR14","doi-asserted-by":"crossref","unstructured":"M.E. Pfund, S.J. Mason, J.W. Fowler, in Semiconductor manufacturing scheduling and dispatching: state of the art and survey of needs, ed. by J.W. Herrmann, (Springer, New York, 2006) Handbook of Production Scheduling, Vol. 89 of International Series in Operations Research & Management Science pp. 213\u2013241","DOI":"10.1007\/0-387-33117-4_9"},{"key":"9529_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.jmsy.2023.01.004","volume":"67","author":"C Destouet","year":"2023","unstructured":"C. Destouet, H. Tlahig, B. Bettayeb, B. Mazari, Flexible job shop scheduling problem under industry 5.0: a survey on human reintegration, environmental consideration and resilience improvement. J. Manuf. Syst. 67, 155\u2013173 (2023)","journal-title":"J. Manuf. Syst."},{"key":"9529_CR16","doi-asserted-by":"crossref","unstructured":"C. Pickardt, J. Branke, T. Hildebrandt, J. Heger, B. Scholz-Reiter, B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, E. Y\u00fccesan (eds.), Generating dispatching rules for semiconductor manufacturing to minimize weighted tardiness. Proceedings of the 2010 Winter Simulation Conference, pp. 2504\u20132515 (IEEE Press, Piscataway, NJ, 2010)","DOI":"10.1109\/WSC.2010.5678946"},{"key":"9529_CR17","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1080\/07408178708975402","volume":"19","author":"NR Adam","year":"1987","unstructured":"N.R. Adam, J.W.M. Bertrand, J. Surkis, Priority assignment procedures in multi-level assembly job shops. IIE Trans. 19, 317\u2013328 (1987)","journal-title":"IIE Trans."},{"key":"9529_CR18","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TEVC.2012.2227326","volume":"17","author":"S Nguyen","year":"2013","unstructured":"S. Nguyen, M. Zhang, M. Johnston, K.C. Tan, A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem. IEEE Trans. Evol. Comput. 17, 621\u2013639 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9529_CR19","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s10845-012-0626-9","volume":"24","author":"L Nie","year":"2013","unstructured":"L. Nie, L. Gao, P. Li, X. Li, A gep-based policies constructing approach for dynamic flexible job shop scheduling problem with job release dates. J. Intell. Manuf. 24, 763\u2013774 (2013)","journal-title":"J. Intell. Manuf."},{"key":"9529_CR20","doi-asserted-by":"crossref","unstructured":"D. Ivanov, A. Dolgui, B. Sokolov, in A dynamic approach to multi-stage job shop scheduling in an industry 4.0-based flexible assembly system, ed. by H. L\u00f6dding, R. Riedel, K.-D. Thoben, G. von Cieminski, D. Kiritsis, (Springer International Publishing, 2017), Advances in Production Management Systems 475\u2013482","DOI":"10.1007\/978-3-319-66923-6_56"},{"key":"9529_CR21","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"ML Pinedo","year":"2008","unstructured":"M.L. Pinedo, Scheduling: Theory, Algorithms, and Systems, 3rd edn. (Springer, New York, 2008)","edition":"3"},{"key":"9529_CR22","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TSMC.2023.3305541","volume":"54","author":"R Li","year":"2023","unstructured":"R. Li, W. Gong, L. Wang, C. Lu, C. Dong, Co-evolution with deep reinforcement learning for energy-aware distributed heterogeneous flexible job shop scheduling. IEEE Trans. Syst. Man Cybern. Syst. 54, 201\u2013211 (2023)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"9529_CR23","doi-asserted-by":"publisher","first-page":"2729","DOI":"10.1109\/TEVC.2024.3521585","volume":"29","author":"C Luo","year":"2025","unstructured":"C. Luo, X. Li, W. Gong, L. Gao, Affinity propagation hierarchical memetic algorithm for multimodal multi-objective flexible job shop scheduling with variable speed. IEEE Trans. Evol. Comput. 29, 2729\u20132741 (2025)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9529_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121149","volume":"235","author":"C Luo","year":"2024","unstructured":"C. Luo, W. Gong, C. Lu, Knowledge-driven two-stage memetic algorithm for energy-efficient flexible job shop scheduling with machine breakdowns. Expert Syst. Appl. 235, 121149 (2024)","journal-title":"Expert Syst. Appl."},{"key":"9529_CR25","doi-asserted-by":"crossref","unstructured":"T. Hildebrandt, J. Heger, B. Scholz-Reiter, M. Pelikan, J. Branke, Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach. In: M. Pelikan, J.Branke (eds.), Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (GECCO \u201910), pp. 257\u2013264 (ACM Press, Portland, Oregon, USA, 2010)","DOI":"10.1145\/1830483.1830530"},{"key":"9529_CR26","doi-asserted-by":"publisher","first-page":"2781","DOI":"10.1016\/j.asoc.2012.03.065","volume":"12","author":"D Jakobovi\u0107","year":"2012","unstructured":"D. Jakobovi\u0107, K. Marasovi\u0107, Evolving priority scheduling heuristics with genetic programming. Appl. Soft Comput. 12, 2781\u20132789 (2012)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"9529_CR27","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1162\/EVCO_a_00183","volume":"24","author":"E Hart","year":"2016","unstructured":"E. Hart, K. Sim, A hyper-heuristic ensemble method for static job-shop scheduling. Evol. Comput. 24(4), 609\u2013635 (2016)","journal-title":"Evol. Comput."},{"key":"9529_CR28","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TEVC.2013.2248159","volume":"18","author":"S Nguyen","year":"2014","unstructured":"S. Nguyen, M. Zhang, M. Johnston, K.C. Tan, Automatic design of scheduling policies for dynamic multi-objective job shop scheduling via cooperative coevolution genetic programming. IEEE Trans. Evol. Comput. 18, 193\u2013208 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9529_CR29","doi-asserted-by":"crossref","unstructured":"S. Nguyen, M. Zhang, M. Johnston, K.C. Tan, in Dynamic multi-objective job shop scheduling: a genetic programming approach, ed. by A.S. Uyar, E. Ozcan, N. Urquhart, (Springer, Berlin Heidelberg, 2013), Automated Scheduling and Planning, Vol. 505 of Studies in Computational Intelligence pp. 251\u2013282","DOI":"10.1007\/978-3-642-39304-4_10"},{"key":"9529_CR30","volume-title":"Simulation Modeling and Analysis","author":"AM Law","year":"1999","unstructured":"A.M. Law, D.M. Kelton, Simulation Modeling and Analysis (McGraw-Hill Higher Education, 1999)"},{"key":"9529_CR31","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1162\/EVCO_a_00133","volume":"23","author":"T Hildebrandt","year":"2014","unstructured":"T. Hildebrandt, J. Branke, On using surrogates with genetic programming. Evol. Comput. 23, 343\u2013367 (2014)","journal-title":"Evol. Comput."},{"issue":"9","key":"9529_CR32","doi-asserted-by":"publisher","first-page":"2951","DOI":"10.1109\/TCYB.2016.2562674","volume":"47","author":"S Nguyen","year":"2016","unstructured":"S. Nguyen, M. Zhang, K.C. Tan, Surrogate-assisted genetic programming with simplified models for automated design of dispatching rules. IEEE Trans. Cybern. 47(9), 2951\u20132965 (2016)","journal-title":"IEEE Trans. Cybern."},{"key":"9529_CR33","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1109\/TEVC.2021.3065707","volume":"25","author":"F Zhang","year":"2021","unstructured":"F. Zhang, Y. Mei, S. Nguyen, M. Zhang, K.C. Tan, Surrogate-assisted evolutionary multitask genetic programming for dynamic flexible job shop scheduling. IEEE Trans. Evol. Comput. 25, 651\u2013665 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9529_CR34","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1162\/EVCO_a_00131","volume":"23","author":"J Branke","year":"2015","unstructured":"J. Branke, T. Hildebrandt, B. Scholz-Reiter, Hyper-heuristic evolution of dispatching rules: a comparison of rule representations. Evol. Comput. 23, 249\u2013277 (2015)","journal-title":"Evol. Comput."},{"key":"9529_CR35","unstructured":"R. Hunt, M. Johnston, M. Zhang, Evolving dispatching rules with greater understandability for dynamic job shop. Tech. Rep. ECSTR15-06, Victoria University of Wellington (2015)"},{"key":"9529_CR36","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.asoc.2016.07.025","volume":"48","author":"M Durasevic","year":"2016","unstructured":"M. Durasevic, D. Jakobovic, K. Knezevic, Adaptive scheduling on unrelated machines with genetic programming. Appl. Soft Comput. 48, 419\u2013430 (2016)","journal-title":"Applied Soft Computing"},{"key":"9529_CR37","doi-asserted-by":"crossref","unstructured":"L. Nie, Y. Bai, X. Wang, K. Liu, Y. Tan, Y. Shi, Z. Ji, in Discover scheduling strategies with gene expression programming for dynamic flexible job shop scheduling problem. ed. by Y. Tan, Y. Shi, Z. Ji, (Springer, 2012), Advances in Swarm Intelligence, Vol. 7332 of Lecture Notes in Computer Science, pp. 383\u2013390","DOI":"10.1007\/978-3-642-31020-1_45"},{"key":"9529_CR38","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.cie.2007.08.008","volume":"54","author":"JC Tay","year":"2008","unstructured":"J.C. Tay, N.B. Ho, Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput. Ind. Eng. 54, 453\u2013473 (2008)","journal-title":"Comput. Ind. Eng."},{"key":"9529_CR39","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1109\/TEVC.2023.3334626","volume":"28","author":"M Xu","year":"2024","unstructured":"M. Xu, Y. Mei, F. Zhang, M. Zhang, Genetic programming for dynamic flexible job shop scheduling: Evolution with single individuals and ensembles. IEEE Trans. Evol. Comput. 28, 1761 (2024)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9529_CR40","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1109\/TII.2022.3189725","volume":"19","author":"W Song","year":"2022","unstructured":"W. Song, X. Chen, Q. Li, Z. Cao, Flexible job-shop scheduling via graph neural network and deep reinforcement learning. IEEE Trans. Industr. Inf. 19, 1600\u20131610 (2022)","journal-title":"IEEE Trans. Industr. Inf."},{"key":"9529_CR41","unstructured":"K. Miyashita, D. Whitley, et al. (eds) In: Job-shop scheduling with genetic programming. GECCO 2000: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 505\u2013512 (Morgan Kaufmann, 2000)"},{"key":"9529_CR42","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1162\/EVCO_a_00121","volume":"23","author":"K Sim","year":"2015","unstructured":"K. Sim, E. Hart, B. Paechter, A lifelong learning hyper-heuristic method for bin packing. Evol. Comput. 23, 37\u201367 (2015)","journal-title":"Evol. Comput."},{"key":"9529_CR43","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1109\/TCYB.2019.2936001","volume":"51","author":"S Nguyen","year":"2021","unstructured":"S. Nguyen, M. Zhang, D. Alahakoon, K.C. Tan, People-centric evolutionary system for dynamic production scheduling. IEEE Trans. Cybern. 51, 1403\u20131416 (2021)","journal-title":"IEEE Trans. Cybern."},{"key":"9529_CR44","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1109\/TEVC.2022.3199783","volume":"27","author":"F Zhang","year":"2022","unstructured":"F. Zhang, Y. Mei, S. Nguyen, K.C. Tan, M. Zhang, Task relatedness-based multitask genetic programming for dynamic flexible job shop scheduling. IEEE Trans. Evol. Comput. 27, 1705\u20131719 (2022)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9529_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101318","volume":"80","author":"M Durasevic","year":"2023","unstructured":"M. Durasevic, F.J. Gil-Gala, D. Jakobovic, C.A. Coello Coello, Combining single objective dispatching rules into multi-objective ensembles for the dynamic unrelated machines environment. Swarm Evol. Comput. 80, 101318 (2023)","journal-title":"Swarm Evol. Comput."},{"key":"9529_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101339","volume":"81","author":"J Luo","year":"2023","unstructured":"J. Luo, M. Vanhoucke, J. Coelho, Automated design of priority rules for resource-constrained project scheduling problem using surrogate-assisted genetic programming. Swarm Evol. Comput. 81, 101339 (2023)","journal-title":"Swarm Evol. Comput."},{"key":"9529_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2024.2431182","volume":"63","author":"L Li","year":"2024","unstructured":"L. Li, H. Zhang, S. Bai, Evolve ensemble rules automatically for the block spatial scheduling under dynamic environments via surrogate-assisted cooperative evolution genetic programming. Int. J. Prod. Res. 63, 1\u201328 (2024)","journal-title":"Int. J. Prod. Res."},{"key":"9529_CR48","doi-asserted-by":"crossref","unstructured":"J. Park, Y. Mei, S. Nguyen, G. Chen, M. Zhang, T., Mitrovic, B. Xue, X. Li, (eds) Evolutionary multitask optimisation for dynamic job shop scheduling using niched genetic programming. AI 2018: advances in artificial intelligence, pp. 739\u2013751 (Springer, Cham, 2018)","DOI":"10.1007\/978-3-030-03991-2_66"},{"key":"9529_CR49","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TAI.2024.3456086","volume":"6","author":"F Zhang","year":"2024","unstructured":"F. Zhang, G. Shi, Y. Mei, M. Zhang, Multiobjective dynamic flexible job shop scheduling with biased objectives via multitask genetic programming. IEEE Trans. Artif. Intell. 6, 169\u2013183 (2024)","journal-title":"IEEE Transactions on Artificial Intelligence"},{"key":"9529_CR50","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10462-024-11059-9","volume":"58","author":"M Xu","year":"2025","unstructured":"M. Xu, Y. Mei, F. Zhang, M. Zhang, Learn to optimise for job shop scheduling: a survey with comparison between genetic programming and reinforcement learning. Artif. Intell. Rev. 58, 58 (2025)","journal-title":"Artif. Intell. Rev."},{"key":"9529_CR51","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1080\/095372800232379","volume":"11","author":"O Holthaus","year":"2000","unstructured":"O. Holthaus, C. Rajendran, Efficient jobshop dispatching rules: further developments. Prod. Plan. Control. 11, 171\u2013178 (2000)","journal-title":"Prod. Plan. Control."},{"key":"9529_CR52","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","volume":"38","author":"TCE Cheng","year":"1989","unstructured":"T.C.E. Cheng, M.C. Gupta, Survey of scheduling research involving due date determination decisions. Eur. J. Oper. Res. 38, 156\u2013166 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"9529_CR53","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<125::AID-JOS40>3.0.CO;2-C","volume":"3","author":"S Kreipl","year":"2000","unstructured":"S. Kreipl, A large step random walk for minimizing total weighted tardiness in a job shop. J. Sched. 3, 125\u2013138 (2000)","journal-title":"J. Sched."},{"key":"9529_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#","volume":"46","author":"M Pinedo","year":"1999","unstructured":"M. Pinedo, M. Singer, A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Nav. Res. Logist. 46, 1\u201317 (1999)","journal-title":"Nav. Res. Logist."},{"key":"9529_CR55","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1177\/105971239700500201","volume":"5","author":"P Nordin","year":"1997","unstructured":"P. Nordin, W. Banzhaf, An on-line method to evolve behavior and to control a miniature robot in real time with genetic programming. Adapt. Behav. 5, 107\u2013140 (1997)","journal-title":"Adapt. Behav."},{"key":"9529_CR56","doi-asserted-by":"publisher","first-page":"4255","DOI":"10.1080\/00207543.2011.611539","volume":"50","author":"V Sels","year":"2011","unstructured":"V. Sels, N. Gheysen, M. Vanhoucke, A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions. Int. J. Prod. Res. 50, 4255\u20134270 (2011)","journal-title":"Int. J. Prod. Res."},{"key":"9529_CR57","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1080\/00207540600993360","volume":"46","author":"CD Geiger","year":"2008","unstructured":"C.D. Geiger, R. Uzsoy, Learning effective dispatching rules for batch processor scheduling. Int. J. Prod. Res. 46, 1431\u20131454 (2008)","journal-title":"Int. J. Prod. Res."},{"key":"9529_CR58","doi-asserted-by":"crossref","unstructured":"J.D.C. Little, S.C. Graves, in Little\u2019s law, ed. by D. Chhajed, T.J. Lowe, (Springer, US, 2008), Building intuition: insights from basic operations management models and principles 81\u2013100","DOI":"10.1007\/978-0-387-73699-0_5"},{"key":"9529_CR59","volume-title":"Probability, Statistics, and Random Processes for Electrical Engineering","author":"A Leon-Garcia","year":"2008","unstructured":"A. Leon-Garcia, Probability, Statistics, and Random Processes for Electrical Engineering, 3rd edn. (Pearson Prentice Hall, 2008)","edition":"3"},{"key":"9529_CR60","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"J.E. Beasley, OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-025-09529-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10710-025-09529-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-025-09529-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T17:02:38Z","timestamp":1781370158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10710-025-09529-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,23]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["9529"],"URL":"https:\/\/doi.org\/10.1007\/s10710-025-09529-2","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,23]]},"assertion":[{"value":"14 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"8"}}