1. Field of the Invention
The present invention generally relates to supply chain management and product offering conditioning and, more particularly, to identifying alternative products or substituting components that can be provided to customers in reaction to supply imbalances.
2. Background Description
Supply-Demand conditioning is a decision process within the supply-demand planning process that monitors imbalances between supply and demand and recommends corrective actions before an imbalance becomes a threat to customer service. To resolve an imbalance situation, the decision maker needs to choose the appropriate corrective action. These actions fall into three categories:
The subject invention provides a method that finds product offering alternatives to better coordinate supply and sales, and developing optimal build plans that would best utilize component inventories. This method is most appropriate for use in an assembly environment. It would not only enable proactive coordination of supply and sales in terms of optimizing profit, but also help manage major product and technology transitions.
It is an exemplary object of the present invention to provide a computer-implemented method that obtains meta data from a variety of databases and other information sources that relate to but is not limited to existing product configurations, marketing and sales goals and revenue targets, and logistics and provisioning levels.
Another exemplary object of the invention is to identify possible alternative product offerings to manage supply side imbalances at a component or other logistical level.
It is still a further exemplary object to analyze business level as well as operational level thresholds to rate and select specific product configurations that maximize financial goals while minimizing asset liabilities.
It is another object of the invention to provide product configuration data to the various business level organizations and update the related databases to incorporate the conditioning information.
According to the invention, there is provided a computer-implemented methodology that assesses a myriad of business and operation level data to maximize revenues and other business goals while minimizing the liabilities associated with supply imbalances and other operational and tactical goals.
The foregoing and other objects, aspects and advantages will be better understood from the following detailed description of a preferred embodiment of the invention with reference to the drawings, in which:
Referring now to the drawings, and more particularly to
Once these data are obtained and classified, the Adaptive Product Configuration Model 102 analyzes the data and produces product configuration alternatives. These alternatives are rated based on strategic and tactical planning requirements and other business thresholds. The Adaptive Product Configuration Model 102 will then produce any one of several outputs. These outputs can be in the form of reports and/or automatic updates of source information databases. For example, a report could be provided to manufacturing 103 that contains detailed ‘build to’ product configuration data. Manufacturing 103 could use this data to construct the new recommended product configurations. Reports (either manual or automated) could also be provided to the marketing/sales 104 organizations to describe the new product configurations that would be available for sale. The sales/marketing 104 functions within the company could use the data to update sales and marketing plans and provide targeted promotions and sales incentives to sell the new product configurations. Another possible output would be to the logistics 105 function within the company. This data could also be either manual or electronic as in automatic database updating and would enable the logistics 105, distribution and other end provider organizations to reallocate supply to meet the new product configuration support and distribution requirements.
Referring now to
A schematic of the Adaptive Product Configuration Model is given in
For example, a component supplier is planning to transition from a 14″ XGA panel to a 15″ XGA panel and will no longer supply or support the 14″ XGA. To accelerate its customer' acceptance of 15″ XGA panels, the vendor has offered a computer manufacturing company a volume discount of such panels. The computer manufacturing company using the Adaptive Product Configuration Model would analyze their existing product configurations by assessing the inventory statements and applying the configuration rules to develop alternate configurations at step 320 using the discounted 15″ XGA.
The Adaptive Product Configuration Model would then compare and analyze the alternatives at step 330 to create a set of recommended product configurations. Step 330 would perform the analysis using various criteria selected from a group to include: maximizing revenue of said build plan; maximizing profitability of said build plan; minimizing liability costs for under-utilizing said inventory statement; minimizing penalty costs for violating desired customer services levels; minimizing penalty costs for deviating from sales plan of said set of existing product configurations; and maximizing a goodness value function of the product configuration.
The goodness value function is a means for rating the alternative product configurations. The goodness value function uses one or more of the following criterion to rank the proposed alternatives: profitability of said product configurations; competitive advantage gain of said product configuration; marketability of said product configurations; compatibility of said product configurations with said set of existing product configurations; and cannibalization of a new product configuration with said set of existing product configurations.
Step 340 would then develop build plans for the recommended configurations to include but not be limited to contractual agreements describing upside and downside volume flexibility of supply-committed component inventories; product substitution rules defining one or more alternative products for an existing end product; and upside demand potential relative to a top-level sales plan.
Finally, the product configuration database would be updated at step 340. These build plans could be distributed to various organizations within the company such as manufacturing, sales/marketing, and logistics and distribution as described previously relative to
To further illustrate the invention, the following describes a problem solved by the invention and contrasts it with the prior art. While the example refers to the planning and manufacturing of personal computers (PCs) the invention disclosed is not limited to PCs but would be understood by those skilled in the art to include any parts and/or components corresponding to any product build.
Consider the case of three PC product families, F1, F2 and F3, which might represent low-end, mid-range, and high-end portable computers. Each product family comprises one or more pre-defined product configurations, P1 to P10, as displayed in Table 1. The product configurations P1 to P4 belong to product family F1, P5 to P7 belong to family F2, and P8 to P10 belong to family F3. The table further indicates the bill-of-materials of each product configuration. For example, the assembly of product configuration P1 requires one unit of 14″ XGA panel, one unit of 20.0 GB hard drive, one unit of DVD optical drive, and one unit of wireless hardware WiFi B. The three product families differ by the size and type of panel used in their bill-of-materials: configurations in family F1 require a 14″ XGA panel, whereas configurations in family F2 require a 15″ XGA panel, and configurations in family F3 require a 15″ SXGA+ panel.
Next, it is assumed that the demand forecast is 1,000 units for each of the product configurations P1 to P10. (The demand forecast is a sales projection over a pre-defined planning horizon such as a week, month or quarter).
To determine the corresponding component supply, the top-level demand forecast is exploded through the bill-of-materials in a standard MRP-type calculation. Table 2 shows the component supply requirements pertaining to the top-level demand forecast. The supply requirements are passed along to component suppliers in a supply-demand collaboration process, and the manufacturing company requests a supply commitment to its supply requirements. The supply commitment indicates a supplier's capability to deliver to the manufacturer's supply requirements. The right-most column in Table 2 shows a sample supply commitment.
Comparing the supply requirements with the supply commitment indicates a supply constraint on the 14″ XGA panels. To mitigate the supply constraint, the panel supplier committed a higher than requested supply volume for the 15″ XGA panel, i.e., 8,000 units versus 3,000 units that were requested.
For this data, conventional Material Requirements Planning (MRP) systems and other support tools for helping companies decide what to build would match the supply to the proposed demand forecast and provide an optimized build plan. A build plan created by such a tool is displayed in Table 3. Notice that due to the limited supply of 14″ XGA panels the build plan results in 1,000 backorders for product configurations P1 and P4.
Table 4 displays the consumed and excess component supply that results from the build plan shown in Table 3.
For illustrative purposes, it can be assumed that the total cost of a build plan is the sum of a) the cost of unfilled demand (backorder costs) and b) the cost of unused component inventory (liability costs). If the backorder cost per unit of unfilled demand is $50 and the liability cost per unit of unused component inventory is $1, the above build plan generates a backorder cost of $100,000 and a liability cost of $13,800 as shown in Tables 3 and 4. The total cost of the build plan is thus $113,800.
It was observed that the above build plan results in excess supply of several key components, in particular 3,800 units of 15″ XGA panels and a total of 3,100 units between the 20.0 GB and 40.0 GB hard drives. In order to better utilize the excess supply, it might be desirable to build and sell a product configuration made up of a 15″ XGA panel and a 20.0 GB or 40.0 GB hard drive. However none of the original product configurations in Table 1 offer such a combination.
This observation helps establish a guideline for the new Adaptive Product Configuration Model. Based on business or technical design considerations, excess component inventory during the planning horizon can be handled by intelligently expanding the set of product configurations. The Adaptive Product Configuration Model described in this invention would determine new product configurations and the best possible build plan using various criteria as described on page 6.
For the above example, the Adaptive Product Configuration Model creates a set of three new product configurations, N1 to N3, shown in Table 5. All the components utilized in their bill-of-materials have excess supply.
With the so expanded set of product configurations P1 to P10 and N1 to N3, the Adaptive Product Configuration Model generates a new build plan as displayed in Table 6.
Table 7 displays the consumed and excess component supply that results from the build plan shown in Table 6.
Once again assuming that the backorder cost is $50 and the liability cost is $1, the build plan in Table 6 produces a backorder cost of $100,000 and inventory liability costs of $2,600. The total cost of the build plan generated by the invention is thus $102,600 which in this particular instance represents a 9.8% reduction of total costs and an 82.2% reduction of liability costs when compared to the conventional method.
In recapitulation, and as illustrated in the example above, the Adaptive Product Configuration Model begins with an initial set of product configurations; their demand forecasts and component supply commitments for a pre-determined planning horizon. Once a feasible production plan for the end products has been determined, it evaluates whether inventory liability costs can be reduced by introducing new product configurations. This process is iterative and might take into account one or more cost drivers as explained above.
The Adaptive Product Configuration Model involves solving a master optimization problem and a dual optimization problem in an iterative algorithm. The master problem develops an optimal build plan for a recommended set of configurations, including a set of original product configurations and zero or more new configurations. The dual problem determines the best new configuration to be added to the existing set such that an objective selected from a group of various criteria is optimized. The following provides an exemplary embodiment of the invention and describes a mathematical model involved in the Adaptive Product Configuration Model. It is assumed without loss of generality that the objective is to minimize the sum of liability costs and backorder costs. Those skilled in the art will recognize that the invention can be practiced with modification within and scope of the appended claims.
The following notation will be used to describe the model formulation and data:
I: set of components, indexed by i.
S: set of commodities, or component groups, indexed by s.
M: set of existing product configurations indexed by m.
N: set of recommended new configurations, indexed by n. The cardinality of this set will increase during the solution process.
r[i,m]: usage rate of component i in configuration m.
g[i,s]: relationship between component i and commodity s. g[i,s]=1 if component i belongs to commodity s; 0 otherwise.
Ch[i]: liability cost per unit of excess supply of component i.
Cb[m]: backorder cost per unit of product configuration m.
Co[m]: overproduction cost per unit of product configuration m.
Cp[n]: product release cost per unit of new configuration n.
Cs[m, m′]: cost of substituting product m′ to satisfy demand for product m.
d[m]: demand forecast for product configuration m.
b[m]: backorder quantity of product configuration m.
α: demand upside potential, or maximum percentage of overproduction.
w[i]: supply-committed inventory of component i.
wU[i],wL[i]: upper and lower bounds of supply-committed inventory of component i.
q[i]: on hand inventory of component i.
T[m,m′]: product substitution matrix; T[m,m′]=1 if product configuration m can be substituted by product configuration m′; 0 otherwise.
x[m,m′]: quantity of product m′ produced to satisfy demand for product m.
z[m]: amount of product m overproduced, i.e., the amount exceeding the demand forecast of product m.
rn[i, n]: usage rate of component i in new product configuration n; each column of this matrix represents a new configuration.
X[m]: build quantity of existing product configuration m.
Y[n]: build quantity of new product configuration n.
With the notation defined above, the master optimization problem is introduced as follows:
Master Problem
Subject to
The five summation terms in (1) are the costs for substitutions, the costs for backlogging demand, the costs for holding inventory, the costs for overproducing existing products, and the costs for producing new configurations, respectively. Constraint (2) ensures that the production quantity for an existing product configuration is always non-negative. Constraint (3) limits the total build quantity of all existing and new product configurations such that it does not exceed a certain tolerance (the demand upside potential) over and above the original demand forecast. Constraint (4) makes sure that the required quantity for a component does not exceed the available supply for this component. Constraints (5) and (6) represent contractual agreements describing upside and downside volume flexibility of supply-committed component inventories.
The master problem can be solved in various ways, including linear programming and heuristic techniques (e.g. local search techniques). After the master problem is solved, it is straightforward to obtain the dual variables from the solution directly. For this purpose, let it be the dual variable associated with constraint (3), and let λ[i] be the dual variable associated with constraint set (4).
Before the dual problem is defined, the following additional variables are introduced.
With the notation defined above, the dual optimization problem is introduced as follows.
Dual Problem
Subject to
Constraints (8) and (9) reflect the fact that a new product configuration must contain a squared set of components, meaning that its bill-of-materials must contain exactly one component i from each commodity group s (for example, one hard drive, one panel, etc.).
The dual problem is a 0-1 integer programming problem and can be solved by conventional integer programming tools as well as various heuristic techniques or artificial intelligence techniques. After the dual problem is solved, the optimized objective value (7) is evaluated. If it is negative, the new product configuration is added to the current set of configurations and the master problem (1) is solved over again. Otherwise the algorithm has reached optimality.
While the invention has been described in terms of a single preferred embodiment, those skilled in the art will recognize that the invention can be practiced with modification within the spirit and scope of the appended claims.
This application is a continuation application of U.S. patent application Ser. No. 12/052,440 filed Mar. 20, 2008 now U.S. Pat. No. 8,019,635 which itself is a continuation application of U.S. patent application Ser. No. 11/038,536 filed Jan. 21, 2005, now abandoned, and the complete contents of these application is herein incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5119307 | Blaha et al. | Jun 1992 | A |
5311424 | Mukherjee et al. | May 1994 | A |
5630070 | Dietrich et al. | May 1997 | A |
5960414 | Rand et al. | Sep 1999 | A |
6003012 | Nick | Dec 1999 | A |
6009406 | Nick | Dec 1999 | A |
6216109 | Zweben et al. | Apr 2001 | B1 |
6253187 | Fox | Jun 2001 | B1 |
6278978 | Andre et al. | Aug 2001 | B1 |
6574717 | Ngai et al. | Jun 2003 | B1 |
6681990 | Vogler et al. | Jan 2004 | B2 |
6843415 | Vogler | Jan 2005 | B2 |
6845909 | Bong et al. | Jan 2005 | B2 |
6850809 | Callar et al. | Feb 2005 | B1 |
6866195 | Knowles et al. | Mar 2005 | B2 |
6920427 | Anthony et al. | Jul 2005 | B2 |
7043321 | Ruml et al. | May 2006 | B2 |
7050953 | Chiang et al. | May 2006 | B2 |
7055741 | Bong et al. | Jun 2006 | B2 |
7058587 | Horne | Jun 2006 | B1 |
7072723 | Kohn et al. | Jul 2006 | B2 |
7117163 | Iyer et al. | Oct 2006 | B1 |
7171376 | Ramakrishnan | Jan 2007 | B2 |
7209869 | Kroger et al. | Apr 2007 | B1 |
7210624 | Birjandi et al. | May 2007 | B1 |
7231361 | Eck et al. | Jun 2007 | B2 |
7373371 | Eck et al. | May 2008 | B2 |
7664683 | Feldman et al. | Feb 2010 | B2 |
7778857 | Schierholt et al. | Aug 2010 | B2 |
20020065764 | Brodersen et al. | May 2002 | A1 |
20020095348 | Hiroshige et al. | Jul 2002 | A1 |
20020116281 | Costello et al. | Aug 2002 | A1 |
20020138316 | Katz et al. | Sep 2002 | A1 |
20020165782 | Falkenstein et al. | Nov 2002 | A1 |
20030061088 | Sarlay et al. | Mar 2003 | A1 |
20030105684 | Dunn et al. | Jun 2003 | A1 |
20030158769 | Uno et al. | Aug 2003 | A1 |
20040024628 | Eck et al. | Feb 2004 | A1 |
20040084526 | Knowles et al. | May 2004 | A1 |
20040084527 | Bong et al. | May 2004 | A1 |
20040158508 | Uehara et al. | Aug 2004 | A1 |
20050060270 | Ramakrishnan | Mar 2005 | A1 |
20050075949 | Uhrig et al. | Apr 2005 | A1 |
20050103842 | Bong et al. | May 2005 | A1 |
20050177467 | Wang et al. | Aug 2005 | A1 |
20060031084 | Schierholt et al. | Feb 2006 | A1 |
20060111874 | Curtis et al. | May 2006 | A1 |
20070100881 | McDonald et al. | May 2007 | A1 |
20070185760 | Birjandi et al. | Aug 2007 | A1 |
20070185786 | Ettl et al. | Aug 2007 | A1 |
20070282618 | Barahona et al. | Dec 2007 | A1 |
20080040185 | Birjandi et al. | Feb 2008 | A1 |
20090164285 | Hurtis et al. | Jun 2009 | A1 |
Number | Date | Country |
---|---|---|
2002328984 | Nov 2002 | JP |
2002328984 | Nov 2002 | JP |
WO 02091260 | Nov 2002 | WO |
WO 02091260 | Nov 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20110218890 A1 | Sep 2011 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12052440 | Mar 2008 | US |
Child | 13110304 | US | |
Parent | 11038536 | Jan 2005 | US |
Child | 12052440 | US |