We study flowshop scheduling problems with respect to slack due window assignments, which are operations in which jobs are assigned an individual due window. We combine learning effect and controllable processing times, in which the flowshop has a two-machine no-wait setup. The goal is to determine job sequence, slack due window based on common flow allowance, due window size, and resource allocation. We provide a bicriteria analysis for the scheduling and resource consumption costs. We show that the two costs can be solved in polynomial time utilizing three different combinations.

中文翻译：

---

具有学习效应和松弛到期窗口分配的资源分配流水车间调度

我们研究了与松弛到期窗口分配相关的流水车间调度问题，这是为作业分配一个单独的到期窗口的操作。我们结合了学习效果和可控的处理时间，其中流水车间有两台机器的无等待设置。目标是根据通用流量限额、到期窗口大小和资源分配来确定作业顺序、松弛到期窗口。我们为调度和资源消耗成本提供双标准分析。我们表明可以使用三种不同的组合在多项式时间内解决这两个成本。