abstract = "Dynamic flexible job-shop scheduling (DFJSS) is a
challenging combinational optimization problem that
takes the dynamic environment into account. Genetic
programming hyperheuristics (GPHH) have been widely
used to evolve scheduling heuristics for job-shop
scheduling. A proper selection of the terminal set is a
critical factor for the success of GPHH. However, there
is a wide range of features that can capture different
characteristics of the job-shop state. Moreover, the
importance of a feature is unclear from one scenario to
another. The irrelevant and redundant features may lead
to performance limitations. Feature selection is an
important task to select relevant and complementary
features. However, little work has considered feature
selection in GPHH for DFJSS. In this article, a novel
two-stage GPHH framework with feature selection is
designed to evolve scheduling heuristics only with the
selected features for DFJSS automatically. Meanwhile,
individual adaptation strategies are proposed to use
the information of both the selected features and the
investigated individuals during the feature selection
process. The results show that the proposed algorithm
can successfully achieve more interpretable scheduling
heuristics with fewer unique features and smaller
sizes. In addition, the proposed algorithm can reach
comparable scheduling heuristic quality with much
shorter training time.",
notes = "Evolutionary Computation Research Group, School of
Engineering and Computer Science, Victoria University
of Wellington, Wellington 6140, New Zealand