论文信息 - The nature of simplicity of Johnson's algorithm

The nature of simplicity of Johnson's algorithm

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.

Jerzy Kamburowski

[1] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .

[2] Shun-Chen Niu,et al. On Johnson's Two-Machine Flow Shop with Random Processing Times , 1986, Oper. Res..

[3] Thomas E. Morton,et al. Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[4] E. Muth. The Reversibility Property of Production Lines , 1979 .