Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect