A class of hypothesis-test-based genetic algorithms for flow shop scheduling with stochastic processing time

Abstract

As an important optimisation problem with a strong engineering background, stochastic flow shop scheduling with uncertain processing time is difficult because of inaccurate objective estimation, huge search space, and multiple local minima, especially NP-hardness. As an effective meta-heuristic, genetic algorithms (GAs) have been widely studied and applied in scheduling fields, but so far seldom for stochastic cases. In this paper, a hypothesis-test method, an effective methodology in statistics, is employed and incorporated into a GA to solve the stochastic flow shop scheduling problem and to avoid premature convergence of the GA. The proposed approach is based on statistical performance and a hypothesis test. It not only preserves the global search ability of a GA, but it can also reduce repeated searches for those solutions with similar performance in a statistical sense so as to enhance population diversity and achieve better results. Simulation results based on some benchmarks demonstrate the feasibility and effectiveness of the proposed method by comparison with traditional GAs. The effects of some parameters on the performance of the proposed algorithms are also discussed .