Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times
Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times
复制标题
DOI：
10.1080/00207543.2013.793424
复制
发表时间：
2013-09
影响因子：
9.2
通讯作者：
Yunqiang Yin;T. Cheng;Chin-Chia Wu;Shuenn-Ren Cheng
中科院分区：
文献类型：
--
作者：
Yunqiang Yin;T. Cheng;Chin-Chia Wu;Shuenn-Ren Cheng
本文研究了具有可分配公共交货期和可控加工时间的单机分批交货调度问题。作业处理时间是分配给作业的连续可分且不可再生的资源量的线性或凸函数。完成的作业是分批交付的，每个交付批次没有能力限制。目标是找到一个作业序列、作业序列的批次划分、一个共同的到期日和资源分配，它们共同最小化基于提前期、拖期作业加权数、作业持有量、交货期分配、批量交付、最大完工时间和资源消耗的成本函数。给出了最优解的一些性质，并证明了线性资源消耗函数和凸资源消耗函数的最优解可以分别在时间和时间内求解。我们还证明了该问题的某些特殊情况可以用低阶算法来解决。
In this paper we consider the problem of single-machine batch delivery scheduling with an assignable common due date and controllable processing times. The job processing time is either a linear or a convex function of the amount of a continuously divisible and non-renewable resource allocated to the job. Finished jobs are delivered in batches and there is no capacity limit on each delivery batch. The objective is to find a job sequence, a partition of the job sequence into batches, a common due date, and resource allocation that jointly minimise a cost function based on earliness, weighted number of tardy jobs, job holding, due-date assignment, batch delivery, makespan, and resource consumption. We provide some properties of the optimal solution, and show that the problem with the linear and convex resource consumption functions can be solved in and time, respectively. We also show that some special cases of the problem can be solved by lower-order algorithms.