Patent Grant
7996330
A. Field of the Invention
The present invention is directed to the field of pricing and specifically to the automated pricing of goods using markdown profiles and markdown budgets in order to reach sales quotas.
B. Background
Effective pricing of goods that are made available for sale is often a complicated task. In order to maximize profits, not only must revenue be optimized, but also the costs of inventory must be taken into account. One strategy used is to periodically reduce the price of the goods or services, effecting a markdown, in order to encourage sales of the goods or services. The amount of the markdown is often set by a sales agent who has had experience in the market for the goods or services and can, using his or her experience and intuition determine the timing and amount of markdowns.
In particular, the sale of seasonal goods poses a high financial risk for merchants. This risk is even more acute in the retail business. Each seasonal article can be assigned a specific sales period. When high-fashion and fashion articles are involved, the merchant wants to have as little remaining stock as possible at the end of the sales period, as it will be difficult to sell this merchandise even with markdowns. In this case, larger remaining stocks translate to higher losses. In addition to fashion articles, such as pink raincoats, this also applies to other goods, such as computer hardware.
For less “fashionable” products, the risk is lower because merchants can store any remaining stock and then try to sell it at the normal price again in the same season of the next year. Because storing inventories is expensive, however, merchants will generally prefer to sell their merchandise by the end of the regular sales period.
Merchants use markdowns to ensure that the merchandise is sold out as completely as possible by the end of a season. Markdowns are price reductions or buyer's incentives aimed at promoting the sale of certain articles. Of course, markdowns reduce the gross margin, which means the revenue merchants earn for selling the merchandise is less than originally planned. Merchants usually plan a certain budget for markdowns that must not be exceeded. Accordingly, markdowns are applied restrictively in retail, which once again increases the risk of remaining stocks at the end of the season.
Therefore, a goal in managing seasonal merchandise can be to limit markdowns to a minimum and apply them at the best suitable time, while ensuring that all or nearly all the merchandise is sold by the end of the season.
An embodiment of the present invention discloses a method, program product and system for controlling pricing using a markdown profile. The method includes: selecting a markdown profile to be used for the product or service, selecting a retail price for the product or service, acquiring updated sales data regarding the product or service, determining a markdown to be applied to the price from the markdown profile using updated sales data, and reconciling a markdown budget with the determined markdown to be applied to said price to determine whether the markdown will be applied. The method can further include the step of adjusting a retail price of the product or service by the markdown.
Other features and advantages of the present invention will become apparent to those skilled in the art from the following detailed description. It should be understood, however, that the detailed description and specific examples, while indicating preferred embodiments of the present invention, are given by way of illustration and not limitation. Many changes and modifications within the scope of the present invention may be made without departing from the spirit thereof, and the invention includes all such modifications.
The foregoing advantages and features of the invention will become apparent upon reference to the following detailed description and the accompanying drawings, of which:
As mentioned above, the primary goal in managing seasonal merchandise and services is to limit markdowns to a minimum and apply them at the best suitable time, while ensuring that nearly all the merchandise is sold by the end of the season. An advantageous tool or system is described herein that supports a pricing agent's work during the ongoing season, in one embodiment the retail season. The agent forms a correspondence between an article and markdown profile. This markdown profile contains time-specific target data for selling an article during its retail life cycle. The sales data of an article that sold well in the previous year, for example, could be used as the target sales quota in a markdown profile. The markdown profile is tied to a pricing strategy, which dictates specific price reductions when the actual sales data deviates from the target data. As a result, the system is capable of monitoring the sales data automatically and notifying the agent of any exceptions that occur. In addition, the system can propose certain markdowns in order to reach the planned sales figures. In this approach, the agent is relieved from a large portion of the activities he or she usually has to perform. Using the markdown profile, the agent can obtain proposed markdowns for a given product at periodic intervals over the life cycle of the sale of that product. The agent can choose to accept or reject the proposals, but it is envisioned that in most cases, the proposals will be accepted and the goal of ensuring that nearly all the merchandise is sold by the end of the season is achieved.
The structure of the markdown profile in the preferred embodiment of the invention is illustrated in
The target sales quotas are expressed as percentages in the markdown profile shown in
In the markdown profile, at the intersection of each actual sales quota range and each target sales quota corresponding to a posting period lies a cell which contains the proposed markdown. Cells in which no numbers appear indicate that no markdown is proposed. For cells in which numbers do appear, the number indicates the proposed markdown percentage. For example, assume that the markdown profile shown in
Thus, in the example described above, the system would indicate to the user that a markdown of 40 percent of the original retail price is proposed. The user can then accept or reject this proposal. In an alternate embodiment of the invention, the proposed markdown from the markdown profile is automatically implemented to adjust the retail price of the product. The user can override this automatic adjustment. The process is repeated at subsequent posting periods over the retail life cycle of the product.
While percentage markdowns are shown in the markdown profile illustrated in
It is important to note that the computer system on which the markdown profile is running and implemented has access to the data necessary to propose the markdown to the user. That is the system has access to the actual sales from the relevant store or stores for the relevant product or products during the relevant posting periods. It is envisioned that multiple markdown profiles would be provided to the user. These multiple profiles would correspond to different types of products or perhaps would be specific to individual products. The user could also create new profiles or revise existing profiles as desired.
In order to better control pricing for the sale of the retail product under the present invention using markdown profiles, a user would select a markdown profile to be used for the retail product at issue. The user would also select the initial retail price for that product and then as time progressed would adjust the retail price of that product by the markdown determined from the markdown profile as described above. This adjustment could happen multiple times over the life cycle of the product. The system can be programmed to perform the adjusting step at regular intervals such as at the end of each posting period. In this case it is envisioned that for a product selling well no mark-down may be necessary under certain posting periods.
Not shown in
As mentioned above, the user forms a correspondence between a product to be sold and a markdown profile. In the preferred embodiment of the invention, the user is provided with a plurality of markdown profiles from which to choose in order to select a markdown profile to be used for a particular product. These markdown profiles are prepared in advance of selection. Alternatively, the user can revise an existing markdown profile or even create an entirely new markdown profile to be used for the particular product. Further still, the automatic assignment of markdown profiles is envisioned.
In order to more efficiently search for potentially applicable and relevant markdown profiles, the markdown profile contains at least one and preferably three assignable attribute fields. These fields contain attribute data regarding a product or service. For example, the fields may contain indicators representing the product type (e.g., raincoats), the color, the size, the sales organization, and the distribution. Also, markdown profiles can be differentiated by the applicable sales season. Using the attribute field information, the user can search for the markdown profile that best suits the user's need for a particular product or service.
Different markdown profiles can address different reaction strategies and sales profiles. It is envisioned that at least three reaction strategies could be provided: aggressive, defensive and normal. Similarly, three sales profiles could be provided: linear, progressive and declining.
When selecting from among a plurality of markdown profiles, the user can toggle between them using a single action of a user-input device, such as a pressing a key on a keyboard. This single action would toggle between multiple markdown profiles. In the case of reaction strategies and sales profiles, the single action would toggle between the various versions of the markdown profile.
In forming the correspondence between products and markdown profiles, the user can assign a markdown profile to entire groups or categories of products. For example, one markdown profile can be assigned to all products of a particular type (e.g., raincoats). The user can also more finely correspond specific markdown profiles to sub-groupings of those products. For example, the user could assign a different markdown profile to red raincoats than is assigned to blue raincoats and different than is assigned to the larger category of all raincoats. Indeed, a markdown profile may be specifically tailored for a particular product of a particular color and size. In the preferred embodiment, if an individual product is not separately assigned a specific markdown profile, then the markdown profile for the relevant larger product category will be used for that product.
While, in
It is envisioned that a company will have in place limited budgets for applying markdowns to the retail prices of products. A company may not wish to allow its agent to markdown prices of products by significant amounts and for extended periods of time. Accordingly, they may put in place limited markdown budgets for a given product or for a given group of products. In the method of the present invention, when a markdown is proposed, this budget will be checked in order to prevent application of markdowns that will exceed the budgeted amount. In this way, some additional control is exerted over the agents and some additional safety measures are placed on the operation of the system.
The budgets for each product or group of products are tracked and maintained centrally, preferably in the same system that performs the markdown control. A “planned budget” refers to the budget for markdowns of a product for a particular period. An “exhausted budget” refers to the total amount of markdown that has been applied during the period. When a sale begins and during the course of the period, the “exhausted budget” increases. At the end of the period, the “exhausted budget” equals the total amount of the markdown applied on the product for that period, based on actual numbers of products sold. A “cumulative budget” refers to the budget amount remaining for a particular product from the previous period; that is, previous to the period corresponding to the planned budget. This cumulative budget may be a positive or a negative number. A negative number would indicate that the planned budget for the previous period had been exceeded.
The “available budget” is a calculated value determined by adding the “planned budget” to the “cumulative budget” carrying over from the previous period and subtracting from that the “exhausted budget” for the current period. This available budget corresponds to the amount of markdown that is still available to be applied.
In the present invention, before a proposed markdown is applied to adjust the retail price of a product, there is performed a reconciliation of the markdown budget based on the proposed markdown. This shown in step 245 in
If it is determined during the reconciliation step that a proposed markdown can indeed be applied to the retail price of a product the price is then adjusted based on the proposed markdown as shown in step 250. If it is determined during the reconciliation step that a proposed markdown cannot be applied to the retail price of a product then the proposed markdown is not applied to adjust the price of the product. In an alternate embodiment of the invention, the system would calculate the amount of markdown that could be applied while still complying with the predetermined rules regarding the available markdown budget. This allowable markdown could then be applied to adjust the retail price of the product.
In another embodiment of the invention, the proposed markdown is subject to approval or rejection by a user (not shown) and, in the case of rejection, the adjustment step 250 would not need to be performed. In any event, the method returns to acquiring updated sales data, so long as it is still within the product lifecycle, step 260. The frequency of acquiring updated sales data and determining a markdown can be adjusted by the user. In the preferred embodiment, it is performed once per posting period. Once the life cycle of product has been exhausted, it is assumed that the product will not be offered for sale until some later time, if at all, and the use of the markdown profile is ended in step 270.
“Article,” “seasonal good,” “product” and “retail product” are terms used herein to refer to the merchandise being sold, the pricing for which is controlled or affected by the markdown profile as used in the present invention. It is envisioned that the present invention will be applicable to the sale of any type of good or service. Articles can be arranged in hierarchies. Article hierarchies can include designations such as, fashion, which in turn includes groups of articles by store, by department, by division, by more detailed definition of the article, etc. For example, fashion can include groups of articles, including men's wear, ladies' wear, casual wear, beach wear, etc. Further, these articles can be arranged underneath a type of department for the store which is under the fashion category. In another embodiment, the groups of articles by store can include a list of types of articles, such as beach, casual, outdoor, etc. These article hierarchies can be arranged in tree form for viewing on a display.
Articles can be selected according to the designation discussed above. An identifier for each designation can be used to track other data about the designation including date ranges for the article's budgets, etc.
As noted above, embodiments within the scope of the present invention include program products comprising computer-readable media for carrying or having computer-executable instructions or data structures stored thereon. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer. By way of example, such computer-readable media can comprise RAM, ROM, EPROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store desired program code in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a computer, the computer properly views the connection as a computer-readable medium. Thus, any such connection is properly termed a computer-readable medium. Combinations of the above are also to be included within the scope of computer-readable media. Computer-executable instructions comprise, for example, instructions and data which cause a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions.
The invention is described in the general context of method steps, which may be implemented in one embodiment by a program product including computer-executable instructions, such as program code, executed by computers in networked environments. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer-executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps.
The present invention in some embodiments, may be operated in a networked environment using logical connections to one or more remote computers having processors. Logical connections may include a local area network (LAN) and a wide area network (WAN) that are presented here by way of example and not limitation. Such networking environments are commonplace in office-wide or enterprise-wide computer networks, intranets and the Internet. Those skilled in the art will appreciate that such network computing environments will typically encompass many types of computer system configurations, including personal computers, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. The invention may also be practiced in distributed computing environments where tasks are performed by local and remote processing devices that are linked (either by hardwired links, wireless links, or by a combination of hardwired or wireless links) through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
An exemplary system for implementing the overall system or portions of the invention might include a general purpose computing device in the form of a conventional computer, including a processing unit, a system memory, and a system bus that couples various system components including the system memory to the processing unit. The system memory may include read only memory (ROM) and random access memory (RAM). The computer may also include a magnetic hard disk drive for reading from and writing to a magnetic hard disk, a magnetic disk drive for reading from or writing to a removable magnetic disk, and an optical disk drive for reading from or writing to removable optical disk such as a CD-ROM or other optical media. The drives and their associated computer-readable media provide nonvolatile storage of computer-executable instructions, data structures, program modules and other data for the computer.
Software and web implementations of the present invention could be accomplished with standard programming techniques with rule based logic and other logic to accomplish the various database searching steps, correlation steps, comparison steps and decision steps. It should also be noted that the word “component” as used herein and in the claims is intended to encompass implementations using one or more lines of software code, and/or hardware implementations, and/or equipment for receiving manual inputs.
The foregoing description of embodiments of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the invention. The embodiments were chosen and described in order to explain the principals of the invention and its practical application to enable one skilled in the art to utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated.
This application claims the benefit of priority to U.S. Provisional Patent Application Ser. No. 60/551,221, filed on Mar. 8, 2004 and entitled “Inventory Management,” and U.S. Provisional Application No. 60/563,284, filed Apr. 16, 2004 and entitled “Inventory Management,” both of which are hereby incorporated by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5400253 | O'Connor | Mar 1995 | A |
| 5615109 | Eder | Mar 1997 | A |
| 5689696 | Gibbons et al. | Nov 1997 | A |
| 5930771 | Stapp | Jul 1999 | A |
| 5933813 | Teicher et al. | Aug 1999 | A |
| 6507851 | Fujiwara et al. | Jan 2003 | B1 |
| 6910017 | Woo et al. | Jun 2005 | B1 |
| 6976001 | Levanoni et al. | Dec 2005 | B1 |
| 6980966 | Sobrado et al. | Dec 2005 | B1 |
| 7080066 | Scheurich et al. | Jul 2006 | B1 |
| 7092402 | Smith et al. | Aug 2006 | B1 |
| 7092929 | Dvorak et al. | Aug 2006 | B1 |
| 7117165 | Adams et al. | Oct 2006 | B1 |
| 7130822 | Their et al. | Oct 2006 | B1 |
| 7139731 | Alvin | Nov 2006 | B1 |
| 7155402 | Dvorak | Dec 2006 | B1 |
| 7379890 | Myr et al. | May 2008 | B2 |
| 7424440 | Gupta et al. | Sep 2008 | B1 |
| 7516083 | Dvorak et al. | Apr 2009 | B1 |
| 20010032128 | Kepecs | Oct 2001 | A1 |
| 20010047308 | Kaminsky et al. | Nov 2001 | A1 |
| 20010049690 | McConnell et al. | Dec 2001 | A1 |
| 20020023500 | Chikuan et al. | Feb 2002 | A1 |
| 20020059108 | Okura et al. | May 2002 | A1 |
| 20020078159 | Petrogiannis et al. | Jun 2002 | A1 |
| 20020107713 | Hawkins | Aug 2002 | A1 |
| 20020123930 | Boyd et al. | Sep 2002 | A1 |
| 20020138336 | Bakes et al. | Sep 2002 | A1 |
| 20020147668 | Smith et al. | Oct 2002 | A1 |
| 20030023500 | Boies et al. | Jan 2003 | A1 |
| 20030028437 | Grant et al. | Feb 2003 | A1 |
| 20030046195 | Mao | Mar 2003 | A1 |
| 20030158791 | Gilberto et al. | Aug 2003 | A1 |
| 20030172007 | Helmolt et al. | Sep 2003 | A1 |
| 20030229502 | Woo | Dec 2003 | A1 |
| 20040034580 | Okamura | Feb 2004 | A1 |
| 20040098358 | Roediger | May 2004 | A1 |
| 20040162763 | Hoskin et al. | Aug 2004 | A1 |
| 20040186783 | Knight et al. | Sep 2004 | A1 |
| 20040199536 | Barnes Leon et al. | Oct 2004 | A1 |
| 20040220861 | Morciniec et al. | Nov 2004 | A1 |
| 20050055283 | Zarovinsky | Mar 2005 | A1 |
| 20050060270 | Ramakrishnan | Mar 2005 | A1 |
| 20050086122 | Cirulli et al. | Apr 2005 | A1 |
| 20050096963 | Myr et al. | May 2005 | A1 |
| 20050102192 | Gerrits et al. | May 2005 | A1 |
| 20050102227 | Solonchev | May 2005 | A1 |
| 20050165659 | Gruber | Jul 2005 | A1 |
| 20050197946 | Williams et al. | Sep 2005 | A1 |
| 20060036507 | Pujar et al. | Feb 2006 | A1 |
| 20070276537 | Walker et al. | Nov 2007 | A1 |
| Number | Date | Country |
|---|---|---|
| 2004-030343 | Jan 2004 | JP |
| Number | Date | Country | |
|---|---|---|---|
| 20050256753 A1 | Nov 2005 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60551221 | Mar 2004 | US | |
| 60563284 | Apr 2004 | US |
