A TECHNIQUE TO MINIMIZE OVERTIME IN THE CAPACITATED MRP PROBLEM

Since the development of early versions of material requirements planning (mrp) systems, it has been known that a weak link in this technique is the failure to consider the available capacity at the time the lot sizes for individual items are calculated. Ignoring the available capacity may result in infeasible production plans, i.e., those that can only be accomplished with the use of overtime. We present a technique to search for feasible production plans by means of minimizing the total overtime. The technique is based on modifying periodic-order-quantity (poq) lot sizes within a tabu search framework. Computational experiments with the largest problem structure reported in the literature show that the procedure is effective in determining lot sizes for individual items that either minimize or eliminate overtime. Additional experiments reveal that, with appropriate calibration of search parameters, the procedure is also able to deal with more general cost functions (e.g., those that include holding and setup costs).

[1]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[2]  Arthur V. Hill,et al.  An Experimental Analysis of Capacity‐Sensitive Setup Parameters for MRP Lot Sizing , 1988 .

[3]  L Van Wassenhove,et al.  Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem , 1985 .

[4]  Luk N. Van Wassenhove,et al.  Capacitated dynamic lotsizing heuristics for serial systems , 1991 .

[5]  Basheer M. Khumawala,et al.  MRP lot sizing with variable production/purchasing costs: formulation and solution , 1989 .

[6]  Larry P. Ritzman,et al.  A heuristic algorithm for capacity sensitive requirements planning , 1985 .

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

[8]  N. Adam,et al.  The Dynamic Lot-Sizing Problem for Multiple Items Under Limited Capacity , 1981 .

[9]  E. Silver,et al.  A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem , 1981 .

[10]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[11]  Marc Salomon,et al.  Statistical search methods for lotsizing problems , 1993, Ann. Oper. Res..

[12]  Terry Lunn,et al.  MRP : integrating material requirments planning and modern business , 1992 .

[13]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[14]  David L. Woodruff,et al.  SEQUENCING AND BATCHING FOR TWO CLASSES OF JOBS WITH DEADLINES AND SETUP TIMES , 1992 .

[15]  John H. Blackstone,et al.  The effects of lot sizing and dispatching on customer service in an MRP environment , 1993 .

[16]  Thomas E. Morton,et al.  A TUTORIAL ON BOTTLENECK DYNAMICS: A HEURISTIC SCHEDULING METHODOLOGY , 1995 .

[17]  F. Glover,et al.  Bandwidth packing: a tabu search approach , 1993 .

[18]  Joseph D. Blackburn,et al.  Improved heuristics for multistage requirements planning systems , 1982 .

[19]  Ronald L. Rardin,et al.  Tabu search for a class of scheduling problems , 1993, Ann. Oper. Res..

[20]  Éric D. Taillard,et al.  Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..

[21]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[22]  Manuel Laguna,et al.  Clustering for the design of SONET rings in interoffice telecommunications , 1994 .

[23]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[24]  L. V. Wassenhove,et al.  Multilevel capacitated lotsizing complexity and LP-based heuristics , 1991 .