GREEDY ITERATED HEURISTICS FOR THE PERMUTATIONAL FLOW SHOP PROBLEM WITH RESOURCE DETERIORATION

This article addresses the problem of permutational flowshop sequencing considering machine deterioration.
The machines used for the processing of tasks are subject to progressive wear and tear, so that the effective processing time of a task depends on the position occupied by it in the sequence. 
Thus, tasks allocated to later positions require longer times due to the accumulated wear and tear of the machine throughout the process.
The problem is to determine the sequence of processing of the tasks in order to minimize the maximum delay in relation to the delivery dates. < /> To solve this problem, we investigated the application of the Iterated Greedy (GI) metaheuristic, recognized for its simplicity and efficiency in sequencing problems.
Computational experiments and comparisons with heuristics available in the literature were carried out, with the aim of validating the effectiveness of the proposed approach. The results obtained demonstrated the high potential of the IG heuristic for the efficient solution of the studied problem.