Algorithm Based on K-Neighborhood Search for No-wait Job Shop Scheduling Problems

No-wait job shop scheduling problem is a kind of typical production scheduling problems. The majority of this kind of problem is NP-hard computational complexity. Local search are easily trapped into local optima. This paper decomposes No-wait job shop scheduling problem into two sub-problems. Then proposed an inverse problem based algorithm for the first sub-problems. and a K-neighborhood search algorithm was proposed for the second sub-problems. The method built in this paper has fast convergence speed. At last, extensive experiments have done for algorithm validation and comparison. Experiments results show that the method proposed in this paper can get better results than some classic algorithms and the algorithm is tit forNo-wait job shop scheduling problems.