Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity
研究了单机上带有恶化和可压缩维护活动的截止窗口分配与调度问题，目标是最小化基于提前、延迟、窗口位置、窗口大小和资源成本的总成本函数，并给出了多项式时间算法。
In this paper, we consider common due-window assignment and scheduling problems with general position-dependent processing times involving deteriorating and compressible maintenance activity on a single machine. Two models associated with maintenance activity are examined in this article, in which the maintenance length is assumed to be either time-dependent and compressible or position-dependent and compressible. The objective is to find jointly the location and size of due-window, position of maintenance as well as resource amount allocated to it, and job sequence to minimise a total cost function based on earliness, tardiness, window location, window size and resource cost. We show that the problem considered in each of the two models’ setting can be optimally solved with polynomial time algorithm by reducing to assignment problem. Finally, two examples are provided to illustrate the solution procedures.