Avaliação de regras de ordenação para o problema flowshop com setup separado

Abstract

This work is characterized by the comparative performance study of LPT, SPT and NEH sequencing rules adapted for the resolution of flowshop sequencing tasks, with separate and sequence independent setup time. To carry out the performance analysis, is considered not only the processing time of each job for each machine available, but also the time needed to perform the configuration of the used machines. In order to identify the best sequencing method to be used, the performance of the methods based on the makespan results was analyzed using a computer modeling software, according to statistical tools such as percentage of success and mean relative deviation. After the calculations, we found in the first analysis, of SPT and LPT heuristic methods, the best performance of LPT heuristic method with consideration of the setup time of the tasks added to the processing times. For NEH method, the LPT sequencing rules without considering the setup time for defining the sequencing of the tasks was more effective. It was also concluded the best performance of the constructive methods when compared to SPT and LPT heuristics methods, to result in 100% of problems the lowest makespan values.