Unbounded batch scheduling with a common due window on a single machine*
Unbounded batch scheduling with a common due window on a single machine*
复制标题
DOI：
10.1007/s11424-008-9113-y
复制
发表时间：
2008-05
影响因子：
2.1
通讯作者：
Hongluan Zhao;Guojun Li
中科院分区：
文献类型：
--
作者：
Hongluan Zhao;Guojun Li
研究了单机带延迟交货期的公共交货期窗口排序问题，目标函数为最小化加权提前和拖期总惩罚。在本文中，它是假设一个工作不会招致任何惩罚，只要它是在公共到期窗口内完成。这是第一次将交货期窗口调度扩展到这种情况，使工件可以分批处理。一个无界版本的批调度也被认为是。因此，一旦机器空闲，无论有多少作业，都可以批量处理。对于交货期窗口位置为决策变量或给定参数两种情况，基于几个最优性质提出了多项式算法。
The common due window scheduling problem with batching on a single machine is dealt with to minimize the total penalty of weighted earliness and tardiness. In this paper it is assumed that a job incurs no penalty as long as it is completed within the common due window. It is the first time for the due window scheduling to be extended to this situation so that jobs can be processed in batches. An unbounded version of batch scheduling is also considered. Hence, jobs, no matter how many there are, can be processed in a batch once the machine is free. For two cases that the location of due window is either a decision variable or a given parameter, polynomial algorithms are proposed based on several optimal properties.