“…types of the single-machine problem remain polynomially solvable. Since then, scheduling with the effect of learning has attracted researchers' attention in the last decade (see, e.g., Bachman and Janiak [1], Cheng et al [7,5], Janiak and Rudek [10,11,13,14], Janiak et al [12], Kuo and Yang [15,16], Lee et al [18], Lee and Wu [19], Mosheiov [21], Mosheiov and Sidney [22], Wang [25], Wu and Lee [26]). Mosheiov and Sidney [22] first considered job-dependent learning effects by assuming that the actual processing time of job J i is p ir = p i r a i if it is scheduled in the rth position of a sequence, where a i 0 is the job-dependent learning index of job J i .…”