| Article ID: | iaor19991785 |
| Country: | United Kingdom |
| Volume: | 25 |
| Issue: | 5 |
| Start Page Number: | 581 |
| End Page Number: | 584 |
| Publication Date: | Oct 1997 |
| Journal: | OMEGA |
| Authors: | Kamburowski J. |
| Keywords: | production |
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.