13 articles tagged with #scheduling. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
SwarmX is a new scheduling system designed to optimize GPU-CPU cluster performance for agentic AI applications that make multiple model calls and tool executions. The system uses neural predictors to reduce tail latency by up to 61.5% and sustain 2x higher throughput than production schedulers, addressing a critical infrastructure gap as AI agents become more complex.
Justitia is a new scheduling system for task-parallel LLM agents that optimizes GPU server performance through selective resource allocation based on completion order prediction. The system uses memory-centric cost quantification and virtual-time fair queuing to achieve both efficiency and fairness in LLM serving environments.
Researchers propose MIStar, a memory-enhanced improvement search framework using heterogeneous graph neural networks for flexible job-shop scheduling problems in smart manufacturing. The approach significantly outperforms traditional heuristics and state-of-the-art deep reinforcement learning methods in optimizing production schedules.
Researchers propose SOCD, an offline reinforcement learning algorithm that learns multi-user scheduling policies from pre-collected data without requiring real-time system interactions. The method combines diffusion models with critic guidance and Lagrangian optimization to handle delay-constrained resource allocation across applications like data centers and live streaming.
Researchers developed a QUBO-based optimization framework combined with hybrid quantum algorithms to improve railway departure scheduling during peak periods. Testing shows quantum-enhanced methods reduced operational costs by 4-26% and delays by 4-24% compared to conventional approaches, though real-world validation remains pending.
Researchers propose EvalStop, a scheduling primitive for cloud RLHF platforms that detects and terminates jobs suffering from reward overoptimization by monitoring eval-score declines. The system achieves 98% precision in identifying reward hacking while improving job completion time by 9% and reducing wasted compute by 22% compared to existing schedulers.
Researchers propose a policy-neutral execution layer that bridges the gap between reinforcement learning scheduling policies and real-world industrial deployment by standardizing decision snapshots, defining explicit action admissibility, and attributing execution failures to specific causes rather than treating them as undifferentiated errors.
Researchers introduce RACE-Sched, an asynchronous AI framework that combines real-time symbolic heuristics with LLM-powered reasoning to solve dynamic job shop scheduling problems in industrial systems. The approach decouples fast reactive execution from slower deliberative optimization, enabling superior performance over deep reinforcement learning baselines while maintaining interpretability and millisecond-level response times.
Researchers developed a deep reinforcement learning approach using heterogeneous graph networks to solve Flexible Job Shop Scheduling Problems with limited buffers and material kitting constraints. The method outperforms traditional heuristics by improving buffer utilization and decision quality through better modeling of complex dependencies in production scheduling.
Researchers introduce ConEQsA, an AI framework that enables embodied agents to handle multiple questions simultaneously in 3D environments with urgency-aware scheduling. The system uses shared memory to reduce redundant exploration and includes a new benchmark with 200 questions across 40 indoor scenes.
Researchers developed a quantum annealing approach to solve staff allocation problems across multiple educational sites in Italy. The study demonstrates quantum optimization methods can efficiently handle complex resource allocation tasks in real-world educational scheduling scenarios.
Read AI has launched Ada, an email-based digital twin service that can respond to scheduling requests and answer questions by accessing company knowledge bases and web information. This represents another step in AI automation for business communication and productivity tasks.
This appears to be a research article focused on algorithmic optimization for scheduling systems with time-varying capacity constraints. The work addresses theoretical approaches to maximizing throughput in dynamic environments where system capacity changes over time.
