abstract = "Dynamic flexible job shop scheduling (DFJSS) considers
making machine assignment and operation sequencing
decisions simultaneously with dynamic events. Genetic
programming hyper-heuristics (GPHH) have been
successfully applied to evolving dispatching rules for
DFJSS. However, existing studies mainly focus on
evolving deterministic dispatching rules, which
calculate priority values for the candidate machines or
jobs and select the one with the best priority.
Inspired by the effectiveness of training stochastic
policies in reinforcement learning, and the fact that a
dispatching rule in DFJSS is similar to a policy in
reinforcement learning, we investigate the
effectiveness of evolving stochastic dispatching rules
for DFJSS in this paper. Instead of using the
winner-takes-all mechanism, we define a range of
probability distributions based on the priority values
of the candidates to be used by the stochastic
dispatching rules. These distributions introduce
varying degrees of randomness.",