The paper introduces a Bayesian dynamic scheduling method for multipurpose batch processes that operates under incomplete look‑ahead information. By learning a Bayesian Network from the probability distribution of disturbances, the method updates posterior distributions online and guides rescheduling decisions. Compared with a periodic rescheduling strategy, the approach yields statistically better long‑term costs and reduced system nervousness on benchmark problems.
arXiv:2608. 14122v1 Announce Type: new Abstract: Production scheduling in complex manufacturing environments is challenging when sequence-dependent setup times, stochastic disturbances, and due-date constraints must be addressed simultaneously.
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 (planning to minimize superfluous activities under a feasibility constraint, followed by scheduling to minimize makespan) and an integrated single‑stage approach. Experiments on two real‑world and one synthetic dataset show that the integrated method achieves better makespans but struggles with scalability, whereas the decomposed method scales to larger settings.
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.
arXiv:2511.20413v2 Announce Type: replace-cross Abstract: \emph{Decision-focused learning} (DFL) trains predictive models to optimize downstream decisions rather than prediction accuracy alone. While...
arXiv:2606. 07846v1 Announce Type: cross Abstract: LLM-agent workflows chain model calls and tool invocations, and spend most of their wall-clock time waiting on upstream operations before downstream ones can start.
arXiv:2607. 02624v1 Announce Type: cross Abstract: Modern automotive software architectures comprise large sets of mixed-criticality functions executing on shared multi-core platforms with strict real-time and end-to-end timing requirements.
PriMa-Causa is a new framework for causal prescriptive maintenance that ranks maintenance actions by their estimated interventional effect. It combines a causal reasoning layer, a parametric simulator that generates interventional ground truth, and a graph-conditioned tabular causal foundation model trained once on synthetic production‑line data. The approach achieves lower prescription error than associational baselines, especially under weak overlap and sparse context, and shows further improvement when a partially disclosed causal graph is used.
arXiv:2606. 17266v1 Announce Type: new Abstract: Production planning increasingly has to treat workforce capability as a decision variable: certifications lapse when skills are not maintained, new products require skills the current workforce does not hold, and reskilling competes for the same worker hours needed for production.
The paper introduces a rolling‑horizon distributionally robust model for in‑station train rescheduling that updates predictions of resource closure durations as disruptions resolve. It jointly optimizes train routes, sequences, and timings to minimize worst‑case expected completion delay, using a logic‑based Benders decomposition algorithm guided by a graph neural network (GNN‑LBBD). Experiments on 28 five‑track station instances show GNN‑LBBD reduces mean completion delay by 16.63% compared to tabu search and 20.06% compared to variable neighborhood search, and that incorporating disruption‑resolution observations cuts delay by about 21.7%.
The paper introduces JoBS, a Bayesian optimization framework that co‑optimizes data and model configurations for large language model training without requiring full training runs at each iteration. JoBS first allocates part of the budget to train a scaling‑law‑inspired performance predictor using only a few training steps, then uses this predictor to guide subsequent BO iterations, thereby exploring many more configurations within the same budget. The authors analyze JoBS’s regret, derive optimal budget splits, and demonstrate that it outperforms both independent optimization and existing multi‑fidelity BO baselines across diverse downstream tasks.
arXiv:2606. 18438v1 Announce Type: cross Abstract: In this paper, we study a sequential workforce management problem in a contingent labor setting with uncertainty in both worker production and labor supply.
arXiv:2609.26021v1 Announce Type: new Abstract: Dynamic black-box optimization presents significant challenges for Bayesian Optimization (BO), as the objective function evolves over time, causing opt...