arXiv AI

Sim2Schedule: A Simulator-Guided LLM Framework for Autonomous Open-Pit Mine Scheduling

arXiv:2606. 10286v1 Announce Type: new Abstract: Open-pit mine scheduling is a critical process for maximizing economic return under complex geotechnical and operational constraints.

arXiv Machine Learning
Sep 18

A Generative-AI Modeling Framework for Explainable Decision Support in Complex Geosteering Scenarios

The paper presents a real‑time, AI‑driven geosteering workflow that combines Generative Adversarial Networks for geological parameterization, ensemble methods for model updating, and dynamic programming optimization for decision support during directional drilling. The framework uses offline GAN training to generate realistic geology realizations and a Forward Neural Network to predict Logging‑While‑Drilling tool responses, enabling progressive reduction of subsurface uncertainty around the drilling bit. Tested on a low‑net‑to‑gross drilling scenario, the prototype delivers steering recommendations and automatically maps formation boundaries along the well path.

By Sergey Alyaev, Kristian Fossum, Hibat Errahmen Djecta, Jan Tveranger, Ahmed H. Elsheikh
arXiv AI
Sep 10

AgentServeSim: Serving-System Simulation and Policy Search for LLM Agent Programs

AgentServeSim is a simulation framework designed to model the execution of large language model (LLM) agent programs, capturing cross‑turn key‑value (KV) state retention, successor turn release, and scheduling decisions. Unlike existing simulators that operate on request streams, AgentServeSim treats the entire agent program as a single unit of execution, using a Program Control Block, Program Orchestrator, Retention Plane, and Dispatch Plane to emulate realistic serving dynamics. Validation against real vLLM deployments on two GPU platforms shows mean job completion time errors below 5.5%, and the simulator enables automated policy search that improves mean JCT by up to 2.8% over hand‑written policies. whyItMatters":"The simulator provides a realistic, CPU‑based tool for evaluating and optimizing LLM agent serving policies, achieving high fidelity to real deployments and enabling measurable performance gains."

By Rakibul Hasan Rajib, Mengxin Zheng, Qian Lou
arXiv AI
2d ago

OR for AI That Does OR: Routing LLMs up the Escalator inside the OSCAR Framework

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.

By Jinzhi Bu, Haixin Tang, Huanan Zhang
arXiv AI
Jun 2

FrontierOR: Benchmarking LLMs' Capacity for Efficient Algorithm Design in Large-Scale Optimization

arXiv:2605. 25246v3 Announce Type: replace Abstract: Large language models (LLMs) are increasingly used for optimization modeling and solver-code generation, yet practical operations research and optimization problems often require a harder capability: designing scalable algorithms that exploit problem structure and outperform direct formulation-and-solve baselines.

By Minwei Kong, Chonghe Jiang, Ao Qu, Wenbin Ouyang, Zhaoming Zeng, Xiaotong Guo, Zhekai Li, Junyi Li, Yi Fan, Xinshou Zheng, Xi Jing, Yikai Zhang, Zhiwei Liang, Seonghoo Kim, Runqing Yang, Zijian Zhou, Sirui Li, Han Zheng, Wangyang Ying, Ou Zheng, Chonghuan Wang, Jinglong Zhao, Hanzhang Qin, Cathy Wu, Paul Pu Liang, Jinhua Zhao, Hai Wang
arXiv AI
Aug 20

Improving Natural-Language Combinatorial-Optimization Accuracy in Resource-Constrained Language Models via Formal Abstractions

The paper introduces SDDL, a neuro‑symbolic framework that converts natural‑language combinatorial scheduling problems into compact, solver‑aligned representations, delegating low‑level modeling and search to a deterministic compiler and external solver. On a 300‑instance subset of scheduling tasks, SDDL achieves higher feasibility rates for resource‑constrained language models—up to 55.3% and 28.3%—compared to direct‑generation baselines (23.7% and 1.3%) and solver‑code baselines (21.7% and 7.0%), with a median optimality gap of 0.0% among feasible schedules.

By Shrenil Shaun Sharma, Avi Sharma
arXiv AI
Jul 7

Resource-constrained Project Scheduling with Time-of-Use Energy Tariffs and Machine States: A Logic-based Benders Decomposition Approach

arXiv:2601. 06542v2 Announce Type: replace-cross Abstract: In this paper, we investigate the Resource-Constrained Project Scheduling Problem (RCPSP) with Time-of-Use (TOU) energy tariffs and machine states, a variant of RCPSP for production scheduling, where energy price is part of the criteria and one highly energy-demanding machine can be in one of the following three states: proc, idle, or off.

By Corentin Juvigny, Anton\'in Nov\'ak, Jan Mand\'ik, Zden\v{e}k Hanz\'alek
arXiv AI
Jun 17

Blueprint First, Model Second: A Framework for Deterministic LLM Workflow

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.

By Libin Qiu, Yuhang Ye, Zhirong Gao, Xide Zou, Junfu Chen, Ziming Gui, Weizhi Huang, Xiaobo Xue, Wenkai Qiu, Kun Zhao