MRP lot sizing with variable production/purchasing costs: formulation and solution

SUMMARY The research on lot sizing is extensive; however, no author in the literature reviewed to date provides an optimal solution algorithm to a prevalent problem which is found in manufacturing. A multi-level, general product-structure, variable-cost model is presented which follows the procedure of a closed-loop material requirements planning (MRP) system, and incorporates many conditions that production and material managers find in practice. A branch and bound (B&B7) algorithm is developed. The efficiency of B&B is derived from effective lower bounds and solution procedures which are determined on the basis of the space-time structure of the MRP lot-sizing problem and its non-convex total-cost function. This path-dependent lower bound is computationally efficient and guarantees an optimal solution. The B&B algorithm is tested on problems and compared to heuristics in the literature.

[1]  Edward A Silver,et al.  Coordinated replenishments of items under time‐varying demand: Dynamic programming formulation , 1979 .

[2]  H. Albert Napier,et al.  Optimal Multi-Level Lot Sizing for Requirements Planning Systems , 1980 .

[3]  Eric Latimer Prentis.  Optimal and heuristic multi-level lot sizing with extensions, in an MRP environment : branch and bound approach , 1984 .

[4]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

[5]  Basheer M. Khumawala,et al.  Multi-level lot sizing in material requirements planning: an empirical investigation , 1982, Comput. Oper. Res..

[6]  G. Nemhauser,et al.  Integer Programming , 2020 .

[7]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[8]  Oliver W. Wight,et al.  MRP II : unlocking America's productivity potential , 1981 .

[9]  U. Karmarkar,et al.  Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems , 1984 .

[10]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

[11]  Louis E. Yelle.  Materials requirements lot sizing: a multi-level approach , 1979 .

[12]  Basheer M. Khumawala,et al.  Efficient Heuristics for MRP Lot Sizing with Variable Production/Purchasing Costs* , 1989 .

[13]  Cheryl Gaimon,et al.  Optimal inventory, backlogging and machine loading in a serial, multi-stage, multi-period production environment , 1986 .

[14]  D. C. Whybark.  Evaluating Alternative Quantity Discounts , 1977 .

[15]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[16]  John O. McClain,et al.  Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction , 1983 .

[17]  Harish C. Bahl,et al.  An empirical investigation of different strategies for material requirements planning , 1983 .

[18]  N. Singh,et al.  Lot sizing for material requirements planning systems- an incremental cost approach , 1986 .

[19]  Robert E. Markland,et al.  Multi-stage lot sizing in a serial production system , 1986 .

[20]  Stephen F. Love.  A Facilities in Series Inventory Model with Nested Schedules , 1972 .

[21]  Graham K. Rand,et al.  Decision Systems for Inventory Management and Production Planning , 1979 .

[22]  M. H. Wagner,et al.  Dynamic Lot Size Models for Multi-Stage Assembly Systems , 1973 .

[23]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.