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) -
Computing Idle Times in Fuzzy Flexible Job Shop Scheduling
by: Pablo García Gómez, et al.
Published: (2025-03-01) -
A multi objective collaborative reinforcement learning algorithm for flexible job shop scheduling
by: Jian Li, et al.
Published: (2025-07-01) -
Beyond Kanban: POLCA-Constrained Scheduling for Job Shops
by: Antonio Grieco, et al.
Published: (2025-06-01) -
Application of Levy flight-based harmony search algorithm for the flexible job shop scheduling
by: Jun Li, et al.
Published: (2025-05-01)