New hyper-heuristics reduce job shop scheduling costs

Researchers have developed a new method for job shop scheduling that uses learning-assisted hyper-heuristics to select among dispatching rules. This approach aims to reduce the computational cost of generating labels, which is typically the most expensive part of the process. The system incorporates a gate that only switches from a default rule when the predicted gain is credible, using regret-normalized rollout labels and uncertainty estimates. Experiments on synthetic instances showed this method achieved significantly lower mean RPD compared to other learned selectors and reduced the RPD of random hyper-heuristics by over an order of magnitude. AI

影响 Introduces a novel algorithmic approach for optimizing complex scheduling tasks, potentially improving efficiency in manufacturing and logistics.

排序理由 The cluster contains an academic paper detailing a new algorithm for a specific problem. [lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.AI 阅读 →

• Job Shop Scheduling Problem

• 论文
• 其他

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →