Rounding to transportation quantities

• US 8,438,051 B2
• Filed: 09/28/2004
• Issued: 05/07/2013
• Est. Priority Date: 09/28/2004
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Schweitzer, Michael, Huber, Edward W., McDonald, Marlon S., Monson, Michael J., Newbanks, Larry M., Baermann, Guenther J., Czach, Michael J., Eich, Eric P., Schmitz, Hans, Taylor, Brian R., Fishwick, Mark, Matthews, Ryan G.
• Primary Examiner(s): Singh, Gurkanwaljit
• Application Number:
  US10/952,668
• Publication Number:
  US 20060074728A1
• Time in Patent Office: 3,143 Days
• Field of Search: 705/8, 705/9, 705/10, 705/21, 705/22, 705/28
• US Class Current: 705/7.11
• 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/087 Inventory or stock management, e.g. order filling, procurement or balancing against orders

Abstract

A method and apparatus to efficiently round requested quantities to efficient transportation quantities in the supply chain. Target locations are organized in a sequence. A tolerance interval around the requested quantity is calculated for each target location. The requested value is then rounded to an efficient transportation quantity for each target location in its sequential order.

Claims

1. A computer implemented method comprising:

defining a tolerance interval for a target location;

rounding, by a computer, a requested quantity to a shipping quantity within the tolerance interval of the target location, the shipping quantity having efficient transportation characteristics;

persistently storing the shipping quantity in a computer readable form;

arranging a plurality of target locations in a sequence; and

wherein a tolerance interval is defined for each target location and the rounding is performed sequentially.

2. The method of claim 1 wherein arranging comprises:

analyzing a plurality of criteria to establish a priority of target locations.

3. The method of claim 2 wherein the criteria comprises at least one of:

lead time to delivery, forecast demand at target, planned safety stock at target and order type.

6. The method of claim 1 wherein rounding comprises:

choosing a minimal set of pack stages having a maximum number of higher quantity pack stages to fall within the tolerance interval of each target location in sequence.

7. The method of claim 1 wherein rounding sequentially comprises:

finding a set of pack stages having a quantity that falls within the tolerance interval for a current target location, the set having a minimum number of higher value pack stages;

subtracting the quantity from a then available quantity; and

repeating the finding and subtracting for a next target location until a quantity for each target location is found.

8. The method of claim 1 further comprising:

subtracting a sum of mandatory requirements for the target locations from a maximum available quantity to obtain an available rounding quantity.

4. A computer implemented method comprisinq:

defining a tolerance interval for a target location;

rounding, by computer, a requested quantity to a shipping quantity within the tolerance interval of the target location, the shipping quantity having efficient transportation characteristics; and

persistently storing the shipping quantity in a computer readable form

wherein defining a tolerance interval includes

finding an upper bound for distribution to each target location; and

finding a lower bound for distribution to each target location by selecting the higher of i) a mandatory requirement for a target location or ii) a lowest of an allowed percentage reduction from a requested quantity and an allowed absolute reduction from the requested quantity.

5. A computer implemented method comprising:

defining a tolerance interval for a target location;

rounding, by a computer, a requested quantity to a shipping quantity within the tolerance interval of the target location, the shipping quantity having efficient transportation characteristics; and

persistently storing the shipping quantity in a computer readable form

wherein defining a tolerance interval includes

finding an upper hound for distribution to each target location by selecting the lower of i) a maximum available quantity or ii) a higher of an allowed percentage increase in a requested quantity and an allowed absolute increase from the requested quantity and

finding a lower bound for distribution to each target location.

9. A computer readable storage media containing executable instructions which when executed cause a digital processing system to perform operations comprising:

defining a tolerance interval for a target location;

rounding a requested quantity to a shipping quantity within the tolerance interval of the target location, the shipping quantity having efficient transportation characteristics;

persistently storing the shipping quantity in a computer readable form

arranging a plurality of target locations in a sequence; and

wherein a tolerance interval is defined for each target location and the rounding is performed sequentially.

10. The computer readable storage media of claim 9 having executable instructions which when executed cause a digital processing system to perform operations further comprising:

finding an upper bound for distribution to each target location; and

finding a lower bound for distribution to each target location.

11. The computer readable storage media of claim 10 having executable instructions which when executed cause a digital processing system to perform operations further comprising:

selecting the higher of i) a mandatory requirement for a target location or ii) a lowest of an allowed percentage reduction from a requested quantity and an allowed absolute reduction from the requested quantity.

12. The computer readable storage media of claim 10 having executable instructions which when executed cause a digital processing system to perform operations further comprising:

selecting the lower of i) a maximum available quantity or ii) a higher of an allowed percentage increase in a requested quantity and an allowed absolute incrcase from the requested quantity.

13. The computer readable storage media of claim 9 having executable instructions which when executed cause a digital processing system to perform operations further comprising:

finding a set of pack stages having a quantity that falls within the tolerance interval for a current target location, the set having a minimum number of higher value pack stages;

subtracting the quantity from a then available quantity; and

repeating the finding and subtracting for a next target location until a quantity for each target location is found.

14. The computer readable storage media of claim 9 which when executed cause a digital processing system to perform a method further comprising:

subtracting a sum of mandatory requirements for the target locations from a maximum available quantity to obtain an available rounding quantity.