We consider the two-machine total completion time flow shop problem with additional requirements. These requirements are the so-called no-idle constraint where the machines must operate with no inserted idle time and the so-called no-wait constraint where jobs cannot wait between the end of an operation and the start of the following one. We propose a matheuristic approach that uses an ILP formulation based on positional completion times variables and exploits the structural properties of the problem. The proposed approach shows very competitive performances on instances with up to 500 jobs in size.

中文翻译：

---

在两机无空闲无等待流水车间问题中最大程度地减少总完成时间

我们考虑带有附加要求的两机总完成时间流水车间问题。这些要求是所谓的无空闲约束，其中机器必须在没有插入的空闲时间的情况下运行，而所谓的无等待约束，其中作业不能在操作结束与下一个操作开始之间等待。我们提出一种数学方法，该方法基于位置完成时间变量使用ILP公式，并利用问题的结构特性。所提出的方法在具有多达500个工作岗位的实例上显示出非常有竞争力的性能。