Total completion time with makespan constraint in no-wait flowshops with setup times
The multi objective problem with setup times is addressed. Different algorithms including the most recent ones are proposed. One of the algorithms performs better than the others, statistically verified. Algorithms, including the best one in the literature, have the same CPU time. Best algorithm reduces the error of the best one in the literature by at least 90%.
total completion time makespan no-wait flowshop setup times scheduling