PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 9, 20261 citationsOpen Access

A Hybrid Particle Swarm Optimization Approach for Flexible Job Shop Scheduling Problem with Transportation and Setup Times

View Full Paper
JCJunjun ChenZhejiang Sci-Tech UniversityTSTing ShuZhejiang Sci-Tech UniversityXYXuesong YinHangzhou Dianzi University

Key Points

  • The research aims to improve scheduling efficiency in flexible job shop environments with additional constraints.
  • Propose a hybrid optimization approach combining discrete particle swarm optimization (DPSO) with a multi-agent system (MAS) for scheduling.
  • Use DPSO for global optimization of operation sequences.
  • Implement a Heterogeneous Graph Neural Network (HGNN) with multi-head attention for enhanced feature extraction.
  • Evaluate the framework on 30 benchmark instances.
  • Achieved a 5.7% reduction in average makespan.
  • Reduced total setup time by 8.9%.
  • Decreased total transportation time by 4.8% compared to traditional methods.

Abstract

Flexible Job Shop Scheduling Problems with setup and transportation times (FJSP-TS) involve assigning operations to machines and sequencing them under additional time constraints, making the problem highly complex and common in modern manufacturing systems. Discrete Particle Swarm Optimization (DPSO) is one of the mainstream meta-heuristic methods for solving such scheduling problems, and this paper proposes a hybrid optimization approach based on DPSO to enhance solution quality. To reduce the complexity of meta-heuristic search and improve solution accuracy, a decoupled framework is introduced: DPSO is employed to optimize the operation sequence globally, while a Multi-Agent System (MAS) handles machine sequence. Furthermore, to enhance the state representation and decision-making capability of Machine Agents, a Heterogeneous Graph Neural Network (HGNN) integrated with Multi-head Attention is utilized to efficiently extract comprehensive features from the scheduling environment. Experimental results on 30 benchmark instances demonstrate that the proposed method achieves notable performance improvements in key scheduling metrics. Our method reduces the average makespan by 5.7%, total setup time by 8.9%, and total transportation time by 4.8% compared to representative optimization approaches.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Chen et al. (2026) studied this question.

synapsesocial.com/papers/698979d9f0ec2af6756e7d3fhttps://doi.org/10.3390/axioms15020125
Ask AI
Helpful
Bookmark
Share
View Full Paper