{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T07:00:58Z","timestamp":1771743658479,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":13,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819570805","type":"print"},{"value":"9789819570812","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7081-2_49","type":"book-chapter","created":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T06:45:38Z","timestamp":1771742738000},"page":"696-704","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Heuristic Learning via\u00a0Genetic Programming for\u00a0Dynamic Flexible Job Shop Scheduling with\u00a0Heterogeneous Batch Arrivals"],"prefix":"10.1007","author":[{"given":"Luyao","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangfang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Mei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruibin","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,23]]},"reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Survey on genetic programming and machine learning techniques for heuristic design in job shop scheduling. IEEE Trans. Evolutionary Comput. 28(1), 147\u2013167 (2023)","DOI":"10.1109\/TEVC.2023.3255246"},{"issue":"1","key":"49_CR2","first-page":"1","volume":"298","author":"L M\u00f6nch","year":"2022","unstructured":"M\u00f6nch, L., Fowler, J.W.: A survey of scheduling with parallel batch (p-batch) processing. European J. Oper. Res. 298(1), 1\u201324 (2022)","journal-title":"European J. Oper. Res."},{"issue":"4","key":"49_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.3390\/machines12040281","volume":"12","author":"Y Wang","year":"2024","unstructured":"Wang, Y., Shi, J., Wang, W., Li, C.: Re-entrant green scheduling problem of bearing production shops considering job reworking. Machines 12(4), 281 (2024)","journal-title":"Machines"},{"key":"49_CR4","unstructured":"John,\u00a0R.K.: Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems, vol.\u00a034. Stanford University, Department of Computer Science Stanford (1990)"},{"key":"49_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2021.102567","volume":"108","author":"X Jun","year":"2022","unstructured":"Jun, X., Wang, J.-Q., Liu, Z.: Parallel batch scheduling: impact of increasing machine capacity. Omega 108, 102567 (2022)","journal-title":"Omega"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Wahl, S., Gahm, C., Tuma, A.: Serial-and hierarchical-batch scheduling: a systematic review and future research directions. Int. J. Prod. Res., 1\u201331 (2024)","DOI":"10.1080\/00207543.2024.2432473"},{"issue":"1","key":"49_CR7","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.ijpe.2012.04.015","volume":"141","author":"J Xiong","year":"2013","unstructured":"Xiong, J., Xing, L., Chen, Y.: Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns. Int. J. Produ. Econ. 141(1), 112\u2013126 (2013)","journal-title":"Int. J. Produ. Econ."},{"key":"49_CR8","doi-asserted-by":"publisher","unstructured":"Yang, Y., Chen, G., Ma, H., Hartmann, S., Zhang, M.: Dual-tree genetic programming with adaptive mutation for dynamic workflow scheduling in cloud computing. IEEE Trans. Evolutionary Comput., 1\u20131 (2024). https:\/\/doi.org\/10.1109\/TEVC.2024.3392968","DOI":"10.1109\/TEVC.2024.3392968"},{"issue":"2","key":"49_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0360-8352(84)90001-9","volume":"8","author":"AS Kiran","year":"1984","unstructured":"Kiran, A.S., Smith, M.L.: Simulation studies in job shop sheduling\u2013i a survey. Comput. Industr. Eng. 8(2), 87\u201393 (1984)","journal-title":"Comput. Industr. Eng."},{"key":"49_CR10","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2025.3562161","author":"L Zhu","year":"2025","unstructured":"Zhu, L., Zhang, F., Zhu, X., Chen, K., Zhang, M.: Phenotype and genotype based sample aware surrogate-assisted genetic programming in dynamic flexible job shop scheduling. IEEE Trans. Artif. Intell. (2025). https:\/\/doi.org\/10.1109\/TAI.2025.3562161","journal-title":"IEEE Trans. Artif. Intell."},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Learning strategies on scheduling heuristics of genetic programming in dynamic flexible job shop scheduling. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2022)","DOI":"10.1109\/CEC55065.2022.9870243"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Zhu, L., Zhang, F., Feng, M., Chen, K., Zhu, X., Zhang, M.: Sample-aware surrogate-assisted genetic programming for scheduling heuristics learning in dynamic flexible job shop scheduling. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 384\u2013392 (2023)","DOI":"10.1145\/3583131.3590440"},{"issue":"3","key":"49_CR13","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s12293-024-00424-4","volume":"16","author":"C Jin","year":"2024","unstructured":"Jin, C., Bai, R., Zhou, Y., Chen, X., Tan, L.: Enhancing online yard crane scheduling through a two-stage rollout memetic genetic programming. Memetic Comput. 16(3), 467\u2013489 (2024)","journal-title":"Memetic Comput."}],"container-title":["Lecture Notes in Computer Science","PRICAI 2025: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7081-2_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T06:45:41Z","timestamp":1771742741000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7081-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819570805","9789819570812"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7081-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"23 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wellington","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}