job-shop-scheduling

Tag

Cards List
#job-shop-scheduling

Lifelong Learning of Scheduling Rules with Surrogate-assisted Genetic Programming for Dynamic Flexible Job Shop Scheduling

arXiv cs.AI ↗ · 2026-11-02 Cached

The paper proposes a surrogate-assisted genetic programming framework for lifelong learning of scheduling rules in dynamic flexible job shop scheduling, using an adaptive two-stage training strategy and task-similarity-based weighting to mitigate catastrophic forgetting while adapting to new tasks.

0 favorites 0 likes
#job-shop-scheduling

BOLT: Multi-Bottleneck Bound-Guided Learning for Flexible Job-Shop Scheduling with Time Lags and Resource-Coupled Transport

arXiv cs.LG ↗ · 2026-10-19 Cached

BOLT 提出多瓶颈界引导学习方法,用于带时间滞后与资源耦合运输的柔性作业车间调度,可在毫秒级给出机器与运输车分配并提供最优性下界保证。

0 favorites 0 likes
#job-shop-scheduling

PLAN: Parallel Liquid-Inspired Approximation Network for Efficient Representation Learning in Flexible Job Shop Scheduling

arXiv cs.LG ↗ · 2026-08-05 Cached

This paper proposes PLAN, a lightweight parallel liquid-inspired approximation network for efficient representation learning in flexible job shop scheduling, achieving better makespan and lower inference latency with fewer parameters than state-of-the-art baselines.

0 favorites 0 likes
#job-shop-scheduling

Harmonizing Real-Time Constraints and Long-Horizon Reasoning: An Asynchronous Agentic Framework for Dynamic Scheduling

arXiv cs.AI ↗ · 2026-05-29 Cached

This paper introduces RACE-Sched, an asynchronous agentic framework that decouples real-time reactive scheduling from deliberative LLM-based reasoning to handle dynamic job shop scheduling problems, achieving superior performance over DRL and other baselines.

0 favorites 0 likes
#job-shop-scheduling

Bridging the Sim-to-Real Gap in Reinforcement Learning-Based Industrial Dispatching through Execution Semantics

arXiv cs.AI ↗ · 2026-05-29 Cached

This paper proposes a policy-neutral execution and measurement layer to bridge the sim-to-real gap in reinforcement learning-based industrial dispatching, enabling structured attribution of execution errors and improving reliability and interpretability.

0 favorites 0 likes
#job-shop-scheduling

Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling

arXiv cs.AI ↗ · 2026-05-26 Cached

This paper proposes a gated hyper-heuristic for job shop scheduling that uses regret-normalized rollout labels and contextual KNN uncertainty estimates to reduce label generation costs and avoid switching away from strong default rules unless the predicted improvement is credible. Experiments show the gated selector achieves low mean relative percentage deviation while significantly reducing computational cost.

0 favorites 0 likes
← Back to home

Submit Feedback