Mosheiov & Sidney [5] showed that the single-machine makespan minimization problem with job-dependent learning effects can be formulated as an assignment problem and solved in O($n^3$) time. Later on, Koulamas [4] showed that the scheduling problem can be solved in O(nlogn) time by sequencing the jobs according to the shortest processing time (SPT) rule if the job-dependent learning rate are correlated with the level of sophistication of the jobs and bounded from below. The optimality of the SPT job sequence still holds when job-dependent learning rate are inversely correlated with the level of sophistication of the jobs and bounded from above. The main results in the paper are correct, however, there is an error in Corollary 1 and the proofs of Proposition 1 and Corollary 1 are not complete. In this note, a counter example for the latter case is given first and then a modified corollary is provided. Next, a lemma is provided to complete the proofs of Proposition 1 and Corollary 1. Finally, a simple algorithm is developed to solve the latter case in O($n^2$) time.

Mosheiov 和 Sidney [5]表明，具有依赖于工作的学习效果的单机完工时间最小化问题可以表示为分配问题并在 O($n^3$） 时间。后来，Koulamas [4]表明，如果依赖于作业的学习率与作业的水平相关，则通过根据最短处理时间（SPT）规则对作业进行排序，可以在 O( n log n ) 时间内解决调度问题。工作的复杂性和自下而上的界限。当依赖于工作的学习率与工作的复杂程度成反比并且受上面限制时，SPT 工作序列的最优性仍然成立。论文的主要结果是正确的，但是推论1以及命题1和推论1的证明有错误不完整。在本文中，首先给出后一种情况的反例，然后提供修改后的推论。接下来，提供一个引理来完成命题1和推论1的证明。最后，开发了一个简单的算法来解决后一种情况，时间复杂度为 O($n^2$） 时间。