Single-machine group scheduling with a time-dependent learning effect

In many realistic situations, the more time you practice, the better learning effect you obtain. Thus, we propose a time-dependent learning effect and introduce it into the single-machine group scheduling problems. The two objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide two polynomial time algorithms to solve these problems.