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.