{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T23:52:07Z","timestamp":1781653927178,"version":"3.54.5"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T00:00:00Z","timestamp":1777420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T00:00:00Z","timestamp":1777420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007105","name":"Universit\u00e4t Mannheim","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007105","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Process Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Business Process Simulation (BPS) plays a central role in analyzing and improving organizational processes by estimating the effects of potential changes. A key element of any BPS model is the case-arrival component, which determines when new cases enter the process. While accurate arrival time modeling is essential for producing reliable simulations, most existing approaches rely on static inter-arrival time distributions that overlook the temporal dynamics inherent in organizational environments, resulting in reduced accuracy and misleading insights. To address this, we propose\n                    <jats:italic>Auto Time Kernel Density Estimation<\/jats:italic>\n                    (AT-KDE), a scalable arrival time modeling approach that captures global trends, weekday effects, and intraday shifts. Across 20 diverse processes, our experiments show that AT-KDE produces more accurate and robust arrival times than existing case-arrival modeling approaches, while maintaining practical execution times. Moreover, we assess how different arrival modeling approaches affect overall simulation quality. Noting that existing BPS evaluation metrics may not explicitly account for process dynamics, we additionally showcase a novel utility-based evaluation framework, which we then use in our experiments.\n                  <\/jats:p>","DOI":"10.1007\/s44311-026-00041-z","type":"journal-article","created":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:20:52Z","timestamp":1777494052000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Arrival times in dynamic environments: modeling, evaluation, and benchmarking for business process simulation"],"prefix":"10.1007","volume":"3","author":[{"given":"Lukas","family":"Kirchdorfer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Konrad","family":"\u00d6zdemir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Han van der","family":"Aa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heiner","family":"Stuckenschmidt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,29]]},"reference":[{"key":"41_CR1","unstructured":"Ansari AF, Stella L, Turkmen C et al (2024) Chronos: learning the language of time series. TMLR"},{"key":"41_CR2","unstructured":"Bukhsh ZA, Saeed A, Dijkman RM (2021). Processtransformer: predictive business process monitoring with transformer network. arXiv preprint:2104.00721"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.dss.2020.113284","volume":"134","author":"M Camargo","year":"2020","unstructured":"Camargo M, Dumas M, Gonz\u00e1lez-Rojas O (2020) Automated discovery of business process simulation models from event logs. Decis Support Syst 134:134. https:\/\/doi.org\/10.1016\/j.dss.2020.113284","journal-title":"Decis Support Syst"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Camargo M, Dumas M, Rojas OG (2019) Learning accurate LSTM models of business processes. In: BPM. Springer","DOI":"10.1007\/978-3-030-26619-6_19"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Camargo M, Dumas M, Rojas OG (2022) Learning accurate business process simulation models from event logs via automated process discovery and deep learning. In: CAiSE. Springer","DOI":"10.1007\/978-3-031-07472-1_4"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Chapela-Campa D, Benchekroun I, Baron O, Dumas M, Krass D, Senderovich A (2023) Can I trust my simulation model? measuring the quality of business process simulation models. In: BPM. Springer","DOI":"10.1007\/978-3-031-41620-0_2"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C (2016) Xgboost: a scalable tree boosting system. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201916, Association for Computing Machinery, New York, NY, USA, 785\u2013794","DOI":"10.1145\/2939672.2939785"},{"issue":"3","key":"41_CR8","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1287\/stsy.2018.0014","volume":"8","author":"A Daw","year":"2018","unstructured":"Daw A, Pender J (2018) Queues driven by hawkes processes. Stochastic Syst 8(3):192\u2013229. https:\/\/doi.org\/10.1287\/stsy.2018.0014","journal-title":"Stochastic Syst"},{"key":"41_CR9","unstructured":"Dumas M (2021) Constructing digital twins for accurate and reliable what-if business process analysis. In BPM Workshops, vol 2938. pp 23\u201327. CEUR-WS.org"},{"key":"41_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33143-5","volume-title":"Fundamentals of business process management","author":"M Dumas","year":"2013","unstructured":"Dumas M, Rosa ML, Mendling J, Reijers HA (2013) Fundamentals of business process management. Springer"},{"key":"41_CR11","unstructured":"Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD. AAAI Press"},{"key":"41_CR12","doi-asserted-by":"publisher","DOI":"10.1515\/9780691218632","volume-title":"Time series analysis","author":"JD Hamilton","year":"1994","unstructured":"Hamilton JD (1994) Time series analysis. Princeton University Press"},{"issue":"8","key":"41_CR13","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"SLL Hochreiter","year":"1997","unstructured":"Hochreiter SLL, Schmidhuber J (1997 November) Long short-term memory. Neural Computation 9(8):1735\u20131780. https:\/\/doi.org\/10.1162\/neco.1997.9.8.1735","journal-title":"Neural Computation"},{"issue":"2","key":"41_CR14","first-page":"65","volume":"6","author":"S Holm","year":"1979","unstructured":"Holm S (1979) A simple sequentially rejective multiple test procedure. Scand J Stat 6(2):65\u201370","journal-title":"Scand J Stat"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Kirchdorfer L, Bl\u00fcmel R, Kampik T, van der Aa H, Stuckenschmidt H (2024) Agentsimulator: an agent-based approach for data-driven business process simulation. In ICPM, IEEE, pp. 97\u2013104","DOI":"10.1109\/ICPM63005.2024.10680660"},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Kirchdorfer L, \u00d6zdemir K, Kusenic S, H, Stuckenschmidt H (2025, May). Codebase: a divide-and-conquer approach for modeling arrival times in business process simulation","DOI":"10.1007\/978-3-032-02867-9_20"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Kirchdorfer L, \u00d6zdemir K, Kusenic S, van der Aa H, Stuckenschmidt H (2025) A divide-and-conquer approach for modeling arrival times in business process simulation. BPM, Volume 16044 Lect Notes Comput Sci 325\u2013342","DOI":"10.1007\/978-3-032-02867-9_20"},{"issue":"8","key":"41_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.3390\/fi15080255","volume":"15","author":"VI Kontopoulou","year":"2023","unstructured":"Kontopoulou VI, Panagopoulos AD, Kakkos I, Matsopoulos GK (2023) A review of arima vs. machine learning approaches for time series forecasting in data driven networks. Future Internet 15(8):255. https:\/\/doi.org\/10.3390\/fi15080255","journal-title":"Future Internet"},{"key":"41_CR19","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.procir.2021.03.088","volume":"99","author":"B Lindemann","year":"2021","unstructured":"Lindemann B, M\u00fcller T, Vietz H, Jazdi N, Weyrich M (2021) A survey on long short-term memory networks for time series prediction. Procedia Cirp 99:650\u2013655. https:\/\/doi.org\/10.1016\/j.procir.2021.03.088","journal-title":"Procedia Cirp"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Pintado O, Dumas M (2022) Business process simulation with differentiated resources: does it make a difference? In: BPM. Springer","DOI":"10.1007\/978-3-031-16103-2_24"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Martin N, Depaire B, Caris A (2015) Using event logs to model interarrival times in business process simulation. In: BPM workshops. Springer, pp 255\u2013267","DOI":"10.1007\/978-3-319-42887-1_21"},{"key":"41_CR22","doi-asserted-by":"crossref","unstructured":"Meneghello F, Francescomarino CD, Ghidini C (2023) Runtime integration of machine learning and simulation for business processes. In ICPM, IEEE","DOI":"10.1109\/ICPM60904.2023.10271993"},{"key":"41_CR23","doi-asserted-by":"crossref","unstructured":"\u00d6zdemir K, Kirchdorfer L, Elyasi KA, Aa HVD, Stuckenschmidt H (2025) Rethinking business process simulation: a utility-based evaluation framework. In: BPM. Springer, pp 128\u2013144","DOI":"10.1007\/978-3-032-02929-4_8"},{"key":"41_CR24","doi-asserted-by":"crossref","unstructured":"Parzen E (1962) On Estimation of a probability density function and mode. In: The annals of mathematical statistics 33(3). , pp 1065\u20131076","DOI":"10.1214\/aoms\/1177704472"},{"issue":"1","key":"41_CR25","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1186\/s12911-024-02788-6","volume":"24","author":"BM Porto","year":"2024","unstructured":"Porto BM, Fogliatto FS (2024) Enhanced forecasting of emergency department patient arrivals using feature engineering approach and machine learning. BMC Med Inf Decis Mak 24(1):377. https:\/\/doi.org\/10.1186\/s12911-024-02788-6","journal-title":"BMC Med Inf Decis Mak"},{"key":"41_CR26","doi-asserted-by":"crossref","unstructured":"Rey D, Neuh\u00e4user M (2011. Wilcoxon-Signed-Rank Test, pp. Springer, Berlin, Heidelberg Berlin Heidelberg, pp 1658\u20131659","DOI":"10.1007\/978-3-642-04898-2_616"},{"issue":"3","key":"41_CR27","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.is.2008.09.002","volume":"34","author":"A Rozinat","year":"2009","unstructured":"Rozinat A, Mans RS, Song M, van der Aalst WMP (2009) Discovering simulation models. Inf Syst 34(3):305\u2013327. https:\/\/doi.org\/10.1016\/j.is.2008.09.002","journal-title":"Inf Syst"},{"key":"41_CR28","volume-title":"Density Estimation for statistics and data analysis","author":"BW Silverman","year":"1986","unstructured":"Silverman BW (1986) Density Estimation for statistics and data analysis. Chapman & Hall, London"},{"issue":"2","key":"41_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1080\/00401706.1981.10486261","volume":"23","author":"JH Skillings","year":"1981","unstructured":"Skillings JH, Mack GA (1981) On the use of a friedman-type statistic in balanced and unbalanced block designs. Technometrics 23(2):171\u2013177. https:\/\/doi.org\/10.1080\/00401706.1981.10486261","journal-title":"Technometrics"},{"issue":"1","key":"41_CR30","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/00031305.2017.1380080","volume":"72","author":"SJ Taylor","year":"2018","unstructured":"Taylor SJ, Letham B (2018) Forecasting at scale. Am Sci 72(1):37\u201345. https:\/\/doi.org\/10.1080\/00031305.2017.1380080","journal-title":"Am Sci"},{"key":"41_CR31","first-page":"337","volume-title":"Handbook on business process management 1, introduction, methods, and information Systems, 2nd ed","author":"WMP van der Aalst","year":"2015","unstructured":"van der Aalst WMP (2015) Business process simulation survival guide. In: Rosemann M, International Handbooks on Information Systems, ed vom Brocke, J. and Handbook on business process management 1, introduction, methods, and information Systems, 2nd ed. Springer, pp 337\u2013370"},{"key":"41_CR32","volume-title":"Optimal transport: old and New. Grundlehren der mathematischen Wissenschaften","author":"C Villani","year":"2008","unstructured":"Villani C (2008) Optimal transport: old and New. Grundlehren der mathematischen Wissenschaften. Springer, Berlin Heidelberg"},{"issue":"301","key":"41_CR33","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward Jr","year":"1963","unstructured":"Ward Jr JH (1963) Hierarchical grouping to optimize an objective function. J Am Stat Assoc 58(301):236\u2013244. https:\/\/doi.org\/10.1080\/01621459.1963.10500845","journal-title":"J Am Stat Assoc"}],"container-title":["Process Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44311-026-00041-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44311-026-00041-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44311-026-00041-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T22:56:35Z","timestamp":1781650595000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44311-026-00041-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,29]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["41"],"URL":"https:\/\/doi.org\/10.1007\/s44311-026-00041-z","relation":{},"ISSN":["2948-2178"],"issn-type":[{"value":"2948-2178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,29]]},"assertion":[{"value":"27 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"9"}}