In this paper, the single-machine scheduling problem is studied by simultaneously considering due-date assignment and group technology (GT). The objective is to determine the optimal sequence of groups and jobs within groups and optimal due-date assignment to minimize the weighted sum of the absolute value in lateness and due-date assignment cost, where the weights are position dependent. For the common (CON) due-date assignment, slack (SLK) due-date assignment, and different (DIF) due-date assignment, an time algorithm is proposed, respectively, to solve the problem, where is the number of jobs.

中文翻译：

---

群技术下交货期单机调度的优化

本文通过同时考虑到期日期分配和组技术（GT）来研究单机调度问题。目的是确定组和组内作业的最佳顺序以及最佳到期日分配，以最大程度减少延迟和到期日分配成本中绝对值的加权总和，其中权重与位置有关。对于普通（CON）截止日期分配，松弛（SLK）截止日期分配和不同（DIF）截止日期分配，分别提出了一种时间算法来解决该问题，即作业数。