A note on the paper ‘Demonstrating Johnson’s algorithm via resource constrained scheduling’
本文指出约翰逊定理中定义的两项作业关系不具有传递性，但定理和算法本身仍然正确。
In this paper, we demonstrate that the relation between two jobs defined by min{ai, bj} ≤ min{bi, aj}, used in Johnson’s theorem, is not transitive. However, both the theorem and Johnson’s algorithm are correct.