arXiv:2607. 21354v1 Announce Type: new Abstract: For years, supply chain planning at e-commerce firms has operated as a collection of isolated projects.
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:2606. 26852v1 Announce Type: new Abstract: Order fulfillment in manual picker-to-goods warehouses involves interconnected decisions such as item assignment, order batching, and picker routing.
arXiv:2508. 02721v2 Announce Type: replace-cross Abstract: While powerful, the inherent non-determinism of large language model (LLM) agents limits their application in structured operational environments where procedural fidelity and predictable execution are strict requirements.
arXiv:2607. 28488v1 Announce Type: cross Abstract: Can supply-chain AI move beyond isolated decision modules toward unified operational planning?
The paper investigates whether large language models (LLMs) can design effective algorithms for well-specified operations research (OR) problems, focusing on inventory control, queueing network control, and assortment optimization. Two usage levels are examined: (1) the model receives a single problem instance and outputs a solution, and (2) the model receives only a problem class description and returns a general algorithm mapping instance parameters to solutions. Using a single untuned prompt and a Python sandbox, the strongest tested model, gpt-5.6-sol, matches or surpasses existing methods on nearly all evaluated instances, even when the algorithm is fixed before seeing evaluation cases, and performance improves markedly across models released within eight months.
The paper introduces OSCAR, an LLM‑based framework that translates business descriptions into accurate optimization models while verifying and improving them through a simulator, coder, and reviewer. OSCAR uses a cost‑ordered escalation strategy to select among LLMs of varying price and capability, achieving 95–100% accuracy on benchmark problems with local, open‑weight models. The framework also provides competitive guarantees and token‑cost advantages over existing LLMs like Codex and Claude Code.
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.
arXiv:2609.39559v1 Announce Type: new Abstract: In this work we study the problem of MAPFC, a post-optimization step for Multi-Agent Path Finding (MAPF) plans where we are given a feasible plan produ...
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.
arXiv:2608.29397v1 Announce Type: new Abstract: Tool-use benchmarks generally evaluate whether an agent completes a workflow using appropriate tools and valid arguments. However, feasibility alone is...
arXiv:2606. 29366v1 Announce Type: cross Abstract: Balance-oriented multi-warehouse inventory allocation is a recurring decision problem in large-scale e-commerce supply chains, in which a fixed replenishment quantity is distributed across warehouses to balance post-allocation inventory coverage while accounting for demand forecasts and heterogeneous allocation constraints.
The paper evaluates strategies for increasing plan‑execution flexibility by converting sequential plans into partial‑order plans through deordering and reordering. It compares block deordering methods, which restructure causal dependencies, with MaxSAT‑based approaches that optimize within existing causal structures. The study finds that block deordering consistently outperforms MaxSAT in both effectiveness and efficiency, offering anytime solutions and higher flexibility gains per computation time.