Study on Convex Resource Allocation Scheduling with a Time-Dependent Learning Effect

In classical schedule problems, the actual processing time of a job is fixed constant, but in production process, affected by variety factors, two which are learning effect and resource allocation. this paper, single-machine scheduling problems with allocation time-dependent investigated. The depends on sum normal times previous jobs non-renewable resources. With convex consumption function, goal to determine optimal Three arising from criteria (i.e., total cost cost) studied. For some special cases we prove that they can be solved polynomial time. More generally, propose accurate intelligent algorithms solve these problems.