{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T16:18:07Z","timestamp":1770049087259,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032151391","type":"print"},{"value":"9783032151407","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-3-032-15140-7_10","type":"book-chapter","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T06:42:47Z","timestamp":1770014567000},"page":"173-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning to\u00a0Allocate: Dynamic Heuristic Selection for\u00a0Business Processes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0783-3772","authenticated-orcid":false,"given":"Jeroen","family":"Middelhuis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3037-8998","authenticated-orcid":false,"given":"Zaharah","family":"Bukhsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4493-6367","authenticated-orcid":false,"given":"Ivo","family":"Adan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4083-0036","authenticated-orcid":false,"given":"Remco","family":"Dijkman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,3]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: a next-generation hyperparameter optimization framework. In: KDD (2019). https:\/\/doi.org\/10.1145\/3292500.3330701","DOI":"10.1145\/3292500.3330701"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Arias, M., Rojas, E., Munoz-Gama, J., Sep\u00falveda, M.: A framework for recommending resource allocation based on process mining. In: BPM Workshops (2016). https:\/\/doi.org\/10.1007\/978-3-319-42887-1_37","DOI":"10.1007\/978-3-319-42887-1_37"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Bianco, R.L., van Jaarsveld, W., Middelhuis, J., Begnardi, L., Dijkman, R.: Automated decision-making for dynamic task assignment at scale (2025). https:\/\/doi.org\/10.48550\/arXiv.2504.19933","DOI":"10.48550\/arXiv.2504.19933"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"van Dongen, B.: BPI challenge 2012 (2012). https:\/\/doi.org\/10.4121\/uuid:3926db30-f712-4394-aebc-75976070e91f","DOI":"10.4121\/uuid:3926db30-f712-4394-aebc-75976070e91f"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"van Dongen, B.: BPI challenge 2017 (2017). https:\/\/doi.org\/10.4121\/uuid:5f3067df-f10b-45da-b98b-86ae4c7a310b","DOI":"10.4121\/uuid:5f3067df-f10b-45da-b98b-86ae4c7a310b"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Dulac-Arnold, G., et al.: Deep reinforcement learning in large discrete action spaces (2015). https:\/\/doi.org\/10.48550\/arXiv.1512.07679","DOI":"10.48550\/arXiv.1512.07679"},{"key":"10_CR7","unstructured":"Hopp, W.J., Spearman, M.L.: Factory physics (2011)"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Hu, C., Wang, Z., Liu, J., Wen, J., Mao, B., Yao, X.: Constrained reinforcement learning for dynamic material handling. In: IJCNN. https:\/\/doi.org\/10.1109\/IJCNN54540.2023.10191999","DOI":"10.1109\/IJCNN54540.2023.10191999"},{"key":"10_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2010.09.002","author":"Z Huang","year":"2011","unstructured":"Huang, Z., van der Aalst, W.M., Lu, X., Duan, H.: Reinforcement learning based resource allocation in business process management. DKE (2011). https:\/\/doi.org\/10.1016\/j.datak.2010.09.002","journal-title":"DKE"},{"key":"10_CR10","doi-asserted-by":"publisher","DOI":"10.1057\/jos.2015.8","author":"\u0160 Kucha\u0159","year":"2016","unstructured":"Kucha\u0159, \u0160, Vondr\u00e1k, I.: Automatic allocation of resources in software process simulations using their capability and productivity. J. Simul. (2016). https:\/\/doi.org\/10.1057\/jos.2015.8","journal-title":"J. Simul."},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Latip, R., Idris, Z.: Highest response ratio next (hrrn) vs first come first served (fcfs) scheduling algorithm in grid environment. In: ICSECS (2011). https:\/\/doi.org\/10.1007\/978-3-642-22191-0_60","DOI":"10.1007\/978-3-642-22191-0_60"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Lo\u00a0Bianco, R., Dijkman, R., Nuijten, W., van Jaarsveld, W.: Action-evolution petri nets: a framework for modeling and solving dynamic task assignment problems. In: BPM (2023). https:\/\/doi.org\/10.1007\/978-3-031-41620-0_13","DOI":"10.1007\/978-3-031-41620-0_13"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Lo\u00a0Bianco, R., Dijkman, R., Nuijten, W., van Jaarsveld, W.: A universal approach to feature representation in dynamic task assignment problems. In: BPM (2024). https:\/\/doi.org\/10.1007\/978-3-031-70418-5_12","DOI":"10.1007\/978-3-031-70418-5_12"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Meneghello, F., Di\u00a0Francescomarino, C., Ghidini, C.: Runtime integration of machine learning and simulation for business processes. In: ICPM (2023). https:\/\/doi.org\/10.1109\/ICPM60904.2023.10271993","DOI":"10.1109\/ICPM60904.2023.10271993"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Meneghello, F., et al.: Optimizing resource allocation policies in real-world processes using hybrid process simulation and deep reinforcement learning. In: BPM (2024). https:\/\/doi.org\/10.1007\/978-3-031-70396-6_10","DOI":"10.1007\/978-3-031-70396-6_10"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Middelhuis, J., Bukhsh, Z., Adan, I., Dijkman, R.: A rollout-based algorithm and reward function for efficient resource allocation in business processes (2025). https:\/\/doi.org\/10.48550\/arXiv.2504.11250","DOI":"10.48550\/arXiv.2504.11250"},{"key":"10_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2024.102492","author":"J Middelhuis","year":"2025","unstructured":"Middelhuis, J., Lo Bianco, R., Sherzer, E., Bukhsh, Z., Adan, I., Dijkman, R.: Learning policies for resource allocation in business processes. Inf. Syst. (2025). https:\/\/doi.org\/10.1016\/j.is.2024.102492","journal-title":"Inf. Syst."},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Mnih, V., et al.: Playing atari with deep reinforcement learning (2013). https:\/\/doi.org\/10.48550\/arXiv.1312.5602","DOI":"10.48550\/arXiv.1312.5602"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Park, G., Song, M.: Prediction-based resource allocation using lstm and minimum cost and maximum flow algorithm. In: ICPM (2019). https:\/\/doi.org\/10.1109\/ICPM.2019.00027","DOI":"10.1109\/ICPM.2019.00027"},{"key":"10_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2025.102541","author":"L Pufahl","year":"2025","unstructured":"Pufahl, L., Stiehle, F., Ihde, S., Weske, M., Weber, I.: Resource allocation in business process executions\u2013a systematic literature study. Inf. Syst. (2025). https:\/\/doi.org\/10.1016\/j.is.2025.102541","journal-title":"Inf. Syst."},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms (2017). https:\/\/doi.org\/10.48550\/arXiv.1707.06347","DOI":"10.48550\/arXiv.1707.06347"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Schumann, F., Rinderle-Ma, S.: Optimizing resource-driven process configuration through genetic algorithms. In: BPM (2024). https:\/\/doi.org\/10.1007\/978-3-031-70396-6_1","DOI":"10.1007\/978-3-031-70396-6_1"},{"key":"10_CR23","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2011.611539","author":"V Sels","year":"2012","unstructured":"Sels, V., Gheysen, N., Vanhoucke, M.: A comparison of priority rules for the job shop scheduling problem under different flow time-and tardiness-related objective functions. Int. J. Prod. Res. (2012). https:\/\/doi.org\/10.1080\/00207543.2011.611539","journal-title":"Int. J. Prod. Res."},{"key":"10_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2018.05.004","author":"YW Si","year":"2018","unstructured":"Si, Y.W., Chan, V.I., Dumas, M., Zhang, D.: A petri nets based generic genetic algorithm framework for resource optimization in business processes. Simul. Model. Pract. Theory (2018). https:\/\/doi.org\/10.1016\/j.simpat.2018.05.004","journal-title":"Simul. Model. Pract. Theory"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Sutton, R.S., Barto, A.G., et\u00a0al.: Reinforcement Learning: An Introduction (1998)","DOI":"10.1109\/TNN.1998.712192"},{"key":"10_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. (1992). https:\/\/doi.org\/10.1007\/BF00992696","journal-title":"Mach. Learn."},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"\u017bbikowski, K., Ostapowicz, M., Gawrysiak, P.: Deep reinforcement learning for resource allocation in business processes. In: Process Mining Workshops (2023). https:\/\/doi.org\/10.1007\/978-3-031-27815-0_13","DOI":"10.1007\/978-3-031-27815-0_13"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Zeng, Y., Liao, Z., Dai, Y., Wang, R., Li, X., Yuan, B.: Hybrid intelligence for dynamic job-shop scheduling with deep reinforcement learning and attention mechanism (2022). https:\/\/doi.org\/10.48550\/arXiv.2201.00548","DOI":"10.48550\/arXiv.2201.00548"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Zhao, W., Yang, L., Liu, H., Wu, R.: The optimization of resource allocation based on process mining. In: ICIC (2015). https:\/\/doi.org\/10.1007\/978-3-319-22053-6_38","DOI":"10.1007\/978-3-319-22053-6_38"}],"container-title":["Lecture Notes in Computer Science","Enterprise Design, Operations, and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15140-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T06:42:50Z","timestamp":1770014570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15140-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032151391","9783032151407"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15140-7_10","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":"3 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that there are no conflicts of interest related to the publication of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of interest"}},{"value":"EDOC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Enterprise Design, Operations, and Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"9 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"edoc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cbi-edoc-2025.inesc-id.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}