Abstract
Efficient methods for the determination of unique part levels, the generation of the total requirement matrix and the computation of parts requirements in a manufacturing system are presented. The algorithms discussed here achieve substantial reduction in both core storage and execution times.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. T. Finkbeiner,Introduction to Matrices and Linear Transformations, Freeman & Co. (1966).
B. Langefors,Computation of parts requirements for production scheduling, BIT 2 (1962), 91–111.
P. G. Loewner,Matrix methods for processing configuration data, IBM Sys. Journal 4 (1965), 105–121.
J. A. Orlicky,Material Requirements Planning, McGraw-Hill, N.Y. (1975).
U. W. Pooch and A. Nieder,A survey of indexing techniques for sparse matrices, Comp. Surveys 2 (1973), 109–133.
A. Vazsonyi,Scientific Programming in Business and Industry, J. Wiley, N.Y. (1958).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Francis, N.D. Computation of material requirements for production planning. BIT 19, 34–38 (1979). https://doi.org/10.1007/BF01931219
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01931219