This paper studies single machine scheduling with batch deliveries, where a common due window for all jobs has to be determined, not given in advance. The objective is to minimize the overall cost for the process and delivery. Concretely, it includes the penalty of a job being early or tardy, the cost for holding and delivering a job, and the cost incurred by a late starting or a long duration of the common due window. Observing the NP-hardness, we provide an optimal algorithm of the problem and convert it to a fully polynomial time approximation scheme for a special case.

中文翻译：

---

具有可分配的公共到期窗口和保留时间的供应链调度问题的一种近似算法

本文研究具有批处理交货的单机调度，其中必须确定所有作业的共同到期窗口，而不是提前给出。目的是使过程和交付的总成本最小化。具体而言，它包括工作过早或拖延的惩罚，持有和交付工作的成本，以及由于公共到期窗口的延迟启动或长期持续而产生的成本。观察NP硬度，我们为问题提供了一种优化算法，并将其转换为特殊情况下的完全多项式时间近似方案。