The paper addresses the challenge of scheduling business process activities when the exact sequence of required tasks is uncertain due to data-driven decisions made during execution. It proposes framing the problem as a chance-constrained optimization and introduces two formulations: a decomposed two-stage approach that first minimizes expected superfluous activities under a feasibility constraint and then schedules to minimize makespan, and an integrated approach that combines planning and scheduling into a single model. Experiments on two real-world and one synthetic dataset show that the integrated approach achieves better makespans but struggles with scalability, whereas the decomposed approach scales to larger settings.
By Michel Kunkler, Stefanie Rinderle-Ma
arXiv:2607. 16738v1 Announce Type: new Abstract: AI-Augmented Business Process Management Systems (ABPMS) enhance traditional BPMS by leveraging advanced AI techniques to define, execute, and monitor complex process structures.
By Paul Wittlinger, Giacomo Acitelli, Anti Alman, Fabrizio Maria Maggi, Andrea Marrella
arXiv:2607. 21354v1 Announce Type: new Abstract: For years, supply chain planning at e-commerce firms has operated as a collection of isolated projects.
By Jiayin He, Yutong Pan, Sen Yang, Ningxuan Kang, Yongzhi Qi, Jianshen Zhang, Wei Qi, Zuo-Jun Max Shen
For years, supply chain planning at e-commerce firms has operated as a collection of isolated projects. Each planning task from static network planning to dynamic warehouse assortment planning requires analysts to spend weeks building models from scratch, calibrating and persuading executives to act on outputs they cannot verify.
arXiv:2607. 04056v1 Announce Type: cross Abstract: Modern supply chains span diverse operational environments, ranging from e-commerce distribution networks to customized production-to-order manufacturing lines.
By Gal Neria, Michal Tzur, Marlin W. Ulmer
iScheduler is a reinforcement‑learning‑driven framework that tackles large‑scale Resource Investment Problems (RIP) by modeling them as a Markov decision process over decomposed subproblems and building schedules through sequential process selection. The approach speeds up optimization and allows efficient reconfiguration by reusing unchanged process schedules and only rescheduling affected processes. Using the new L‑RIPLIB benchmark, iScheduler achieves competitive resource costs while cutting time to feasibility by up to 43× compared to leading solver‑backed baselines.
By Yi-Xiang Hu, Yuke Wang, Feng Wu, Zirui Huang, Shuli Zeng, Xiang-Yang Li