SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
复制标题
根据位置、开始时间和分配的资源安排处理时间的作业
DOI：
10.1142/s0217595912500303
复制
发表时间：
2012-10-01
影响因子：
1.4
通讯作者：
Ji, Ping
中科院分区：
文献类型：
--
作者：
Wang, Ji-Bo;Wang, Ming-Zheng;Ji, Ping
考虑工件的加工时间是工件在序列中的位置、工件的起始时间和工件的资源分配的函数的单机排序问题。其目标是分别求出最优的工件序列和最优的资源分配。我们分别集中在两个目标，即，最小化成本函数包含完工时间，总完工时间，总的绝对差异的完成时间，和总资源成本;最小化成本函数包含完工时间，总等待时间，总的绝对差异的等待时间，和总资源成本。该问题被建模为一个分配问题，因此可以在多项式时间内解决。还示出了问题的一些扩展。
We consider single-machine scheduling problem in which the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two goals separately, namely, minimizing a cost function containing makespan, total completion time, total absolute differences in completion times, and total resource cost; minimizing a cost function containing makespan, total waiting time, total absolute differences in waiting times, and total resource cost. The problem is modeled as an assignment problem, and thus can be solved in polynomial time. Some extensions of the problem are also shown.