Solving large-scale requirements planning problems with component substitution options

This paper presents an approach for solving large-scale requirements planning problems with substitution options. The requirements planning with substitutions (RPS) problem, developed by Balakrishnan, A., & Geunes, J (2000) is defined as follows: consider a set of made-to-order products, each requiring at least one component for production. Every product has a preferred component for use in production, but can draw from a set of substitute components at a (per unit) substitution cost. Given the product demands over a finite horizon, determine the component production and substitution quantities in every period that minimize total component production, substitution, and holding costs. We show that under fixed plus linear (variable) production costs, this problem can be posed as an uncapacitated facility location problem, and extremely effective solution methods for this problem class can be employed to quickly solve RPS problems. Comparison of this (heuristic) approach with the (optimal) shortest path algorithm proposed by Balakrishnan, A.,& Geunes, J (2000) using a consistent test problem set shows that the facility location reformulation approach produced an optimal solution for every instance tested in a fraction of the time. We further demonstrate that the proposed approach has the potential to handle much larger problem instances than the shortest path algorithm.

[1]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[2]  B. M. Khumawala An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .

[3]  Gabriel R. Bitran,et al.  Co-Production Processes with Random Yields in the Semiconductor Industry , 1994, Oper. Res..

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

[5]  Stuart Brown,et al.  Process Planning for Aluminum Tubes: An Engineering-Operations Perspective , 1996, Oper. Res..

[6]  K. R. Baker,et al.  The Effect of Commonality on Safety Stock in a Simple Inventory Model , 1986 .

[7]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[8]  S. Kotha Mass Customization: The New Frontier in Business Competition , 1992 .

[9]  Kurt Spielberg,et al.  Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..

[10]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[11]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[12]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[13]  Wallace J. Hopp,et al.  Factory physics : foundations of manufacturing management , 1996 .

[14]  J. Krarup,et al.  Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .

[15]  P. Pardalos,et al.  Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems , 2000, Networks.

[16]  Joseph Geunes,et al.  Requirements Planning with Substitutions: Exploiting Bill-of-Materials Flexibility in Production Planning , 2000, Manuf. Serv. Oper. Manag..

[17]  D. Simchi-Levi Designing And Managing The Supply Chain , 2007 .

[18]  E. Ignall,et al.  Optimality of Myopic Inventory Policies for Several Substitute Products , 1969 .

[19]  Gabriel R. Bitran,et al.  Ordering Policies in an environment of Stochastic Yields and Substitutable Demands , 1992, Oper. Res..

[20]  E. Silver,et al.  Some Concepts For Inventory Control Under Substitutable Demand , 1978 .

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

[22]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[23]  Lawrence M. Wein,et al.  Dynamic scheduling of a production/inventory system with by-products and random yield , 1995 .

[24]  Ram Akella,et al.  Multiproduct Inventory Models with Substitution , 1992 .

[25]  T. L. Ray,et al.  A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[26]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[27]  M. Magazine,et al.  Component Commonality with Service Level Requirements , 1988 .