We present the problem of job scheduling for the manufacture of textile products, considering common conditions in the real environments of this type of industry. The proposed mathematical model considers sequence-dependent setup times, malleability, eligibility, dynamic input, unrelated parallel machines, variable transfer batch, more than two stages and deadline-based objective function. To solve the problem, we applied a genetic algorithm with initial population that includes solutions by priority rules, assignment by flexibility index, multiple crossing points, variable mutation rate and stop criteria by iterations without improvement. The results show that in cases of moderate size a high degree of attraction to the optimum can be achieved with the proposed parameters and that in cases of larger size it may be necessary to increase, above all, the number of iterations without improvement established to stop.