System and method for optimization of group shipments to reduce shipping costs

Information

  • Patent Grant
  • 7937330
  • Patent Number
    7,937,330
  • Date Filed
    Thursday, January 15, 2009
    15 years ago
  • Date Issued
    Tuesday, May 3, 2011
    13 years ago
Abstract
Described herein is a method and system to provide optimizing shipping costs that can help arbitrate between a precise solution at an unreasonable cost and a reasonable solution at a very reasonable cost. In one embodiment, a first shipping option is generated to deliver shipments to a first sub-set of recipients within a first time period, and to deliver shipments to a second sub-set of recipients within a second time period that is greater than the first time period, with the shipments to the second sub-set of recipients being a greater distance than shipments to the first sub-set of recipients. The first shipping option provides a cost of shipping savings relative to shipping to all of the recipients within the first time period. The generating of the first shipping option includes selecting the second sub-set of recipients to include a quantity of recipients to provide a cost of shipping savings equal or greater to a predetermined percentage.
Description
BACKGROUND OF THE INVENTION

Companies often mail identical packages, such as marketing collateral, CDs, or company information to a group of people (prospects, customers or employees). The company typically ships all these packages on the same day. In some cases, the company wants all the recipients to receive the shipments by a certain date. The recipients normally live different distances from the shipping point. To achieve the targeted delivery date, the company typically ships by the shipping method that has the least risk of missing the delivery date for the farthest recipient.


Sometimes, a handful of recipients may be classified as “outliers,” i.e., they live a lot farther away than most other recipients. In these cases, the company loses money because it chooses an expensive shipping method so the farthest recipient gets the package on time. It would be cheaper if the company were to choose a slightly longer shipment method (for example, three-day instead of two-day delivery). Then the outliers would receive the shipment one day late, but the remaining recipients would receive the shipment on time. What is clearly needed is a system and method for optimizing shipping costs that can help arbitrate between a perfect solution at an unreasonable cost and a reasonable solution at a very reasonable cost.


SUMMARY OF THE INVENTION

Described herein is a method and system to provide optimizing shipping costs that can help arbitrate between a precise solution at an unreasonable cost and a reasonable solution at a very reasonable cost. In one embodiment, a method is provided to receive data related to delivering shipments to a set of recipients at separate addresses. A first shipping option is generated to deliver shipments to a first sub-set of the recipients within a first time period, and to deliver shipments to a second sub-set of recipients within a second time period that is greater than the first time period, with the shipments to the second sub-set of recipients being a greater distance than shipments to the first sub-set of recipients. The first shipping option provides a cost of shipping savings relative to shipping to all of the recipients within the first time period, wherein the generating of the first shipping option comprises selecting the second sub-set of recipients to include a quantity of recipients to provide a cost of shipping savings equal or greater to a predetermined percentage. The first shipping option is presented in a user interface to a user for selection.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows an outline map of the United States, as an example of a shipping area with a shipping location.



FIG. 2 shows a table that organizes the recipients by zones.



FIG. 3 shows a pop-up window that would appear during the preparation of a shipment on a user screen.



FIG. 4 shows an example process according to one embodiment of the processes used to create a pop-up window.



FIG. 5 describes in detail the process for generating shipping options according to one embodiment.





DETAILED DESCRIPTION OF THE INVENTION

In the following detailed description of embodiments of the invention, reference is made to the accompanying drawings in which like references indicate similar elements, and in which is shown by way of illustration specific embodiments in which the invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention, and it is to be understood that other embodiments may be utilized and that logical, mechanical, electrical, functional, and other changes may be made without departing from the scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present invention is defined only by the appended claims.


According to the novel art of this disclosure, all recipient addresses are stored in the disclosed shipping system. The administrator of said disclosed optimizer system may set up parameters indicating how many or what percent of the recipient population may be considered as outliers. The administrator may also set up parameters determining whether an optimizer may be run for certain types of shipments (for example, time-sensitive legal material would be excluded).


When the company plans a group shipment in the system, the shipment cost optimizer would determine the best shipment method (e.g., two-day or three-day) for shipping all the packages. The optimizer may also determine outliers that, when excluded, would provide lower overall shipping costs even if such a determination means delaying shipments to a couple of recipients. The system would then prompt the user with some options for reducing costs, and the user could choose to benefit from the options.


As an example, if a company is shipping packages to 100 recipients, out of which 98 live in the neighboring states and two live four states away, the optimizer would calculate the costs and can show the following message to the user: “Two of the 100 users are outliers. If they receive the package one day late, you can save $300. You can use two-day shipping for all 98 recipients and choose three-day shipping for recipient <name 1> and ground shipping for recipient <name 2>.” The user could then select one of the options or ignore the message. If the user decided to follow the optimizer's recommendations, he would exclude the two recipients from the bulk mailing, ship to the two recipients separately, and save $300.



FIG. 1 shows an outline map 100 of the United States, as an example of a shipping area with shipping location S 101. Most recipients R 1−n 102 in this example are in Shipping Zone 1110. Some recipients R n+1−m are in Zone 2111. One recipient R m+1 104 is in Zone 3112.



FIG. 2 shows a table 200 that organizes the recipients by zones. For example, the recipient ID is shown in column 201, and although here, for example, the ID is shown as a name, it is clear that said ID may consist of a numeric code or any of a variety of alphanumeric, symbolic, or other unique identifiers. Column 202 shows the distance from the shipping location to each recipient, and column 203 shows the zone assignment for each recipient, based on the shipping location and the recipient address. In this exemplary table the recipients are shown as being divided into two groups, 210 and 211. Group 210 contains the majority of recipients, corresponding to recipient group 102 in FIG. 1. Recipients in this group would receive packages from shipping location 101 essentially overnight, even when packages are shipped by ground freight; whereas group 211 comprises recipients who would receive packages shipped by ground freight from shipping location 101 in two days.



FIG. 3 shows a pop-up window 310 that would appear during the preparation of a shipment on user screen 301. Window 302 is where the user enters the selected recipients and window 303 is where the user enters information for the type of campaign, including type, number, weight and size of items to be shipped, etc. In one embodiment, when the system analyzes these entries accordingly, window 310 then provides various shipping options 311 a-n from which the user may choose.


In some cases, rich attributes may be added to the group, or to a set or sub-set of group members. For example, it would allow defining for each individual recipient, or for subgroups of the recipient's specific types or modes. These attributes could include business attributes such as the relative importance of each recipient. In addition, some recipients may be part of the organization (for example field offices, sales people, field technicians etc.) and some may be externals, such as associates, partners, customers etc. Those recipients external to the shipping organization might or sometimes should receive higher priority than those internal to the shipping organization. These attributes may also include specific service levels required in the shipping, including such items as tracking, delivery confirmation, insurance, and other such attributes. These business and shipping attributes could be combined for a given sub-group. For example, for external recipients, tracking is required, but it is not required for internal recipients. These attributes would be considered by the optimization engine as it determines the optimal carrier and service level for each recipient.



FIG. 4 shows an example process 400 according to one embodiment used to create pop-up window 310. Once the group shipment is selected in process 401, the group members are then selected in process 402. In process 403, details of the items to be shipped are specified, by such means, for example, as by giving the weight and dimensions of an item, or by selecting it from a list of standard items available for shipment or campaign, or entering weight, dimensions, etc. In process 404, the desired date of delivery is entered, and in process 405, the date the items will be available for shipment from shipping location 101 is entered. This date of availability may vary according to whether the item is in stock, or has to be brought in, or manufactured or assembled, etc., because said items may require delivery from the manufacturer, or they may need to be assembled or manufactured, and this information comes from the system that is used to obtain the items to be shipped. The information may be entered into the shipping optimization system automatically from an ERP or MRP system, or it may be entered manually. In process 406, the shipping location is specified, again either manually entered or entered automatically, based on the item, its manufacturer, assembly information, etc. In process 407, the shipping options are calculated, and in process 408, the user selects the preferred shipping option(s) from window 310, as described above. In process 409, the shipment is executed, which means, for example, that labels are prepared, bookings are made with shippers, and, if necessary, instructions are transmitted to the warehouse, assembly house, or other agency, to ensure that the correct items are shipped.



FIG. 5 describes in detail the method for generating shipping options 407 according to one embodiment. In process 501 all data that has been previously collected in preparation for this process is obtained from a data repository (not shown). In process 502, the system sorts addresses by distance and delivery time. These sorts may differ from carrier to carrier, because the various carriers may have different boundaries for their shipping zones. As a result, this process may need to be repeated any number of times, with different variables, such as shipping mode (ground, overnight, etc.) and specific carrier. In some cases, the information needed for carrier quotes may be available in local repository 503 and may be acquired directly by access route 504. This information may be in local storage or it may be part of the overall system as described above. In other cases, a direct inquiry may be sent over networking connection 506 to one or more carriers 505. This exemplary figure shows only one carrier, for clarity and simplicity, however it is clear that carriers 505 may comprise a large body of carriers. This inquiry may be sent directly by the system according to one embodiment, or in other cases it may be sent via the Services Platform. According to the multitude of results collected by the system, the system now performs a percentile analysis in process 507. This analysis relies on certain rules that have previously been entered into rules repository 508. A cost curve 509, with cost on the y-axis and percentage of timely delivery on the x-axis, shows the cost rising as a 100 percent shipping solution is achieved. Cut-off point 510 could be, for example, 98 percent. Two or three different methods of shipping may be used. One method is that some recipients would receive late delivery. Another method could be that only for a selected few, a more expensive overnight delivery would be used, but for the remainder, standard ground delivery would be selected, resulting in overnight delivery in the zone nearest the shipping point, or second-day air for those recipients farther away, etc. Out of the multitude of resulting possibilities, in process 511 the three to five most relevant options are presented. The factors deciding relevance would be the lowest cost, the most accurate and on-time delivery, and maybe one or two options nearby to each of those. Those options are then delivered back to process 400, which then displays them to the user.


The processes described above can be stored in a memory of a computer system as a set of instructions to be executed. In addition, the instructions to perform the processes described above could alternatively be stored on other forms of machine-readable media, including magnetic and optical disks. For example, the processes described could be stored on machine-readable media, such as magnetic disks or optical disks, which are accessible via a disk drive (or computer-readable medium drive). Further, the instructions can be downloaded into a computing device over a data network in a form of compiled and linked version. Alternatively, the logic to perform the processes as discussed above could be implemented in additional computer and/or machine readable media, such as discrete hardware components such as large-scale integrated circuits (LSIs) and application specific integrated circuits (ASICs); firmware such as electrically erasable programmable read-only memory (EEPROMs); and electrical, optical, acoustical and other forms of propagated signals (e.g., carrier waves, infrared signals, digital signals); etc.


Whereas many alterations and modifications of the present invention will no doubt become apparent to a person of ordinary skill in the art after having read the foregoing description, it is to be understood that any particular embodiment shown and described by way of illustration is in no way intended to be considered limiting. Therefore, references to details of various embodiments are not intended to limit the scope of the claims which in themselves recite only those features regarded as essential to the invention.


It is clear that many modifications and variations of this embodiment may be made by one skilled in the art without departing from the spirit of the novel art of this disclosure.

Claims
  • 1. A method comprising: receiving data related to delivering shipments to a set of recipients at separate addresses;generating by a computer a first shipping option to deliver shipments to a first sub-set of the recipients within a first time period, and to deliver shipments to a second sub-set of recipients within a second time period that is greater than the first time period, shipments to the second sub-set of recipients being a greater distance than shipments to the first sub-set of recipients, and the first shipping option providing a cost of shipping savings relative to shipping to all of the recipients within the first time period, wherein the generating of the first shipping option comprises selecting the second sub-set of recipients to include a quantity of recipients to provide a cost of shipping savings equal or greater to a predetermined percentage, wherein the generating of the first shipping option further comprises generating the first shipping option to deliver shipments to the first sub-set of recipients via a first shipping method, and to deliver the shipments to the second sub-set of recipients via a second shipping method;presenting the first shipping option in a user interface to a user for selection;generating a second shipping option to deliver shipments to the first sub-set of the recipients within the first time period, and to deliver shipments to a third sub-set of recipients within a third time period that is greater than the second time period, wherein a quantity of the third sub-set of recipients is unequal to the quantity of the second sub-set of recipients, the second shipping option providing a cost savings unequal to the first shipping option; andproviding the second shipping option to the user for selection.
  • 2. The method of claim 1, wherein the first shipping option includes a first carrier delivering shipments to the first and second sub-set of recipients.
  • 3. The method of claim 1, wherein the first shipping option includes a first carrier delivering shipments to the first sub-set of recipients and a second carrier delivering shipments to the second sub-set of recipients.
  • 4. The method of claim 1, further comprising repeating the generating of the second shipping option to generate multiple shipping options to be provided to a user for selection, each shipping option providing the shipping cost savings equal to or greater than shipping to all of the recipients with the first time period, the multiple shipping options comprising one or more of different sub-set of recipients of different quantities, different time periods to deliver shipments to the different sub-set of recipients, and different shipping methods.
  • 5. A tangible machine-readable storage medium having stored thereon a set of instructions, which when executed on a processor, cause the processor to perform a method comprising: receiving data related to delivering shipments to a set of recipients at separate addresses;generating by a computer a first shipping option to deliver shipments to a first sub-set of the recipients within a first time period, and to deliver shipments to a second sub-set of recipients within a second time period that is greater than the first time period, shipments to the second sub-set of recipients being a greater distance than shipments to the first sub-set of recipients, and the first shipping option providing a cost of shipping savings relative to shipping to all of the recipients within the first time period, wherein the generating of the first shipping option comprises selecting the second sub-set of recipients to include a quantity of recipients to provide a cost of shipping savings equal or greater to a predetermined percentage, wherein the generating of the first shipping option further comprises generating the first shipping option to deliver shipments to the first sub-set of recipients via a first shipping method, and to deliver the shipments to the second sub-set of recipients via a second shipping method;presenting the first shipping option in a user interface to a user for selection;generating a second shipping option to deliver shipments to the first sub-set of the recipients within the first time period, and to deliver shipments to a third sub-set of recipients within a third time period that is greater than the second time period, wherein a quantity of the third sub-set of recipients is unequal to the quantity of the second sub-set of recipients, the second shipping option providing a cost savings unequal to the first shipping option; andproviding the second shipping option to a user for selection.
  • 6. The machine-readable medium of claim 5, wherein the first shipping option includes a first carrier delivering shipments to the first and second sub-set of recipients.
  • 7. The machine-readable medium of claim 5, wherein the first shipping option includes a first carrier delivering shipments to the first sub-set of recipients and a second carrier delivering shipments to the second sub-set of recipients.
  • 8. The machine-readable medium of claim 5, wherein the method further comprises repeating the generating of the second option to generate multiple shipping options to be provided to a user for selection, each shipping option providing the shipping cost savings equal to or greater than shipping to all of the recipients with the first time period, the multiple shipping options comprising one or more of different sub-set of recipients of different quantities, different time periods to deliver shipments to the different sub-set of recipients, and different shipping methods.
  • 9. A system comprising: a processor configured to receive data related to delivering shipments to a set of recipients at separate addresses;wherein the processor is further configured to generate a first shipping option to deliver shipments to a first sub-set of the recipients within a first time period, and to deliver shipments to a second sub-set of recipients within a second time period that is greater than the first time period, shipments to the second sub-set of recipients being a greater distance than shipments to the first sub-set of recipients, and the first shipping option providing a cost of shipping savings relative to shipping to all of the recipients within the first time period, and wherein the processor is further configured to select the second sub-set of recipients to include a quantity of recipients to provide a cost of shipping savings equal or greater to a predetermined percentage, wherein the processor is further configured to generate a second shipping option to deliver shipments to the first sub-set of the recipients within the first time period, and to deliver shipments to a third sub-set of recipients within a third time period that is greater than the second time period, wherein a quantity of the third sub-set of recipients is unequal to a quantity of the second sub-set of recipients, the second shipping option providing a cost savings unequal to the first shipping option; anda display to present the first shipping option in a user interface to a user for selection.
  • 10. The system of claim 9, wherein the processor is further configured to generate the first shipping option to deliver shipments to the first sub-set of recipients via a first shipping method, and to deliver the shipments to the second sub-set of recipients via a second shipping method.
  • 11. The system of claim 10, wherein the processor is further configured to generate multiple shipping options to be provided to a user for selection, each shipping option providing the shipping cost savings equal to or greater than shipping to all of the recipients with the first time period, the multiple shipping options comprising one or more of different sub-set of recipients of different quantities, different time periods to deliver shipments to the different sub-set of recipients, and different shipping methods.
CROSS-REFERENCE TO RELATED APPLICATIONS

Under 35 U.S.C. §120, this application is a continuation of U.S. patent application Ser. No. 11/187,484, filed Jul. 22, 2005, the disclosure of which is incorporated herein by reference in its entirety.

US Referenced Citations (190)
Number Name Date Kind
5191523 Whitesage Mar 1993 A
5237499 Garback Aug 1993 A
5319542 King et al. Jun 1994 A
5331546 Webber et al. Jul 1994 A
5475740 Biggs et al. Dec 1995 A
5570283 Shoolery et al. Oct 1996 A
5655008 Futch et al. Aug 1997 A
5732398 Tagawa Mar 1998 A
5799286 Morgan et al. Aug 1998 A
5819092 Ferguson et al. Oct 1998 A
5832451 Flake et al. Nov 1998 A
5832453 O'Brien Nov 1998 A
5839114 Lynch et al. Nov 1998 A
5842178 Giovannoli Nov 1998 A
5852812 Reeder Dec 1998 A
5870721 Norris Feb 1999 A
5893077 Griffin Apr 1999 A
5897620 Walker et al. Apr 1999 A
5948040 DeLorme et al. Sep 1999 A
5987425 Hartman et al. Nov 1999 A
5991742 Tran Nov 1999 A
6018715 Lynch et al. Jan 2000 A
6023679 Acebo et al. Feb 2000 A
6029144 Barrett et al. Feb 2000 A
6058375 Park May 2000 A
6070798 Nethery Jun 2000 A
6119094 Lynch et al. Sep 2000 A
6195420 Tognazzini Feb 2001 B1
6230204 Fleming May 2001 B1
6295521 DeMarcken et al. Sep 2001 B1
6304850 Keller et al. Oct 2001 B1
6377932 DeMarcken Apr 2002 B1
6411940 Egendorf Jun 2002 B1
6442526 Vance et al. Aug 2002 B1
6477520 Malaviya et al. Nov 2002 B1
6571213 Altendahl et al. May 2003 B1
6622084 Cardno et al. Sep 2003 B2
6701311 Biebesheimer et al. Mar 2004 B2
6711548 Rosenblatt Mar 2004 B1
6715073 An et al. Mar 2004 B1
6816882 Conner et al. Nov 2004 B1
6839679 Lynch et al. Jan 2005 B1
6842737 Stiles et al. Jan 2005 B1
6847988 Toyouchi et al. Jan 2005 B2
6904411 Hinkle Jun 2005 B2
6959298 Silverbrook et al. Oct 2005 B1
6959327 Vogl et al. Oct 2005 B1
6961773 Hartman et al. Nov 2005 B2
6965868 Bednarek Nov 2005 B1
6980885 Ye et al. Dec 2005 B2
7006986 Sines et al. Feb 2006 B1
7050986 Vance et al. May 2006 B1
7076451 Coupland et al. Jul 2006 B1
7080096 Imamura Jul 2006 B1
7117170 Bennett et al. Oct 2006 B1
7136821 Kohavi et al. Nov 2006 B1
7139728 Rigole Nov 2006 B2
7194417 Jones Mar 2007 B1
7206763 Turk Apr 2007 B2
7206768 deGroeve et al. Apr 2007 B1
7222084 Archibald et al. May 2007 B2
7228313 Hand et al. Jun 2007 B1
7236957 Crosson Jun 2007 B2
7272568 Birch et al. Sep 2007 B1
7272626 Sahai et al. Sep 2007 B2
7302399 Donovan et al. Nov 2007 B1
7315824 Chen et al. Jan 2008 B2
7356516 Richey et al. Apr 2008 B2
7363242 Lewis et al. Apr 2008 B2
7363267 Vincent et al. Apr 2008 B1
7379890 Myr et al. May 2008 B2
7388495 Fallin et al. Jun 2008 B2
7401029 Gillespie Jul 2008 B2
7451106 Gindlesperger Nov 2008 B1
7457950 Brickell et al. Nov 2008 B1
7490122 Horvitz et al. Feb 2009 B2
7496520 Handel et al. Feb 2009 B1
7499864 Campbell et al. Mar 2009 B2
7539620 Winterton et al. May 2009 B2
7548615 Bhalgat et al. Jun 2009 B2
7562027 Baggett et al. Jul 2009 B1
7574372 Among et al. Aug 2009 B2
7587370 Himmelstein Sep 2009 B2
7596566 Patwardhan Sep 2009 B1
7599877 Cole et al. Oct 2009 B1
7660743 Messa et al. Feb 2010 B1
20010003815 Nakano Jun 2001 A1
20010051917 Biaaonette et al. Dec 2001 A1
20020010612 Smith et al. Jan 2002 A1
20020016729 Breitenbach et al. Feb 2002 A1
20020059092 Naito et al. May 2002 A1
20020095347 Cummiskey Jul 2002 A1
20020103693 Bayer et al. Aug 2002 A1
20020111886 Chenevich et al. Aug 2002 A1
20020120478 Tanaka Aug 2002 A1
20020120548 Etkin Aug 2002 A1
20020143677 Prakash Oct 2002 A1
20020152101 Lawson et al. Oct 2002 A1
20020156687 Carr et al. Oct 2002 A1
20020184102 Markopoulos et al. Dec 2002 A1
20030023463 Dombroski et al. Jan 2003 A1
20030036930 Matos et al. Feb 2003 A1
20030036981 Vaughan et al. Feb 2003 A1
20030040987 Hudson et al. Feb 2003 A1
20030046195 Mao Mar 2003 A1
20030050879 Rosen et al. Mar 2003 A1
20030078800 Salle et al. Apr 2003 A1
20030105711 O'Neil Jun 2003 A1
20030110062 Mogler et al. Jun 2003 A1
20030110136 Wells et al. Jun 2003 A1
20030120477 Kruk et al. Jun 2003 A1
20030120526 Altman et al. Jun 2003 A1
20030149653 Penney et al. Aug 2003 A1
20030177045 Fitzgerald et al. Sep 2003 A1
20030182413 Allen et al. Sep 2003 A1
20030191725 Ratliff et al. Oct 2003 A1
20030200111 Damji Oct 2003 A1
20030204474 Capek et al. Oct 2003 A1
20030229529 Mui et al. Dec 2003 A1
20030236722 Kamel Dec 2003 A1
20040002876 Sommers et al. Jan 2004 A1
20040034593 Toneguzzo et al. Feb 2004 A1
20040044556 Brady et al. Mar 2004 A1
20040044600 Chu et al. Mar 2004 A1
20040044644 Brady et al. Mar 2004 A1
20040044673 Brady et al. Mar 2004 A1
20040044681 Brady et al. Mar 2004 A1
20040049413 Momma et al. Mar 2004 A1
20040073615 Darling Apr 2004 A1
20040117275 Billera Jun 2004 A1
20040143498 Umeda Jul 2004 A1
20040143522 Wall et al. Jul 2004 A1
20040153348 Garback Aug 2004 A1
20040167808 Fredericks et al. Aug 2004 A1
20040193457 Shogren Sep 2004 A1
20040210487 Fujimoto et al. Oct 2004 A1
20040249684 Karppinen Dec 2004 A1
20040249745 Baaren Dec 2004 A1
20040260601 Brief Dec 2004 A1
20040260603 Marmotta Dec 2004 A1
20050004830 Rozell et al. Jan 2005 A1
20050033614 Lettovsky et al. Feb 2005 A1
20050033616 Vavul et al. Feb 2005 A1
20050033631 Wefers et al. Feb 2005 A1
20050043985 Gillespie Feb 2005 A1
20050043996 Silver Feb 2005 A1
20050060271 Vig Mar 2005 A1
20050065821 Kalies Mar 2005 A1
20050086088 Stiles et al. Apr 2005 A1
20050108069 Shiran et al. May 2005 A1
20050108153 Thomas et al. May 2005 A1
20050119809 Chen Jun 2005 A1
20050120052 Miller et al. Jun 2005 A1
20050132006 Horvitz et al. Jun 2005 A1
20050138175 Kumar et al. Jun 2005 A1
20050165629 Bruns Jul 2005 A1
20050182713 Marchesi Aug 2005 A1
20050197913 Grendel et al. Sep 2005 A1
20050197915 Biwer et al. Sep 2005 A1
20050216375 Grendel et al. Sep 2005 A1
20050273345 Castillejo Dec 2005 A1
20050283389 Widjaja et al. Dec 2005 A1
20050288973 Taylor et al. Dec 2005 A1
20060010023 Tromczynski et al. Jan 2006 A1
20060037016 Saha et al. Feb 2006 A1
20060059021 Yulman et al. Mar 2006 A1
20060100909 Glimp et al. May 2006 A1
20060101467 Buco et al. May 2006 A1
20060123088 Simmons et al. Jun 2006 A1
20060143087 Tripp et al. Jun 2006 A1
20060190314 Hernandez Aug 2006 A1
20060212321 Vance et al. Sep 2006 A1
20060224423 Sun et al. Oct 2006 A1
20060241966 Walker et al. Oct 2006 A1
20060259335 La Macchia et al. Nov 2006 A1
20060283935 Henry et al. Dec 2006 A1
20070005406 Assadian et al. Jan 2007 A1
20070021991 Etzioni et al. Jan 2007 A1
20070038566 Shestakov et al. Feb 2007 A1
20070043651 Xiao et al. Feb 2007 A1
20070156546 Oppert et al. Jul 2007 A1
20070174154 Roberts et al. Jul 2007 A1
20070239548 Sears Oct 2007 A1
20070273499 Chlubek et al. Nov 2007 A1
20080004964 Messa Jan 2008 A1
20080065408 Salonen Mar 2008 A1
20080091481 Messa Apr 2008 A1
20080319808 Wofford et al. Dec 2008 A1
20090006142 Orttung Jan 2009 A1
20100191572 Newman et al. Jul 2010 A1
Foreign Referenced Citations (1)
Number Date Country
2291463 Jun 2001 CA
Related Publications (1)
Number Date Country
20090125355 A1 May 2009 US
Continuations (1)
Number Date Country
Parent 11187484 Jul 2005 US
Child 12354692 US