The nature of simplicity of Johnson's algorithm

@inproceedings{Kamburowski1997TheNO,
  title={The nature of simplicity of Johnson's algorithm},
  author={Jerzy Kamburowski},
  year={1997}
}
This note presents a simple proof and a graphical illustration for the optimality of the famous algorithm of Johnson which minimizes the makespan in two-machine flow shops.