Optimization for Due-Date Assignment Single-Machine Scheduling under Group Technology
Optimization for Due-Date Assignment Single-Machine Scheduling under Group Technology
复制标题
成组技术下到期日分配单机调度优化
DOI：
10.1155/2021/6656261
复制
发表时间：
2021
期刊：
影响因子：
2.3
通讯作者：
Wei-Wei Liu
中科院分区：
文献类型：
--
作者：
Li-Yan Wang;Mengqi Liu;Ji-Bo Wang;Yuan-Yuan Lu;Wei-Wei Liu
研究了同时考虑交货期分配和成组技术的单机调度问题。目标是确定组和组内作业的最优顺序和最优交货期分配，以最小化延误绝对值和交货期分配成本的加权和，其中权重与位置有关。对于普通(CON)到期日作业、松弛(SLK)到期日作业和不同(DIF)到期日作业，不，不。原木。。分别提出了N-时间算法来解决该问题，其中。N是工作岗位的数量。
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.