Genetic ordinal optimisation for stochastic flow shop scheduling.

Stochastic flow shop scheduling is a typical and widely studied NP-hard stochastic optimisation problem with strong industrial roots. However, due to inaccurate estimation of objective values, NP-hardness and a limited computing budget, it is generally hard to solve such stochastic optimisation problems effectively and efficiently. Based on the idea of order comparison and goal softening, ordinal optimisation (OO) has been widely applied for stochastic optimisation. In this paper, OO and optimal computing budget allocation (OCBA) as well as a genetic algorithm (GA) are reasonably hybridised to propose an effective genetic ordinal optimisation (GOO) approach for flow shop scheduling with stochastic processing times. In GOO, limited computing effort can be intelligently allocated by OCBA to provide reliable and robust evaluation and identification of good solutions in a population, and the solution space can be well explored by an order-based evolutionary genetic search with the good solutions identified by OCBA. Simulation results based on benchmarks demonstrate the effectiveness of the GOO by comparison with traditional methods. Moreover, the effects of some parameters on the optimisation performance are discussed. [ABSTRACT FROM AUTHOR]