Flexible Job Shop Scheduling with Job Precedence Constraints: A Deep Reinforcement Learning Approach
The flexible job shop scheduling problem with job precedence constraints (FJSP-JPC) is highly relevant in industrial production scenarios involving assembly operations. Traditional methods, such as mathematical programming and meta-heuristics, often struggle with scalability and efficiency when solv...
Saved in:
Main Authors: | Yishi Li, Chunlong Yu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-06-01
|
Series: | Journal of Manufacturing and Materials Processing |
Subjects: | |
Online Access: | https://www.mdpi.com/2504-4494/9/7/216 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
job shop scheduling problem:literature review
by: Marrwa Abd-AlKareem Alabajee, et al.
Published: (2020-08-01) -
Beyond Kanban: POLCA-Constrained Scheduling for Job Shops
by: Antonio Grieco, et al.
Published: (2025-06-01) -
An Effective Local Search Algorithm for Flexible Job Shop Scheduling in Intelligent Manufacturing Systems
by: Junjie Zhang, et al.
Published: (2025-07-01) -
Solving Collaborative Scheduling of Production and Logistics via Deep Reinforcement Learning: Considering Limited Transportation Resources and Charging Constraints
by: Xianping Huang, et al.
Published: (2025-06-01) -
Diversity Operators-based Artificial Fish Swarm Algorithm to Solve Flexible Job Shop Scheduling Problem
by: Alaa Wagih Abdulqader, et al.
Published: (2023-10-01)