用霍普菲尔德网络优化项目调度，提升复杂任务规划效率。
Neural Pathways to Program Success: Hopfield Networks for PERT Analysis
- 将项目调度转化为神经网络的能量最小化问题。
- 上千任务仿真中接近最优完工时间，约束违反极少。
- 适合需要动态调整的AI工作流与微服务系统调度。
在项目管理中，不确定性下的任务调度仍是核心挑战，准确估算任务时长和依赖关系对交付复杂多项目系统至关重要。计划评估与审查技术（PERT）提供了一种概率框架来建模任务变异性与关键路径。本文提出将PERT调度重新表述为霍普菲尔德神经网络中的能量最小化问题。通过将任务起始时间和优先级约束映射到神经计算框架，利用网络的内在优化动力学近似全局一致的调度方案。作者解决了能量函数可微性、约束编码与收敛性等关键理论问题，并扩展了霍普菲尔德模型以处理结构化优先图。在包含最多1000个任务的合成项目网络上进行数值仿真，验证了该方法的可行性，在极小约束违反下实现了接近最优的完工时间。研究结果表明，神经优化模型为现代人工智能系统（如代理型AI工作流、基于微服务的应用）在不确定性下的可扩展、自适应任务调度提供了有前景的方向。
原文摘要 · Abstract (English)
Project and task scheduling under uncertainty remains a fundamental challenge in program and project management, where accurate estimation of task durations and dependencies is critical for delivering complex, multi project systems. The Program Evaluation and Review Technique provides a probabilistic framework to model task variability and critical paths. In this paper, the author presents a novel formulation of PERT scheduling as an energy minimization problem within a Hopfield neural network architecture. By mapping task start times and precedence constraints into a neural computation framework, the networks inherent optimization dynamics is exploited to approximate globally consistent schedules. The author addresses key theoretical issues related to energy function differentiability, constraint encoding, and convergence, and extends the Hopfield model for structured precedence graphs. Numerical simulations on synthetic project networks comprising up to 1000 tasks demonstrate the viability of this approach, achieving near optimal makespans with minimal constraint violations. The findings suggest that neural optimization models offer a promising direction for scalable and adaptive project tasks scheduling under uncertainty in areas such as the agentic AI workflows, microservice based applications that the modern AI systems are being built upon.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。