According the characteristic of large-scale no-wait flow shop, a method for calculating makespan is proposed
for large-scale no-wait flow shop scheduling by using the distance of adjacent workpiece. At the same time, an iterative
neighborhood search algorithm is proposed, which reduces the time complexity, so the efficiency is greatly improved. In
order to avoid falling into local optimum, the mind of variable neighborhood search algorithm is used, so that the probability
to finding the global optimal solution is enhanced. Experiment results show that the algorithm can solve the problem of
large-scale no-wait flow-shop scheduling efficiently, and the result is better.