Solution of the Akers-Friedman Scheduling Problem
- 1 December 1960
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 8 (6) , 782-788
- https://doi.org/10.1287/opre.8.6.782
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: