Scheduling all-scale multi-point manufacturing problems with a single neural model

Document Type

Article

Publication Date

1-1-2026

Abstract

This research presents a novel energy-efficient task sequencing method for manufacturing operations involving multiple processing points, such as precision drilling and contact welding. The problem is formulated as a multi-dimensional weighted variant of the Traveling Salesman Problem (TSP), and solved using a Multi-gate Mixture of Experts (MMOE) neural architecture. Unlike previous approaches that require separate models for each TSP size, our method employs a single neural network to handle TSPs of all sizes, significantly improving scalability and reducing training overhead. With an uncertainty-based loss weighting strategy, the model effectively balances multiple learning objectives. Experiments show that MMOE-9 achieves performance comparable to state-of-the-art methods with only one-third of the parameters of NAR4TSP, and its training time is similar to that of a single TSP100 model. Further, we extend the model to cover 91 TSP sizes (from 10 to 100) within the same unified framework, demonstrating strong generalization across scales.

Keywords

Graph neural network, Multi-gate mixture of experts, Multi-point manufacturing, Reinforcement learning, Traveling salesman problem

Publication Title

Applied Intelligence

ISSN

0924669X

DOI

10.1007/s10489-026-07091-7

Volume

56

Issue

2

Share

COinS