Heuristics for minimizing the total tardiness in a re-entrant hybrid flow shop with non-identical machines in parallel

This paper focuses on the production scheduling problem in a rotor workshop. The scheduling problem is formulated as a reentrant hybrid flow shop problem with non-identical machines in parallel. Some heuristics are developed to solve the problem. The proposed algorithms are compared through various instances that are generated based on real operations in the workshop. Experimental result also reveals that the bottleneck machines in “non-identical” set should be assigned with lower priority.