Method and system for order fulfillment in a distribution center

• US 7,532,947 B2
• Filed: 02/18/2006
• Issued: 05/12/2009
• Est. Priority Date: 05/11/1999
• Status: Expired due to Fees

• Current Assignee: JUNE RAY LIMITED
• Original Assignee: IpVenture, Inc.
• Inventors: Klots, Boris, Grewell, Patricia C., Waddington, William Henry, Ham, Peter
• Primary Examiner(s): Mackey, Patrick
• Assistant Examiner(s): Butler, Michael E.
• Application Number:
  US11/356,870
• Publication Number:
  US 20060142895A1
• Time in Patent Office: 1,179 Days
• Field of Search: 700/216
• US Class Current: 700/216
• CPC Class Codes: G06F 16/9574 of access to content, e.g. by caching
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/06311 Scheduling, planning or task assignment for a person or group
• CPC Class Codes: G06Q 10/06312 Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
• CPC Class Codes: G06Q 10/06315 Needs-based resource requirements planning or analysis
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work
• CPC Class Codes: G06Q 10/08 Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
• CPC Class Codes: G06Q 10/08355 Routing methods
• CPC Class Codes: G06Q 10/087 Inventory or stock management, e.g. order filling, procurement or balancing against orders
• CPC Class Codes: G06Q 20/203 Inventory monitoring
• CPC Class Codes: G06Q 30/0201 Market modelling; Market analysis; Collecting market data
• CPC Class Codes: G06Q 30/06 Buying, selling or leasing transactions
• CPC Class Codes: G06Q 30/0601 Electronic shopping [e-shopping]
• CPC Class Codes: G06Q 30/0633 Lists, e.g. purchase orders, compilation or processing
• CPC Class Codes: G06Q 30/0641 Shopping interfaces
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Abstract

Order allocation techniques that reduce the number of stops that a container makes in the process of fulfilling a customer order is disclosed. In one embodiment, this is accomplished by first identifying a pod that stocks the largest number of different items in a customer order. Then, a second pod is identified that stocks the largest number of remaining items in the customer order. Ultimately, all items in the customer order are assigned a pod. The collection of pods defines a container path through a distribution center. In one embodiment, the techniques include retrieving an item identified. with the retrieval being dependent on an expiration time associated with the item. In another embodiment. the techniques include using information from a handheld computing device via a wireless interface regarding movement of items in the distribution center.

Claims

1. A computer-implemented method of fulfilling an order, the method using a distribution center having a plurality of sites for storing a plurality of items, the method comprising:

receiving an order designating items and quantities of items;

identifying a first site which has the highest number of items in the order, and the items in the order that are available from the first site;

determining the items remaining in the order after removing those items identified as being available from the first site; and

identifying a second site which has the highest number of the items remaining in the order, and the items remaining in the order that are available from the second site,

wherein the method further comprises retrieving at least one item identified from one of the sites, with the retrieval of the at least one item being dependent on an expiration time associated with the at least one item,

wherein the center has at least two major sites,

wherein at least one item in the order is located in a first major site and at least one item in the order is located in a second major site,

wherein the first site and the second site are in the first major site, and

wherein the method is implemented by at least one computing device,

wherein for two major sites, items at one major site are stored at a higher humidity than items at the other major site.

2. A computer-implemented method as recited in claim 1 further comprising:

receiving a plurality of orders to be fulfilled, each designating items and quantities of items; and

analyzing the plurality of orders received at least based on items in a plurality of sites in the distribution center to determine a plurality of paths in the distribution center to fulfill the plurality of orders.

3. A computer-implemented method as recited in claim 1 wherein the center has at least two other areas, items at one area are stored at a lower temperature than items at the other area.

4. A computer-implemented method as recited in claim 1 wherein one major site is configured for wine.

5. A computer-implemented method as recited in claim 1 wherein one major site is configured as a bakery or a deli.

6. A computer-implemented method as recited in claim 1 wherein one major site is configured as a pharmacy.

7. A computer-implemented method as recited in claim 1 wherein the expiration time is configured to be on a particular day, or a particular time within a particular day.

8. A computer-implemented method as recited in claim 1 wherein the expiration time is configured to be over a period of days.

9. A computer-implemented method as recited in claim 1 wherein if the at least one item identified for retrieval from one of the sites is at two locations within the site, and if the at least one item at one location has the same expiration time as the other location, the location with fewer quantity of the item is selected first for retrieval.

10. A computer-implemented method as recited in claim 1 wherein the method uses information from a handheld computing device via a wireless interface, with the handheld computing device being used by a center employee regarding movement of items in the center.

11. A computer-implemented method as recited in claim 1 wherein the method further comprises transmitting information to a computing device for providing an indication as to the location in the first site of an item identified in the first site, so as to help manually retrieve the identified item from the first site for fulfilling the order.

12. A computer-implemented method as recited in claim 1 wherein the distribution center includes a manual pod, a carousel pod and a mechanized pod.

13. A computer-implemented method as recited in claim 1 further comprising determining a path for a container to follow, with the path including a stop at the first site to have at least one identified item picked and placed into the container to fill the order.

14. A computer-implemented method as recited in claim 13 wherein the path is automatically altered in view of a problem detected in the distribution center while the container is on its way to the first site.

15. A computer-implemented method as recited in claim 1 further comprising stopping a container at the first site to allow an employee to pick an identified item to be placed into the container, wherein the employee uses a handheld computing device to scan the identified item and an identification of the container for order fulfillment.

16. A computer-implemented method as recited in claim 1, wherein a database includes information related to a location in the center holding an item, a quantity of the item at the location, and an attribute of the item.

17. A computer-implemented method as recited in claim 16, wherein the attribute includes information related to the quantity of the item at the location that has been allocated to fulfill an order, and the quantity of the item arrived at the center but not yet put at the location for picking.

18. A computer-implemented method as recited in claim 1 wherein the order was received via the Internet.

19. A computer-implemented method as recited in claim 1 wherein if an item has a plurality of units at a site, and the plurality of units have been identified to fill an order, the plurality of units will not be subsequently identified to fill another order even when the plurality of units have not been picked to fill the order.

20. A computer-implemented method as recited in claim 1 further comprising:

receiving a plurality of orders to be fulfilled, each designating items and quantities of items;

analyzing the plurality of orders received at least based on items in a plurality of sites in the distribution center to determine a plurality of paths in the distribution center to fulfill the plurality of orders; and

using information from a handheld computing device via a wireless interface, with the device being used by a center employee regarding movement of items in the center.

21. A computer-implemented method as recited in claim 20 further comprising stepping a container at the first site to allow an employee to pick an identified item to be placed into the container, wherein the employee uses the handheld computing device to scan the identified item and an identification of the container for order fulfillment.

22. A computer-implemented method as recited in claim 20, wherein the handheld computing device communicates via a wireless interface with another computing device used by the center regarding movement of items.

23. A computer-implemented method as recited in claim 22 further comprising stopping a container at the first site to allow an employee to pick an identified item to be placed into the container, wherein the employee uses the handheld computing device to scan the identified item and an identification of the container for order fulfillment.