欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
在一台单个机器上与 batching 安排问题的普通到期的窗户被处理最小化加权的早和缓慢的全部的惩罚。只要它在普通到期的窗户以内被完成，在这篇论文，一个工作不招致惩罚，这被假定。它是为安排被延长到这种状况的到期的窗户的第一次以便工作能在批被处理。批安排的一个无界的版本也被考虑。因此，工作，不管有多少，一旦机器是免费的，能在批被处理。为到期的窗户的地点是一个决定变量或一个给定的参数的二个盒子，多项式算法基于几个最佳的性质被建议。
英文摘要：
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.
同期刊论文项目
同项目期刊论文
期刊信息
位置：