We study a single machine lot scheduling problem. Customers’ orders may be processed simultaneously in the same lot. The order sizes are assumed to be order-dependent, and the lots have identical size and identical processing time. Orders may be split, i.e., their processing may be performed on two consecutive lots. We assume order-dependent due-dates and weights, and the goal is to minimize the maximum weighted tardiness among all orders. A polynomial time solution algorithm is introduced.

中文翻译：

---

关于在单台机器上进行批次调度以最大限度地减少最大加权迟到的说明

我们研究单机批次调度问题。客户的订单可以在同一批次中同时处理。假设订单大小与订单相关，并且批次具有相同的大小和相同的处理时间。订单可以被拆分，即它们的处理可以在两个连续的批次上执行。我们假设与订单相关的到期日和权重，目标是最小化所有订单中的最大加权延迟。引入多项式时间求解算法。