US2011029411A1PendingUtilityA1

Methods and systems for rounding with availability check

Assignee: SAP AGPriority: Sep 7, 2005Filed: Mar 12, 2010Published: Feb 3, 2011
Est. expirySep 7, 2025(expired)· nominal 20-yr term from priority
G06Q 10/0875G06Q 20/203G06Q 10/087G06Q 10/04G06Q 10/06315
54
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Systems and methods are provide for optimizing the result of an availability check of a required quantity of products, wherein a plurality of rounding algorithms are provided. In one embodiment, a method is provided that comprises a first step of rounding, according to at least one predetermined rounding algorithm, the required quantity of products. The method may also comprise a second step of checking availability of the rounded quantity of products and a third step of rounding down, according to the at least one predetermined rounding algorithm, the available quantity of products if the available quantity of products is lower than the rounded required quantity of products.

Claims

exact text as granted — not AI-modified
1 . A computer-implemented method for optimizing the result of an availability check of a required quantity of products, wherein a plurality of rounding algorithms are provided, the computer-implemented method comprising steps, prepared by a computer, of:
 rounding, according to at least one predetermined rounding algorithm implemented by the computer, the required quantity of products;   checking, by the computer, the availability of the rounded quantity of products; and   rounding down, according to the at least one predetermined rounding algorithm implemented by the computer, the available quantity of products when the available quantity of products is lower than the rounded required quantity of products, wherein the at least one predetermined rounding algorithm comprises at least one packaging specification, the packaging specification comprising:
 at least one rounding rule; 
 a plurality of different package sizes; and 
 tolerance values defining an interval around the package size of a package unit. 
   
     
     
         2 - 3 . (canceled) 
     
     
         4 . The computer-implemented method of  claim 1 , further comprising creating a remaining requirement of products when the difference between the rounded required quantity of products and the rounded available quantity of products is larger than the smallest package size given by the packaging specification, whereby the remaining quantity is given by the difference between the required quantity of products and the rounded available quantity of products. 
     
     
         5 . The computer-implemented method of  claim 4 , wherein the rounding comprises at least a package-rounding-process and a tolerance-rounding-process, whereby the package-rounding-process comprises rounding the required quantity to a multiple of the smallest package size, and whereby the tolerance-rounding-process comprises rounding the required quantity to a predetermined package size. 
     
     
         6 . The computer-implemented method of  claim 5 , wherein tolerance intervals define upper and lower bounds around the package sizes for packages larger than the smallest package. 
     
     
         7 . The computer-implemented method of  claim 6 , wherein the tolerance-rounding-process is performed when the packaging specification comprises valid tolerance values and the required quantity is within one of the tolerance intervals defined by the tolerance values. 
     
     
         8 . The computer-implemented method of  claim 6 , wherein the package-rounding-process is performed when the predetermined packaging specification comprises invalid tolerance values. 
     
     
         9 . The computer-implemented method of  claim 6 , wherein the package-rounding-process is performed when the predetermined packaging specification comprises valid tolerances and the given quantity is out of the tolerance intervals defined by the tolerance values. 
     
     
         10 . The computer-implemented method of  claim 1 , wherein the at least one rounding rule comprises at least one of a rounding down rule, a rounding up rule, and a rounding to the nearest rule. 
     
     
         11 - 12 . (canceled) 
     
     
         13 . A system comprising:
 a data storage device which stores a plurality of rounding algorithms;   means for rounding, according to at least one rounding algorithm, a required quantity of products;   means for checking availability of a rounded quantity of products; and   means for rounding down, according to the plurality of rounding algorithms, the available quantity of products when the available quantity of products is lower than the rounded required quantity of products, wherein the plurality of rounding algorithms comprise at least one packaging specification, the packaging specification comprising:
 at least one rounding rule; 
 a plurality of different package sizes; and 
 tolerance values defining an interval around the package size of a package unit. 
   
     
     
         14 . The system of  claim 13 , wherein the means for rounding a required quantity of products and for performing an availability check are further adapted to perform the following steps:
 determining a valid packaging specification;   determining tolerance values from the packaging specification;   evaluating whether the determined tolerance values are valid;   determining the tolerance intervals given by the determined tolerance values, when the determined tolerance values are valid; and   checking whether the required quantity is within one of the determined tolerance intervals.   
     
     
         15 . A computer-readable medium including program instructions for performing, when executed by a processor, a method for optimizing the result of an availability check of a required quantity of products, wherein a plurality of rounding algorithms are provided, the method comprising:
 rounding, according to at least one predetermined rounding algorithm, the required quantity of products;   checking availability of the rounded quantity of products; and   rounding down, according to the at least one predetermined rounding algorithm, the available quantity of products when the available quantity of products is lower than the rounded required quantity of products, wherein the at least one predetermined rounding algorithm comprises at least one packaging specification, the packaging specification comprises   at least one rounding rule;   a plurality of different package sizes; and   tolerance values defining an interval around the package size of a package unit.   
     
     
         16 - 17 . (canceled) 
     
     
         18 . The computer-readable medium of  claim 15 , further comprising creating a remaining requirement of products when the difference between the rounded required quantity of products and the rounded available quantity of products is larger than the smallest package size given by the packaging specification, whereby the remaining quantity is given by the difference between the required quantity of products and the rounded available quantity of products. 
     
     
         19 . The computer-readable medium of  claim 18 , wherein the rounding comprises at least a package-rounding-process and a tolerance-rounding-process, whereby the package-rounding-process comprises rounding the required quantity to a multiple of the smallest package size, and whereby the tolerance-rounding-process comprises rounding the required quantity to a predetermined package size. 
     
     
         20 . The method of  claim 19 , wherein tolerance intervals define upper and lower bounds around the package sizes for packages larger than the smallest package.

Join the waitlist — get patent alerts

Track US2011029411A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.