The present invention relates to distribution centers for distributing inventory to customers. More particularly, the invention relates to load balancing in distribution centers.
Distribution centers are buildings or regions where inventory is stored and used to fulfill orders for customers. Customers place orders by various modes such as by telephone, mail, Internet browsers, and the like. The enterprise running the distribution center attempts to fulfill as many orders as possible in the shortest amount of time.
A distribution center's “throughput” is defined as the volume of inventory or number of orders fulfilled in a given unit of time. At least two parameters feature prominently in maximizing throughput: (a) useable inventory and (b) load balancing during order fulfillment. Usable inventory simply refers to the amount of inventory that is immediately available for order fulfillment. Obviously, if a distribution center has insufficient inventory to immediately fulfill all its orders, that distribution center cannot realize its potentially highest throughput. Load balancing refers to consistently using all order fulfillment mechanisms available for fulfilling orders. If any of these mechanisms sit idle, throughput drops off rapidly.
A given distribution center may have many order fulfillment mechanisms. In one example, the distribution center includes a conveyor belt that transports a container to various locations, each of which has an order fulfillment mechanism. One location may have a bank of carousels, each containing numerous bins. Each bin holds one or more types of inventory. The carousel moves into a position where items of inventory can be placed in the container on the conveyer belt. Another location may have a few aisles each containing multiple bins. A worker moves through the aisles to pick out requested items and place them in the container. Other types of order fulfillment mechanisms may be employed. The term “pod” will be used herein to describe any and all types of order fulfillment mechanisms. Each pod has one or more types of inventory available for “picking.” Picking refers to the operation of retrieving an item of inventory from a pod and placing it into a container. The container holds the various items that fulfill a given order.
Given that different customers have very different needs and preferences, different orders provide wide and rather unpredictable variation. Optimal load balancing to meet this variation presents a serious challenge. During a given week, for example, several grocery orders may require milk, but only a few of these require anchovies, a few others require spicy tofu, and still a few others require cotton swabs. In fulfilling these various orders, any one of these items could present a throughput bottleneck. Controlling the position and path of a container used to fulfill an order can partially address this problem. However, additional mitigation might result from intelligently distributing or arranging the inventory at specific locations within the distribution center.
The present invention fills a need for better ways to distribute inventory within a distribution center.
The present invention provides a load balancing technology that segregates various inventory types (e.g., potatoes vs. milk, vs. pretzels, vs. tissue paper, etc.). The inventory types are grouped based upon how frequently they are ordered in a distribution center. In a distribution center that distributes groceries, for example, certain staples such as milk are ordered very frequently. Other items such as cranberry sauce may be ordered very infrequently (except shortly before Thanksgiving). Still other items such as pretzels may be ordered with intermediate frequency.
In this invention, inventory types that are ordered at the slowest rate (e.g., cranberry sauce in the above example) are not “replicated” over multiple pods in the distribution center. Rather, they are constrained to reside at a single pod within the distribution center. Items that are ordered somewhat more frequently (e.g., pretzels) are replicated in multiple pods across the distribution center. In other words, these items are separately provided at locations on more than one pod in the distribution center. In a preferred embodiment, they are stored at all pods (or at least all pods of a particular type such as carousels) within the distribution center. This means that a container passing through the distribution center can obtain each of the items it needs from the second group at any particular pod in the distribution center. Thus, these items do not create a bottleneck in the order fulfillment process.
Inventory types in the third group, the fastest movers, may be segregated from items in the first two groups. Preferably they are stored in a separate type of pod that fulfills orders even faster than the other type of pods. In a preferred embodiment, inventory in the third group is stocked in a mechanical pod rather than in a carousel. In a specific embodiment, items in this third, fastest category of inventory are not replicated across multiple pods.
One aspect of the invention pertains to a method of distributing inventory to facilitate order throughput in a distribution center. The method may be characterized by the following sequence: (a) for each type of inventory to be distributed, determining how rapidly that type of inventory is consumed; (b) identifying a first group of inventory types that are relatively slower moving types of inventory and distributing the inventory types from this first group over multiple pods in the distribution center without replicating a given type in more than one pod; and (c) identifying a second group of inventory types that are relatively faster moving types of inventory and replicating inventory types from the second group at multiple pods. As mentioned, the inventory may be further classified into third group of inventory types that move faster than inventory types in the second group. Preferably, inventory types from this group are stocked in one or more high throughput pods.
Preferably, inventory types from the first group (the slowest movers) are randomly distributed over the multiple pods. In other words, a pod is randomly selected for a given inventory type in the first group. On the other hand, inventory types from the second group preferably are replicated over all pods in the distribution center. In a specific embodiment, the second group inventory types are distributed over all pods of a particular type such as carousels.
Various mechanisms may be employed to determine how rapidly inventory is consumed. For example, the distribution center may track how frequently the various inventory items are ordered. In a preferred embodiment, inventory items in the first group (the slow movers) are identified as those that are consumed at a rate of less than one bin's worth of inventory per unit time; a bin is a portion of a pod that holds only one inventory type. In a very specific example, inventory types that move at a rate of less than 10 bins per week are identified as belonging to the first group of inventory types.
Another aspect of this invention pertains to distribution centers having inventory arranged to facilitate order throughput. Such distribution centers may be characterized by the following group of features: (a) a conveyor for moving containers throughout the distribution center in a manner allowing items in the distribution center to be placed in the containers to fill orders; (b) a plurality of pods proximate the conveyor, each pod stocked with specified types of inventory for filling orders; (c) a first, slow moving, group inventory types (as described above) distributed over multiple pods and without replication; and (d) a second, faster moving, group of inventory types (as described above) replicated over multiple pods. The distribution center typically includes one or more computer controllers that direct the containers over specified paths within the distribution center and specify items to be placed in the containers.
The distribution center may include various types of pods including high throughput mechanical pods that include one or more aisles stocked with inventory and arranged to allow rapid picking. In a preferred embodiment, inventory types from a third, very rapidly moving, group are stocked in mechanical pods. Another common type of pod is the carousel, which can rotate into various positions and thereby make different items available for placement into the containers.
Another aspect of the invention pertains to computer program products including a machine-readable medium on which is provided program instructions for implementing one or more of the methods or computer user interfaces described herein. Any of the methods or interfaces of this invention may be represented as program instructions that can be provided on such computer readable media.
These and other features and advantages of the present invention will be described in more detail below with reference to the associated figures.
The following discussion presents some terms and concepts pertinent to the operation of a distribution center. The invention is not specifically limited to the examples described hereafter.
Totes are storage containers used to hold products for transportation to the consumer. There may be several different sizes of totes. Additionally, some totes may be designed for holding frozen and refrigerated goods. In some embodiments, the totes are relatively sturdy and have closable lids.
Each tote may have an identifier to support automated movement through the distribution center by conveyor. For example, each tote can have a bar code identifier that can be scanned as it moves past various points in the system. In this manner, a tote can be moved from a tote induction area to a specific pod or other location with the system tracking the location of the tote.
As indicated, a distribution center has a transport system such as a conveyor that moves totes and trays to pods and other locations within distribution center. “Trays” are used to transport new inventory from a receiving station in the distribution center to individual pods within the distribution center. Identifiers on the trays and totes allow them to be automatically routed to specific destinations within the distribution center. In a specific embodiment, conveyors from Buschmann Company, Cincinnati, Ohio, are used. In another specific embodiment, software from SeayCo Integrators, Conyers, Ga. automates conveyor movement.
Generally, a pod is a collection of storage areas (inventory locations or bins) within a distribution center. As mentioned, a single distribution center may have several types of pods. Each of the different pods and pod types may be adapted for different temperatures, e.g., frozen goods mechanized pod. The different pods and pod types may also be adapted for the rate of product movement, e.g., mechanized pods for fast moving items.
Carousel pods include one or more carousels adjacent to one or more conveyors. In one embodiment, each pod has three carousels adjacent to two conveyors for incoming trays and totes. In some embodiments, two additional conveyors are provided: an express conveyor and an empty conveyor. The express conveyor is used to transport totes directly from the carousel pod to the outbound distribution point for totes. The empty conveyor is used to transport empty trays back to the receiving area to receive new incoming products.
Generally, a carousel is a rotating high capacity storage area. Due to the rotating design of the carousels, only items stored in a small section of the carousel can be easily accessed at a given time. This trade-off allows the carousels to store large numbers of items at the expense of rapid access. One suitable carousel for use with this invention is available from Diamond Phoenix, Lewiston, Me.
Mechanized pods, or mechanical pods, are areas designed to hold the faster moving, and also bulkier and heavier, products for easy access. Each mechanized pod may have inbound and outbound conveyors. Received products may be placed directly into the mechanical pod for storing. Because the mechanical pod items may also be bulkier and heavier than other products, totes that include mechanical pod items may be sent to the mechanical pod prior to the other pods.
Manual pods are areas where “fill to order” items such as produce, bulk foods, pharmacy prescriptions, and/or prepared meals may be prepared and/or stored. The products in the manual pods are typically placed in totes last. Products in manual pods are customer specific preparations. Items are brought from fill to order preparation areas to the manual pods for placement (pick tasks) into totes.
A “pick task” is the retrieval of a product, or multiple quantities of the same product, to fill an order. Thus, an order for ten different products would be comprised of ten pick tasks. However, if the order included five bags of Brand X potato chips, that might be consolidated into a single pick task—depending on the number of bags of potato chips in the pod. For example, if pod two had only two bags of potato chips left and pod three had the last three bags of potato chips, two pick tasks would be required.
Carousel pick tasks may require the coordination of the conveyors to transport the tote to the appropriate pod with the carousels to bring the appropriate storage tray to an accessible position. The pick task may be scheduled, or generated, prior to the actual physical movement of the product, or products, from a carousel location to a tote. Once the pick task is accomplished, the conveyor may move the tote to the next destination automatically. In some embodiments, a push button signal is employed to allow the pick operator to signal that she/he has placed the product, or products, into the tote. Mechanized pick tasks can be accomplished by using carts to move totes received on the inbound conveyor to the products. The products can then be put into the totes for delivery. Once the necessary items are in the totes, the tote is placed on the outbound conveyors. The process for manual pick tasks may be similar to the mechanized pick task. The tote that arrives on the inbound conveyor is scanned. A list of locations with items for the tote is displayed. An operator retrieves the indicated items from the listed locations and then transfers the tote on the outbound conveyor.
A put-away task is the storage of a product in a pod. The product must be stored in a temperature appropriate pod. For example, dairy products must be stored at certain temperatures to avoid spoilage. In addition, depending on the type of product, one of the different types of pods will be selected.
The carousels are used to store items in trays. Once the products have been placed in trays, they can either be sent by conveyor for direct put away in the carousels or held on flow racks for later put away. The scheduling of the put away can be based on product shipments, available inventory, load, and other options.
Once the tray is received by conveyor at the carousel pod, audible and/or visual annunciators indicate the storage location for the tray. The carousel movements are coordinated with the conveyors so that the appropriate storage area of the carousel is available when the tray is to be stored. Weight planning can be used so that heavier trays are stored at or below waist level while lighter trays are stored at or above waist level in the carousel.
Each mech pod item has one or more fixed locations. For example, diet soda might be stored in at location A-1. Thus, when the put away operator received diet soda, she/he will scan it and be told to store it at A-1.
In the example depicted in
As mentioned, each different item of inventory is associated with a respective SKU. For reference, a “product” is a grouping of SKUs. Product information is higher level information that is pertinent to all SKUs in the grouping. It often defines a brand. A “category” is an even higher level classification based on how customers would expect products to be logically grouped. For example, the category “potato chips” may include the products “Brand X” potato chips and “Brand Y” potato chips. Further, the Brand X potato chip products may include a 16-ounce Brand X potato chips item (associated with a first SKU) and a 20-ounce Brand X potato chips item (associated with a second SKU).
While
In a preferred embodiment of this invention, inventory types are divided into two or more groups based upon where they reside on a velocity curve. As shown in the example of
This grouping is used to determine where individual inventory types are stocked within a distribution center. More specifically, methods of this invention select inventory types for specific pods based upon where the inventory types reside on a velocity curve.
In a preferred embodiment, items in the fastest moving group (Group 3 of
The very slow moving items are not replicated over multiple pods. Rather, for each item in this group, the methods of this invention randomly select a pod. In the example of
Those inventory types falling within the second group of a velocity curve are replicated across multiple pods in a distribution center. Thus, for example, items from SKUs 01 and 05 reside on multiple pods. In the specific example of
Typically, items from Groups 1 and 2 (the slow and medium speed groups) are constrained to reside only on carousels or other relatively slow moving pods. On the other hand, items from Group 3 (the fastest moving group) are allowed to reside in a very fast mechanical pod. Thus, in this embodiment, Groups 1 and 2 are distinguished from Group 3 based upon which type of pods they reside in. Groups 1 and 2 are distinguished from one another based upon whether they are replicated within their types of pod.
As suggested, however, the invention is not limited to these distinctions. For example, some distribution centers may have only a single pod type. In such cases, the important distinction will be drawn between Groups 1 and 2, where items in Group 1 are not replicated and items in Group 2 are replicated. Further, in distribution centers that contain two or more pod types, some items from Group 3 may reside on both pod types. Further, some items from Group 2 may reside on both pod types.
One reason to replicate some inventory items and not others is to balance the competing concerns of efficiently using available floor space and rapidly filling orders. Those items that are consumed relatively slowly, should not occupy floor space that could be more productively used to store faster moving items. Further, to fill orders rapidly, a tote should generally make as few stops as possible on its path through the distribution center.
Using the replication strategy of this invention, totes will generally require fewer stops to fill a given order. Stops will generally be determined by the slow moving items (Group 3) in a given order. For example, assume that an order requires milk, potatoes, an item from SKU 01, an item from SKU 04 and an item from SKU 05. Referring to
As mentioned, the process of grouping inventory types into two or more separate groups for determining replication and pod type relies on the use of a velocity curve. However, the line between inventory items in two adjacent groups need not always be sharp. Further, the location of these lines on the velocity curve may vary from distribution center to distribution center depending upon the types, numbers, and placement of pods within the distribution center.
In one embodiment, the fastest moving inventory types are provided in mechanical pods. Starting with the fastest movers and continuing down the velocity curve, each inventory type is provided in the mechanical pods until there is no more available space in the mechanical pods. Continuing down the velocity curve, the next item types are provided in slower pods and replicated across these pods. At some point on the velocity curve, inventory items are no longer replicated.
Drawing the line on the velocity curve between the replicated and non-replicated items can be somewhat arbitrary. In one embodiment, the volume of a bin within a pod is used to help make this determination. If the quantity of items consumed in a given time period requires less than a full bin, then that item is deemed to be a slow mover which will not be replicated. For example, consider an item that can fit three of itself in a single bin. Assume further that there are ten pods over which replicated items must be distributed. Then, one might determine that thirty units of the item must be consumed within a week (or other unit of time) in order to support replication. If the consumption rate of this item is less than thirty per week, then the item is deemed a slow mover and is not replicated. In a different example, consider an item, which can fit four of itself within a given bin. And, assume that there are five pods over which replicated items are distributed. In this case, the item would have to be consumed at a rate of at least 20 units per week (or other unit of time) in order to be replicated. If the item did not support this level of consumption, then it would not be replicated. This example suggests that the order frequency or consumption rate on the velocity curve may be measured in terms of (bins or slots of the inventory type) consumed per unit time. Of course, other measures of consumption rate may be employed to draw the line between replicated and non-replicated inventory types.
As described in U.S. patent application Ser. No. 09/568,603 previously incorporated by reference), a distribution center may include a system of conveyers, carousels, scanners, and hand-held computing units for automating both the order fulfillment (outbound) and inventory restocking (inbound) processes, which are managed by an computer implemented Order Fulfillment Subsystem of the distribution center.
One suitable outbound order fulfillment flow will now be depicted with reference to
Next, at 305, order allocation takes place. This typically involves matching an order with particular inventory stored in a distribution center and determining where that inventory is located. It may also involve decrementing inventory within the distribution center under the assumption that such inventory will be picked to fill the order. Still further, the allocation process may determine the number of totes needed to fulfill the order and design the path for each tote to follow while the order is being filled. This path will specify various pods at which the tote stops to have particular items picked to fill the order.
Next, at 307, a tote is inducted into the system and begins passing through the distribution center according to its pre-specified path. As it travels through the distribution center, it stops at various pods where a computer system provides instructions for pickers to pick selected items for the order. In a preferred embodiment, pickers place specified order items into the tote, and verify the order item fulfillment by scanning each item placed into the tote, as well as the tote's license plate ID, with a handheld computing device (e.g., RF gun). After the picker has confirmed placement of the specified items into the designated tote, the tote is then reintroduced to the automated tote transport system, where it continues to travel along its designated tote path. Information about the picked items is fed back to a central computer system which tracks order fulfillment and inventory. The tote is routed through various pod locations until the order is completed. See 309. The tote path may be dynamically and automatically altered if problems are detected in any portion of the DC operations.
After all items for a particular tote have been picked and confirmed, the tote is routed to a shipping spur at 311. At this point, the tote contains all inventory items that are required to fulfill its component of the order. A shipping component of the distribution center can now take over processing the order. At 313, workers or mechanical systems unload the tote onto dollies, which may include other totes intended for a specific delivery route. At 315, workers or mechanical systems load the dollies and totes onto trucks destined for specified locations. The trucks deliver orders to the customers who have placed orders. At this point, the order fulfillment process is completed. The distribution computer system may be notified of a shipment confirmation.
Frequently a distribution center is divided into multiple “ambiences,” which dictate special storage or handling. For example, many grocery items must be refrigerated. Such items are stocked in a refrigeration ambience. Wines and cigars can also be stocked ambiences having specific temperature and humidity controls. Other items may be deemed fragile therefore stocked or handled separately from other items. Each of these ambiences may have its individual items grouped by velocity and stocked according to the requirements of this invention. In one sense, each ambience may be viewed as a separate distribution center within a larger distribution center having multiple ambiences.
Like the outbound procedure depicted in
After obtaining the relevant order information, the system calculates the velocity of the various items for which order information has been obtained. See 505. In a preferred embodiment, the system makes this calculation for each item by summing the number of order lines for this item over a defined period of time. In order tables, orders are represented by product IDs, which are distinct for each SKU, and quantities. Each order line represents a particular SKU appearing on a customer order. For example, a customer order may specify three apples and ten oranges. Apples would form one order line and oranges would form a second order line. In this embodiment, the quantity of items associated with each order line is not factored into the velocity calculation. In an alternative embodiment, the quantity information is used to calculate velocity.
Preferably, the basic sampling interval chosen for calculating velocity accounts for any periodicity in the particular SKUs moving through the distribution center. For groceries, for example, one week accounts for most of the periodicity. Thus, in the case of a grocery warehouse, the number of order line occurrences would be calculated over one week sample intervals. To improve the accuracy of this calculation for slow moving SKUs, the basic sample interval may be increased selectively for such SKUs. In one implementation, the system determines whether the SKU has reached a threshold number of order lines within the basic sample interval. If such threshold is not met, the system then extends the sample interval over which the velocity is calculated.
After velocity has been calculated 505, the system ranks the SKUs based upon their calculated velocities. See 507. Typically the ranking will place the fastest movers at one end of a scale and the slowest movers at the other end of the scale. Next, the system categorizes the SKUs based upon their relative velocity rankings as well as certain other attributes. See 509. Among the other attributes that may be considered are ambience (already mentioned), conveyabilitly, fragility, and special handling considerations such as security for very valuable items and regulatory consideration for prescription drugs, for example.
Based upon velocity and one or more of these other attributes, the system next assigns putaway areas. See 511. Typically, a putaway area represents a collection of slots or bins within a particular pod. In one example, a single pod includes three separate carousels. Each such carousel is divided into multiple areas. And, each area contains a number of slots. Each slot is reserved for a specific SKU. In one example, an area might represent the middle three shelves of a particular carousel.
Note that when an item's velocity indicates that it should be replicated, the system takes account of this when assigning putaway areas at 511. In some instances, an item whose velocity is not sufficiently great to indicate forced replication, may be “opportunistically” replicated. This may occur when more instances of that item must be put away than can fit in a single slot. When this occurs, the system opportunistically replicates that item over multiple pods.
The system may account for numerous factors when identifying putaway slots. In addition to the velocity and other attributes and the possibility of opportunistic replication, the system may consider the location of existing inventory in assigning a putaway area. Using any or all of these criteria, the system preferably uses some probability information and possibly random number generation to assign putaway areas. Typically, as part of the operation at 511, the system also assigns multiple putaway areas that may be represented as a chain of putaway areas. The first member of the chain is the most preferable putaway area and subsequent members are less preferred areas.
With a proposed putaway area in hand, the system next attempts to put the current SKU in a slot within the assigned putaway area. See 513. In some instances, this will not be possible because all slots in the area are taken. Thus, the system determines, at 515, whether a suitable slot has been located. If not, process control returns to 511 where the system next assigns a different putaway area. In the embodiment just described, this next putaway area will be the next successive putaway area provided in a chain of putaway areas. Eventually, the system will find an appropriate slot within one of the assigned putaway areas. When this occurs, the system determines whether there are any more SKUs to be processed at 517. If so, it assigns one or more proposed putaway areas at 511. If not, the process is completed.
In a preferred embodiment, warehouse management system 527 includes a database 528 containing logical tables providing order information organized as order lines for example. Preferably, the velocity estimator 529 queries warehouse management system 527 to obtain order line information. Velocity estimator 529 then uses such order line information to calculate velocity as indicated at 505 in
Putaway planner 523 categorizes specific SKUs based upon SKU velocity data from velocity estimator 529 and other SKU attributes from warehouse management system 527. Based on this information, putaway planner 533 assigns putaway areas. As mentioned in the discussion of operation 511, the putaway planner may generate a chain of proposed putaway areas. It provides one or more of these putaway areas to the warehouse management system 527. The warehouse management system then attempts to slot a particular SKU in the area identified. If it cannot accomplish this, it notifies putaway planner 533. Putaway planner 533 then provides a different proposed putaway area to warehouse management system 527. When warehouse management system 527 finds an appropriate slot within the proposed area, it generates a putaway task containing instructions for another module within the distribution center to put inventory at assigned slots. In one example such other module is an automated material handling controller. Warehouse management system 527 may use the putaway information to update inventory information in its database 528.
This invention is preferably implemented as software stored or transmitted on a machine-readable medium and executed on a processor. The invention may also be implemented on firmware provided with a processor for executing instructions specified by the firmware. In an alternative embodiment, the invention is implemented on specially designed or configured processing hardware.
Because program instructions and data may be employed to implement the systems/methods described herein, the present invention relates to machine-readable media that include program instructions, velocity data, etc. for performing various operations described herein (e.g., grouping inventory items based on their location on a velocity curve and logically distributing those items in put away regions of a distribution center). Examples of machine-readable media include, but are not limited to, magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROM disks; magneto-optical media; and hardware devices that are specially configured to store and perform program instructions, such as read-only memory devices (ROM) and random access memory (RAM). The invention may also be embodied in a carrier wave travelling over an appropriate medium such as airwaves, optical lines, electric lines, etc. Examples of program instructions include both machine code, such as produced by a compiler, and files containing higher level code that may be executed by the computer using an interpreter.
Although certain preferred embodiments of this invention have been described in detail herein with reference to the accompanying drawings, it is to be understood that the invention is not limited to these precise embodiments, and at various changes and modifications may be effected therein by one skilled in the art without departing from the scope of spirit of the invention as defined in the appended claims.
This application claims priority under 35 U.S.C. 119(e) from U.S. Provisional Patent Application No. 60/133,646 filed on May 11, 1999, naming L. Borders, G. Dahl, et al. as inventors and titled “ELECTRONIC COMMERCE ENABLED DELIVERY SYSTEM AND METHOD.” That application is incorporated herein by reference for all purposes. This application is also related to U.S. patent application Ser. No. 09/568,603, titled “INTEGRATED SYSTEM FOR ORDERING, FULFILLMENT, AND DELIVERY OF CONSUMER PRODUCTS USING A DATA NETWORK,” naming Borders et al. as inventors, to U.S. patent application Ser. No. 09/568,569, now U.S. Pat. No. 6,622,127, titled “ORDER ALLOCATION TO SELECT FROM INVENTORY LOCATIONS STOCKING FEW UNITS OF INVENTORY,” naming Klots et al. as inventors, and to U.S. patent application Ser. No. 09/568,571, titled “ORDER ALLOCATION TO MINIMIZE CONTAINER STOPS IN A DISTRIBUTION CENTER,” naming Waddington et al. as inventors, all filed on the same day as the instant application. Each of the above-referenced US Patent Applications is incorporated herein by reference for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
2781643 | Fairweather | Feb 1957 | A |
3406532 | Rownd et al. | Oct 1968 | A |
3670867 | Traube | Jun 1972 | A |
4213310 | Buss | Jul 1980 | A |
4455453 | Parasekvakos et al. | Jun 1984 | A |
4656591 | Goldberg | Apr 1987 | A |
4799156 | Shavit et al. | Jan 1989 | A |
4887208 | Schneider et al. | Dec 1989 | A |
4936738 | Brennan et al. | Jun 1990 | A |
5038283 | Caveney | Aug 1991 | A |
5093794 | Howie et al. | Mar 1992 | A |
5105627 | Kurita | Apr 1992 | A |
5113349 | Nakamura et al. | May 1992 | A |
5122959 | Nathanson et al. | Jun 1992 | A |
5235819 | Bruce | Aug 1993 | A |
5237158 | Kern et al. | Aug 1993 | A |
5246332 | Bernard | Sep 1993 | A |
5265006 | Asthana | Nov 1993 | A |
5272638 | Martin et al. | Dec 1993 | A |
5273392 | Bernard | Dec 1993 | A |
5322406 | Pippin et al. | Jun 1994 | A |
5363310 | Haj-Ali-Ahmadi et al. | Nov 1994 | A |
5395206 | Cerny, Jr. | Mar 1995 | A |
5428546 | Shah et al. | Jun 1995 | A |
5533361 | Halpern | Jul 1996 | A |
5548518 | Dietrich et al. | Aug 1996 | A |
5568393 | Ando et al. | Oct 1996 | A |
5593269 | Bernard | Jan 1997 | A |
5615121 | Babayev et al. | Mar 1997 | A |
5664110 | Green et al. | Sep 1997 | A |
5666493 | Wojcik et al. | Sep 1997 | A |
5694551 | Doyle et al. | Dec 1997 | A |
5712989 | Johnson et al. | Jan 1998 | A |
5758313 | Shah et al. | May 1998 | A |
5758328 | Giovannoli | May 1998 | A |
5761673 | Bookman et al. | Jun 1998 | A |
5768139 | Pippin et al. | Jun 1998 | A |
H1743 | Graves et al. | Aug 1998 | H |
5809479 | Martin et al. | Sep 1998 | A |
5826242 | Montulli | Oct 1998 | A |
5826825 | Gabriet | Oct 1998 | A |
5831860 | Foladare et al. | Nov 1998 | A |
5832457 | Cherney | Nov 1998 | A |
5834753 | Danielson et al. | Nov 1998 | A |
5835914 | Brim | Nov 1998 | A |
5839117 | Cameron et al. | Nov 1998 | A |
5848395 | Edgar et al. | Dec 1998 | A |
5878401 | Joseph | Mar 1999 | A |
5880443 | McDonald et al. | Mar 1999 | A |
5893076 | Hafner et al. | Apr 1999 | A |
5894554 | Lowery et al. | Apr 1999 | A |
5897622 | Blinn et al. | Apr 1999 | A |
5897629 | Shinagawa et al. | Apr 1999 | A |
5899088 | Purdum | May 1999 | A |
5910896 | Hahn-Carlson | Jun 1999 | A |
5918213 | Bernard et al. | Jun 1999 | A |
5943652 | Sisley et al. | Aug 1999 | A |
5943841 | Wunscher | Aug 1999 | A |
5956709 | Xue | Sep 1999 | A |
5961601 | Iyengar | Oct 1999 | A |
5963919 | Brinkley et al. | Oct 1999 | A |
5979757 | Tracy et al. | Nov 1999 | A |
6023683 | Johnson et al. | Feb 2000 | A |
6026378 | Onozaki | Feb 2000 | A |
6061607 | Bradley | May 2000 | A |
6070147 | Harms et al. | May 2000 | A |
6073108 | Peterson | Jun 2000 | A |
6081789 | Purcell | Jun 2000 | A |
6083279 | Cuomo et al. | Jul 2000 | A |
6085170 | Tsukuda | Jul 2000 | A |
6101481 | Miller | Aug 2000 | A |
6101486 | Roberts et al. | Aug 2000 | A |
6140922 | Kakou | Oct 2000 | A |
6178510 | O'Connor et al. | Jan 2001 | B1 |
6182053 | Rauber et al. | Jan 2001 | B1 |
6185625 | Tso et al. | Feb 2001 | B1 |
6215952 | Yoshio et al. | Apr 2001 | B1 |
6233543 | Butts et al. | May 2001 | B1 |
6249801 | Zisapel et al. | Jun 2001 | B1 |
6260024 | Shkedy | Jul 2001 | B1 |
6275812 | Haq et al. | Aug 2001 | B1 |
6289260 | Bradley et al. | Sep 2001 | B1 |
6289370 | Panarello et al. | Sep 2001 | B1 |
6292784 | Martin et al. | Sep 2001 | B1 |
6324520 | Walker et al. | Nov 2001 | B1 |
6332334 | Faryabi | Dec 2001 | B1 |
6341269 | Dulaney et al. | Jan 2002 | B1 |
6343275 | Wong | Jan 2002 | B1 |
6397246 | Wolfe | May 2002 | B1 |
6405173 | Honarvar et al. | Jun 2002 | B1 |
6424947 | Tsuria et al. | Jul 2002 | B1 |
6445976 | Ostro | Sep 2002 | B1 |
6453306 | Quelene | Sep 2002 | B1 |
6463345 | Peachey-Kountz et al. | Oct 2002 | B1 |
6463420 | Guidice et al. | Oct 2002 | B1 |
6490567 | Gregory | Dec 2002 | B1 |
6496205 | White et al. | Dec 2002 | B1 |
6505093 | Thatcher et al. | Jan 2003 | B1 |
6505171 | Cohen et al. | Jan 2003 | B1 |
6526392 | Dietrich et al. | Feb 2003 | B1 |
6530518 | Krichilsky et al. | Mar 2003 | B1 |
6549891 | Rauber et al. | Apr 2003 | B1 |
6567786 | Bibelnieks et al. | May 2003 | B1 |
6571213 | Altendahl et al. | May 2003 | B1 |
6578005 | Lesaint et al. | Jun 2003 | B1 |
6598027 | Breen, Jr. | Jul 2003 | B1 |
6622127 | Klots et al. | Sep 2003 | B1 |
6654726 | Hanzek | Nov 2003 | B1 |
6697964 | Dodrill et al. | Feb 2004 | B1 |
6741995 | Chen et al. | May 2004 | B1 |
6748418 | Yoshida et al. | Jun 2004 | B1 |
6763496 | Hennings et al. | Jul 2004 | B1 |
6862572 | de Sylva | Mar 2005 | B1 |
6879965 | Fung et al. | Apr 2005 | B2 |
6970837 | Walker et al. | Nov 2005 | B1 |
6990460 | Parkinson | Jan 2006 | B2 |
20010037229 | Jacobs et al. | Nov 2001 | A1 |
20010042021 | Matsuo et al. | Nov 2001 | A1 |
20010047285 | Borders et al. | Nov 2001 | A1 |
20010047310 | Russell | Nov 2001 | A1 |
20010049619 | Powell et al. | Dec 2001 | A1 |
20010049672 | Moore | Dec 2001 | A1 |
20020004766 | White | Jan 2002 | A1 |
20020007299 | Florence | Jan 2002 | A1 |
20020013950 | Tomsen | Jan 2002 | A1 |
20020038224 | Bhadra | Mar 2002 | A1 |
20020049853 | Chu et al. | Apr 2002 | A1 |
20020065700 | Powell et al. | May 2002 | A1 |
20020188530 | Wojcik et al. | Dec 2002 | A1 |
20020194087 | Spiegel et al. | Dec 2002 | A1 |
20030045340 | Roberts | Mar 2003 | A1 |
20030079227 | Knowles et al. | Apr 2003 | A1 |
20030233190 | Jones | Dec 2003 | A1 |
20040236635 | Publicover | Nov 2004 | A1 |
20050027580 | Crici et al. | Feb 2005 | A1 |
20050144641 | Lewis | Jun 2005 | A1 |
Number | Date | Country |
---|---|---|
2 696 722 | Apr 1994 | FR |
2 265 032 | Sep 1993 | GB |
WO9907121 | Feb 1999 | WO |
Number | Date | Country | |
---|---|---|---|
60133646 | May 1999 | US |