The solution of the Akers-Friedman production scheduling problem for the case of two parts and m machines (2 × m) is given. The combination of dynamic programming and graphical approaches makes the method of solution especially effective. Even for large m the solution is very quickly obtained by using the proposed method. The case n × m is discussed and a 3 × 10 example is solved.