成组排序中确定公共交货期使误工工件数最小问题

Single Machine Scheduling with Common Due Date Assignment in a Group Technology Environment

本文讨论的问题是在单台机器成组加工中为已经到达的工件集确定公共的交货期和工件的加工顺序，使因确定交货期所化代价和因误工造成的损失之和为最小。本文对满足成组技术假设和不满足成组技术假设这两种情况分别给出寻找最优解的多项式算法。

This paper considers the problem of assigning a common due date to a set of simultaneously available jobs and sequencing them on a single machine. The objective is to determine a common due date value and a job sequence that jointly minimize a cost function based on the assigned due date and the number of tardy jobs. Two cases are considered, i.e., batching under the group technology assumption and batching without the group technology assumption. Two efficient (polynomial bound) algorithms to find the optimal solutions are presented and an illustrative example is also provided.