AUTO-CASCADING CLEAR TO BUILD ENGINE FOR MULTIPLE LOCATION ORDER LEVEL PARTS MANAGEMENT

• US 20090164343A1
• Filed: 12/20/2007
• Published: 06/25/2009
• Est. Priority Date: 12/20/2007
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Paske, Ryan T., Lee, Jason S., Hurtis, George M., Momsen, Kay M.
• Application Number:
  US11/961,584
• Publication Number:
  US 20090164343A1
• Time in Patent Office: Days
• US Class Current: 705/28
• 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/087 Inventory or stock management, e.g. order filling, procurement or balancing against orders

Abstract

Embodiments of the present invention provide a method, system and computer program product for multiple-location auto-cascading clear to build inventory management. In an embodiment of the invention, an order processing method can be provided. The order processing method can include determining a required allocation of parts necessary to build an order, recursively soft allocating parts in different locations until enough parts have been soft allocated to satisfy the required allocation of parts necessary to build the order, and hard allocating the soft allocated parts. In one aspect of the embodiment, it can be determined that not enough parts remain amongst the different locations to satisfy the required allocation of parts necessary to build the order. In that circumstance, the soft allocated parts can be cleared for allocation by a different order. Alternatively, the order can be built short by hard allocating the soft allocated parts even though not enough parts are soft allocated to satisfy the required allocation of parts.

Claims

1. An order processing method comprising:

determining a required allocation of parts necessary to build an order;

recursively soft allocating parts in different locations until enough parts have been soft allocated to satisfy the required allocation of parts necessary to build the order; and

,

hard allocating the soft allocated parts.

2. The method of claim 1, wherein prioritizing each of the stocking locations, comprises:

retrieving a part number for a part required to fulfill the order and a priority location list corresponding to the part number; and

,

associating a priority with each of the stocking locations from which different parts are to be allocated to satisfy an order.

3. The method of claim 1, wherein recursively soft allocating parts in different locations until enough parts have been soft allocated to satisfy the required allocation of parts necessary to build the order, comprises:

retrieving a list of stocking locations for the parts;

prioritizing each of the stocking locations;

locating a highest priority one of the stocking locations having allocable ones of the parts and soft allocating the allocable parts;

removing the highest priority one of the stocking locations from the list and reducing the required allocation of parts by a number of soft allocated allocable parts in the highest priority one of the stocking locations; and

,

repeating each of the retrieving, prioritizing, locating, removing and reducing for the list and required allocations of parts until the required allocation of parts is satisfied by the number of soft allocated allocable parts.

4. The method of claim 1, further comprising:

determining that not enough parts remain amongst the different locations to satisfy the required allocation of parts necessary to build the order; and

,

clearing the soft allocated parts for allocation by a different order.

5. The method of claim 1, further comprising:

determining that not enough parts remain amongst the different locations to satisfy the required allocation of parts necessary to build the order; and

,

building short the order by hard allocating the soft allocated parts even though not enough parts are soft allocated to satisfy the required allocation of parts.

6. The method of claim 1, further comprising kitting the parts when found in multiple stocking locations.

7. The method of claim 6, wherein kitting the parts when found in multiple stocking locations, comprises:

creating a new kitting child unit of work tied to a parent unit; and

,

consolidating the child unit of work with the parent upon arrival of the child unit of work.

8. An inventory management data processing system comprising:

a data store of parts and stocking locations storing the parts; and

,

a multiple location auto-cascading clear to build engine coupled to the data store, the engine comprising program code enabled to determine a required allocation of parts necessary to build an order, to recursively soft allocate parts in different locations specified by the data store until enough parts have been soft allocated to satisfy the required allocation of parts necessary to build the order, and to hard allocate the soft allocated parts.

9. A computer program product comprising a computer usable medium embodying computer usable program code for order processing, the computer program product comprising:

computer usable program code for determining a required allocation of parts necessary to build an order;

computer usable program code for recursively soft allocating parts in different locations until enough parts have been soft allocated to satisfy the required allocation of parts necessary to build the order; and

,

computer usable program code for hard allocating the soft allocated parts.

10. The computer program product of claim 9, wherein the computer usable program code for prioritizing each of the stocking locations, comprises:

computer usable program code for retrieving a part number for a part required to fulfill the order and a priority location list corresponding to the part number; and

,

associating a priority with each of the stocking locations from which different ones of the part are to be allocated to satisfy an order.

11. The computer program product of claim 9, wherein the computer usable program code for recursively soft allocating parts in different locations until enough parts have been soft allocated to satisfy the required allocation of parts necessary to build the order, comprises:

computer usable program code for retrieving a list of stocking locations for the parts;

computer usable program code for prioritizing each of the stocking locations;

computer usable program code for locating a highest priority one of the stocking locations having allocable ones of the parts and soft allocating the allocable parts;

computer usable program code for removing the highest priority one of the stocking locations from the list and reducing the required allocation of parts by a number of soft allocated allocable parts in the highest priority one of the stocking locations; and

,

computer usable program code for repeating each of the retrieving, prioritizing, locating, removing and reducing for the list and required allocations of parts until the required allocation of parts is satisfied by the number of soft allocated allocable parts.

12. The computer program product of claim 9, further comprising:

computer usable program code for determining that not enough parts remain amongst the different locations to satisfy the required allocation of parts necessary to build the order; and

,

computer usable program code for clearing the soft allocated parts for allocation by a different order.

13. The computer program product of claim 9, further comprising:

computer usable program code for determining that not enough parts remain amongst the different locations to satisfy the required allocation of parts necessary to build the order; and

,

computer usable program code for building short the order by hard allocating the soft allocated parts even though not enough parts are soft allocated to satisfy the required allocation of parts.

14. The computer program product of claim 9, further comprising computer usable program code for kitting the parts when found in multiple stocking locations

15. The computer program product of claim 14, wherein the computer usable program code for kitting the parts when found in multiple stocking locations, comprises:

computer usable program code for creating a new kitting child unit of work tied to a parent unit; and

,

computer usable program code for consolidating the child unit of work with the parent upon arrival of the child unit of work.