The flow shop scheduling with the no-wait constraint is a typical NP-hard combinatorial optimization problem and represents an important area in production scheduling. In this paper, a class of particle swarm optimization (PSO) approach with simulated annealing (SA) and hypothesis test (HT), namely PSOSAHT is proposed for the stochastic flow shop scheduling with no-wait constraint to minimize t...
