Demonstrating Johnson’s algorithm via resource-constrained scheduling
本文用资源受限调度概念解释约翰逊算法，帮助学生直观理解，并简化经典调度结论的证明，适合教学参考。
The celebrated Johnson’s algorithm to solve the two-machine flowshop scheduling problem to minimise the makespan plays a prominent role in scheduling research. In using resource-constrained scheduling to interpret Johnson’s algorithm in teaching scheduling theory and operations management, we have received positive student feedback on the perceived intuition. We demonstrate this idea and show that the resource-constrained scheduling concept also helps simplify the proofs of some classical scheduling results.