|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 4 of 17 found articles
| Title: |
A network flow algorithm for optimal resource allocation |
| Author: |
Khan, M. Riaz |
| Appeared in: |
International journal of production research |
| Paging: | Volume 19 (1981) nr. 5 pages 515-524 |
| Year: |
1981-09-01 |
| Contents: |
This paper introduces a network flow method for manpower scheduling and resource allocation. The network formulation of the problem permits the development of an algorithm that determines the minimal flow of resources through the network. The method presented here corresponds to the Simplex method, for in both methods the value of the objective function is optimized while the capacity limitations are preserved. The procedure proposed here, however, uses a more economical problem representation and is computationally more efficient. The efficacy of the minimal flow algorithm and its use is illustrated for a production system but the applicability of the procedure is sufficiently broad for it to work in other problem situations just as well. |
| Publisher: |
Taylor & Francis |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 4 of 17 found articles
| << previous | next >> |