Scheduling with learning effects has received lots of research attention lately. However, the multiple-agent setting with learning consideration is relatively limited. On the other hand, the actual processing time of a job under an uncontrolled learning effect will drop to zero precipitously as...

In this paper, we investigate a single-machine problem with the learning effect and release times where the objective is to minimize the makespan. A branch-and-bound algorithm incorporating with several dominance properties and lower bounds is developed to derive the optimal solution. A...