Neural Pathways to Program Success: Hopfield Networks for PERT Analysis

• URL: http://arxiv.org/abs/2505.05047v1
• Date: Thu, 08 May 2025 08:34:16 GMT
• Title: Neural Pathways to Program Success: Hopfield Networks for PERT Analysis
• Authors: Azgar Ali Noor Ahamed,
• Abstract summary: This paper presents a novel formulation of PERT scheduling as an energy minimization problem within a Hopfield neural network architecture.<n> Numerical simulations on synthetic project networks comprising up to 1000 tasks demonstrate the viability of this approach.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: 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.

Related papers

• Dataless Neural Networks for Resource-Constrained Project Scheduling [0.0]
  This paper presents the first dataless neural network approach for the Resource-Constrained Project Scheduling Problem (RCPSP)<n>We provide a complete mathematical framework that transforms discrete scheduling constraints into differentiable objectives suitable for gradient-based optimization.<n>We detail the mathematical formulation for both precedence and renewable resource constraints, including a memory-efficient dense time-grid representation.
  arXiv  Detail & Related papers  (2025-07-07T15:59:57Z)
• Generative QoE Modeling: A Lightweight Approach for Telecom Networks [6.473372512447993]
  This study introduces a lightweight generative modeling framework that balances computational efficiency, interpretability, and predictive accuracy.<n>By validating the use of Vector Quantization (VQ) as a preprocessing technique, continuous network features are effectively transformed into discrete categorical symbols.<n>This VQ-HMM pipeline enhances the model's capacity to capture dynamic QoE patterns while supporting probabilistic inference on new and unseen data.
  arXiv  Detail & Related papers  (2025-04-30T06:19:37Z)
• Neural ATTF: A Scalable Solution to Lifelong Multi-Agent Path Planning [0.5701273481078372]
  This paper presents a new algorithm that combines a Priority Guided Task Matching (PGTM) Module with Neural STA* (Space-Time A*), a data-driven path planning method.<n>Tests against state-of-the-art MAPD algorithms, including TPTS, CENTRAL, RMCA, LNS-PBS, and LNS-wPBS, demonstrate the superior scalability, solution quality, and computational efficiency of Neural ATTF.
  arXiv  Detail & Related papers  (2025-04-21T14:25:32Z)
• An Expectation-Maximization Algorithm-based Autoregressive Model for the Fuzzy Job Shop Scheduling Problem [12.862865254507177]
  The fuzzy job shop scheduling problem (FJSSP) emerges as an innovative extension to the job shop scheduling problem (JSSP)<n>This paper investigates the feasibility of employing neural networks to assimilate and process fuzzy information for the resolution of FJSSP.
  arXiv  Detail & Related papers  (2025-01-11T10:20:16Z)
• Task-Oriented Real-time Visual Inference for IoVT Systems: A Co-design Framework of Neural Networks and Edge Deployment [61.20689382879937]
  Task-oriented edge computing addresses this by shifting data analysis to the edge. Existing methods struggle to balance high model performance with low resource consumption. We propose a novel co-design framework to optimize neural network architecture.
  arXiv  Detail & Related papers  (2024-10-29T19:02:54Z)
• Optimization Proxies using Limited Labeled Data and Training Time -- A Semi-Supervised Bayesian Neural Network Approach [3.26805553822503]
  Constrained optimization problems arise in various engineering systems such as inventory and power grids.<n>Standard deep neural network (DNN) based machine learning proxies are ineffective in practical settings where labeled data is scarce and training times are limited.
  arXiv  Detail & Related papers  (2024-10-04T02:10:20Z)
• A Distance Similarity-based Genetic Optimization Algorithm for Satellite Ground Network Planning Considering Feeding Mode [53.71516191515285]
  The low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system. We propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks and introduces a weighted Euclidean distance method to determine the similarity between the tasks.
  arXiv  Detail & Related papers  (2024-08-29T06:57:45Z)
• Learning Logic Specifications for Policy Guidance in POMDPs: an Inductive Logic Programming Approach [57.788675205519986]
  We learn high-quality traces from POMDP executions generated by any solver. We exploit data- and time-efficient Indu Logic Programming (ILP) to generate interpretable belief-based policy specifications. We show that learneds expressed in Answer Set Programming (ASP) yield performance superior to neural networks and similar to optimal handcrafted task-specifics within lower computational time.
  arXiv  Detail & Related papers  (2024-02-29T15:36:01Z)
• Graph Neural Networks for the Offline Nanosatellite Task Scheduling Problem [6.864319769054665]
  This study investigates how to schedule nanosatellite tasks more efficiently using Graph Neural Networks (GNNs)<n>The goal is to find the optimal schedule for tasks to be carried out in orbit while taking into account Quality-of-Service (QoS) considerations.
  arXiv  Detail & Related papers  (2023-03-24T03:17:28Z)
• Sequence-Based Plan Feasibility Prediction for Efficient Task and Motion Planning [36.300564378022315]
  We present a learning-enabled Task and Motion Planning (TAMP) algorithm for solving mobile manipulation problems in environments with many articulated and movable obstacles. The core of our algorithm is PIGINet, a novel Transformer-based learning method that takes in a task plan, the goal, and the initial state, and predicts the probability of finding motion trajectories associated with the task plan.
  arXiv  Detail & Related papers  (2022-11-03T04:12:04Z)
• Offline Model-Based Optimization via Normalized Maximum Likelihood Estimation [101.22379613810881]
  We consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points. This problem setting emerges in many domains where function evaluation is a complex and expensive process. We propose a tractable approximation that allows us to scale our method to high-capacity neural network models.
  arXiv  Detail & Related papers  (2021-02-16T06:04:27Z)
• Neural Manipulation Planning on Constraint Manifolds [13.774614900994342]
  We present Constrained Motion Planning Networks (CoMPNet), the first neural planner for multimodal kinematic constraints. We show that CoMPNet solves practical motion planning tasks involving both unconstrained and constrained problems. It generalizes to new unseen locations of the objects, i.e., not seen during training, in the given environments with high success rates.
  arXiv  Detail & Related papers  (2020-08-09T18:58:10Z)
• Deep Multi-Task Learning for Cooperative NOMA: System Design and Principles [52.79089414630366]
  We develop a novel deep cooperative NOMA scheme, drawing upon the recent advances in deep learning (DL) We develop a novel hybrid-cascaded deep neural network (DNN) architecture such that the entire system can be optimized in a holistic manner.
  arXiv  Detail & Related papers  (2020-07-27T12:38:37Z)
• Decentralized MCTS via Learned Teammate Models [89.24858306636816]
  We present a trainable online decentralized planning algorithm based on decentralized Monte Carlo Tree Search. We show that deep learning and convolutional neural networks can be employed to produce accurate policy approximators.
  arXiv  Detail & Related papers  (2020-03-19T13:10:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.