This paper studies single-machine due-window assignment scheduling problems with truncated learning effect and resource allocation simultaneously. Linear and convex resource allocation functions under common due-window (CONW) assignment are considered. The goal is to find the optimal due-window starting (finishing) time, resource allocations and job sequence that minimize a weighted sum function of earliness and tardiness, due window starting time, due window size, and total resource consumption cost, where the weight is position-dependent weight. Optimality properties and polynomial time algorithms are proposed to solve these problems.

中文翻译：

---

具有截短的学习效果和位置相关权重的适当窗口分配和资源分配计划

本文研究了具有截短学习效果和资源分配的单机到期窗口分配调度问题。考虑了普通到期窗口（CONW）分配下的线性和凸形资源分配函数。目标是找到最佳的到期窗口开始（结束）时间，资源分配和作业顺序，以最小化早期和迟到，到期窗口开始时间，到期窗口大小以及总资源消耗成本的加权和函数，其中权重是位置相关的体重。提出了最优性和多项式时间算法来解决这些问题。