Optimization of task processing on parallel processors with learning abilities

In this paper, we analyse the two identical parallel processor makespan minimization problem with the learning effect, which is modelled by position dependent job/task processing times. We construct an exact pseudopolynomial time algorithm for the considered problem that takes into consideration the learning ability of the processors. Moreover, we analyse the efficiency of the exact algorithm dedicated for the classical problem with constant job/task processing times, if it is used to provide a schedule of jobs/tasks for the learning system.