This study considers a two-machine flowshop with a limited waiting time constraint between the two machines and sequence-dependent setup times on the second machine. These characteristics are motivated from semiconductor manufacturing systems. The objective of this scheduling problem is to minimize the total tardiness. In this study, a mixed-integer linear programming formulation was provided to define the problem mathematically and used to find optimal solutions using a mathematical programming solver, CPLEX. As CPLEX required a significantly long computation time because this problem is known to be NP-complete, a genetic algorithm was proposed to solve the problem within a short computation time. Computational experiments were performed to evaluate the performance of the proposed algorithm and the suggested GA outperformed the other heuristics considered in the study.

中文翻译：

---

具有有限等待时间约束和依赖序列的建立时间的两机流水车间的遗传算法

这项研究考虑了两台机器的流水车间，两台机器之间的等待时间受到限制，并且第二台机器上的与序列有关的建立时间也受到限制。这些特性来自半导体制造系统。该调度问题的目的是使总拖延最小化。在这项研究中，提供了一种混合整数线性规划公式，以数学方式定义问题，并使用数学规划求解器CPLEX来找到最佳解。由于CPLEX由于此问题被认为是NP完全问题而需要相当长的计算时间，因此提出了一种遗传算法来在较短的计算时间内解决该问题。