Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
复制标题
DOI：
10.1016/j.apm.2012.05.025
复制
发表时间：
2013-02
影响因子：
5
通讯作者：
Xue-Ru Wang;Jian-Jun Wang
中科院分区：
文献类型：
--
作者：
Xue-Ru Wang;Jian-Jun Wang
在这项研究中，我们考虑的调度问题与凸资源依赖的加工时间和恶化的工件，其中的工件的加工时间是它的开始时间和凸资源分配的函数。目标是分别求出最优的工件序列和最优的凸资源分配。本文研究了以极小化包含完工时间、总完工时间、完工时间绝对差和总资源费用的成本函数和包含完工时间、总等待时间、等待时间绝对差和总资源费用的成本函数为目标的单机优化问题。结果表明，在所提出的模型下，问题仍然多项式可解。
In this study, we consider scheduling problems with convex resource dependent processing times and deteriorating jobs, in which the processing time of a job is a function of its starting time and its convex resource allocation. The objective is to find the optimal sequence of jobs and the optimal convex resource allocation separately. This paper focus on the single-machine problems with objectives of minimizing a cost function containing makespan, total completion time, total absolute differences in completion times and total resource cost, and a cost function containing makespan, total waiting time, total absolute differences in waiting times and total resource cost. It shows that the problems remain polynomially solvable under the proposed model.