THE EFFECTIVENESS OF NEIGHBORHOOD STRUCTURES IN LOCAL SEARCH ALGORITHMS FOR FLEXIBLE JOB SHOP SCHEDULING PROBLEM

摘要

In the paper the effectiveness of neighborhood structures in local search algorithms for flexible job shop scheduling problem on makespan is discussed. For the analysis of the effectiveness neighborhoods N1-N4, NS and NL with GRASP algorithm were used. Experiments with different neighborhoods of the algorithm have been considered and compared. The presented neighborhoods have been tested, and illustrated with examples for serial and serial - parallel routes.