Bentao Su

Evolving heuristic rules for dynamic flexible job shop scheduling problem with grey processing time

A memory-guided adaptive feature genetic programming algorithm that evolves interpretable heuristic dispatching rules while handling stochastic arrivals and iterative grey-time updating efficiently and can reduce the simulation budget needed for rule evolution, support managerial inspection of scheduling logic and reduce reliance on expert-designed heuristics.