Solving the Flexible Open-Job Shop Scheduling Problem with GRASP and Simulated Annealing

In the paper the flexible open - job shop scheduling problem FOJSP (an extension of the classical job shop scheduling) is analyzed. For the optimization of the production process to make span the GRASP and Simulated Annealing algorithms have been used. Different “open” rates have been considered and compared. The presented algorithms have been implemented, tested, and illustrated with examples for serial and parallel routes.