到达时间依赖于资源分配的单机排序问题

Single machine scheduling problems with arrive time of jobs depending on resource allocated

研究了具有线性退化及学习效应作用下的单机排序问题,对于工件的到达时间是其资源消耗量的正的严格单调递减函数时,考虑了总资源消耗量限定情形下最大完工时间极小化问题,给出了相应的最优算法;也考虑了满足工件最大完工时间限制的条件下极小化资源消耗的总量问题,提出最优资源分配方案。

This paper considered the single machine scheduling problems with learning effect and deteriorating jobs.Arrive time of jobs was a positive and strictly decrease function about resource consumption.It presented the optimal algorithms for the problems to minimize the makespan with the total resource consumption constraints.It presented an optimal allocation scheme also for the problems to minimize the total resource consumption with the makespan constraints.