Evaluation influence of routing flexibility to makespan in FJSP with SA and GRASP algorithm

In the paper the influence of routing flexibility on makespan is discussed. The flexible job shop scheduling problem FJSP (an extension of the clasical job shop scheduling), which provides a closer approximation to real scheduling problems, is analyzed. For the analysis of the production process the GRASP and simulated annealing heuristic algorithms were used. Different rates of routing flexibility have been considered and compared. The presented algorithms have been implemented, tested, and illustrated with examples for serial and parallel routes.