Abstract
In this paper, we address some flaws in the material allocation function of Materials Requirements Planning (MRP). The problem formulation differs from standard MRP logic in certain important ways: start and finish times for orders are forced to be realistic and material allocations are made to minimize the total tardiness penalty associated with late completion. We show that the resulting MRP material allocation problem is NP-hard in the strong sense. A lower bound and a heuristic are developed from a mixed integer linear formulation and its Lagrangean relaxation. The lower bound and the heuristics are closer to the optimum in cases where there is either abundant material or considerable competition for material; in intermediate cases, small perturbations in material allocation can have a significant effect. A group of heuristics based on the MRP approach and its modifications is examined; they are optimal under certain conditions. An improvement method that preserves priorities inherent in any given starting solution is also presented. The Lagrangean heuristic performs better than the MRP based heuristics for a set of 3900 small problems, yielding solutions that are about 5% to 10% over the optimal. The best MRP based heuristic does about as well as the Lagrangean heuristic on a set of 120 larger problems, and is 25% to 40% better than the standard MRP approach, on the data sets tested.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Afentakis, P., B. Gavish and U. Karmarkar, “Computationally Efficient Optimal Solutions to the Lot Sizing Problem in Multistage Assembly Systems”, Management Science, 30, 2 (1984), 222–239.
Billington, P. J., J. O. McClain and L. J. Thomas, “Mathematical Programming Approaches to Capacity Constrained MRP Systems: Review, Formulation and Problem Reduction”, Management Science, 29, 10 (1983), 1126–1141.
Bitran, G. R., E. A. Haas and A. C. Hax, “Hierarchical Production Planning: A Two-Stage System”. Operations Research, 30, 2 (1982), 232–251.
Dilworth, J. B., Operations Management: Design, Planning and Control for Manufacturing and Services, McGraw-Hill, (1993).
Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to NP-Completeness, Freeman, (1979).
Hackman, S. T. and R. C. Leachman, “A General Framework for Modelling Production”, Management Science, 35, 4 (1989), 478–495.
Held, M. and R. M. Karp, “A Dynamic Programming Approach to Sequencing Problems”, Journal of the Society for Industrial and Applied Mathematics, 10, 1 (1962), 196–210.
Karmarkar, U. S., “Hierarchical Decompositions of Closed Loop MRP System”, Working Paper, William E. Simon School of Business Administration, (1991).
Karmarkar, U. S. and R. S. Nambimadom, “Material Allocation in MRP with Tardiness Penalties”, Working Paper QM 91-06, William E. Simon School of Business Administration, (1991).
King, J. H., “Allocation of Scarce Resources in Manufacturing Facilities”, AT&T Technical Journal, 68, 3, 103–113.
Lawler, E. L., “On Scheduling problems with Deferral Costs”, Management Science, 11. 2 (1964), 280–288.
Luss, H. and D. R. Smith, “Resource Allocation Among Competing Activities: A Lexicographic Minimax Approach”, Operations Research Letters, 5, 5 (1986), 227–231.
Nemhauser, G. L. and L. A. Wolsey, Integer and Combinatorial Optimization, John Wiley, (1988).
Penlesky, R. J., W. L. Berry and U. Wemmerlov, “Open Order Due Date Maintenance in MRP Systems”, Management Science, 35, 5 (1989), 571–584.
Tang, C. S., “A Max-Min Allocation Problem: It's Solution and Applications”, Operations Research, 36, 2 (1988), 359–367.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Karmarkar, U.S., Nambimadom, R.S. Material allocation in MRP with tardiness penalties. J Glob Optim 9, 453–482 (1996). https://doi.org/10.1007/BF00121683
Issue Date:
DOI: https://doi.org/10.1007/BF00121683