An improved chaotic crow search algorithm（CCSA）is proposed for solving the fuzzy job-shop scheduling problem（FJSSP）.The algorithm adopts the process-based coding method

and a solution-correct way is designed to make CCSA solve FJSSP effectively.In order to enhance the neighborhood search ability of the algorithm

the mutation operator is introduced.In order to improve the evolutionary ability of the algorithm

multiple optimal individual set based on the Cosine Similarity is proposed to guide the evolution

which not only enhanced the evolutionary efficiency but also ensures the diversity of the population.In order to further improve the search efficiency of CCSA when solving FJSSP

a search method based on the reduction of machine’s spare time is proposed.Finally

five benchmark problems are selected for testing

and the results verify the effectiveness of the proposed algorithm.