期刊
COMPLEXITY
卷 2021, 期 -, 页码 -出版社
WILEY-HINDAWI
DOI: 10.1155/2021/6656261
关键词
-
资金
- National Natural Science Foundation of China [71871091, 71471057]
- Natural Science Foundation of Liaoning Province in China [2020-MS-233]
This paper studies the single-machine scheduling problem by considering due-date assignment and group technology. It proposes algorithms for different due-date assignment methods to minimize the weighted sum of lateness and due-date assignment cost.
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 O(n log n) time algorithm is proposed, respectively, to solve the problem, where n is the number of jobs.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据