Reentrant flow shop with identical jobs and makespan criterion
研究了再入流水车间中相同作业的最小化最大完工时间问题，提出了整数规划模型，纠正了两种贪心启发式算法的错误，并通过机器学习分析比较了它们的优劣。
The article focuses on the problem of a reentrant flow shop with identical jobs and makespan minimisation objective. After presenting an optimal integer programming formulation for the problem, we consider the case of unit processing times. We correct two results published a few decades ago regarding two greedy heuristic algorithms. In some cases, these algorithms lead to an optimal solution, but they are generally not optimal. We point out the advantages of each of the two heuristic algorithms and, by machine learning analysis, discuss features that differentiate between them.