Answers are grounded in this paper and cite their sources.
Dynamic Flexible Job Shop Scheduling (DFJSS) is a critical challenge in smart manufacturing due to dynamic job arrivals, machine breakdowns, routing flexibility, and multi-objective performance requirements. Conventional dispatching rules and metaheuristic algorithms often fail to provide adaptive real-time decisions. This paper proposes a Greedy Actor Neural Critic PPO based Reinforcement Learning (GANC-PPO-RL) framework to minimize makespan and total energy consumption. The problem is formulated as a Markov Decision Process, where machine availability, job progress, queue status, processing times, and energy levels define states, and job–machine assignments define actions. A multi-objective reward penalizes higher makespan and energy usage. The PPO algorithm ensures stable policy updates using a clipped objective. Results show makespan within ±2% of benchmarks for small instances and about 23% reduction for larger cases, with 16–20% lower makespan and 15–25% lower energy consumption compared to RL-QL.
No takes yet. Share an insight, caveat, or question.
Chandrasekar et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: