The aim of this paper is to present an implementation of Hierarchic Genetic Strategy (HGS) in solving the Permutation Flowshop Scheduling Problem (PFSP). We defined a hierarchic scheduler based on HGS structure for the exploration of the wide and complicated optimization landscape studied by Reeves. The objective of our work is to examine several variations of HGS operators in order to identify a configuration of operators and parameters that works best for the problem. From the experimental study we observed that HGS implementation outperforms existing schedulers in many of considered instances of a static benchmark for the problem.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.