Dynamic fulfillment planning method and apparatus

• US 7,974,720 B2
• Filed: 08/12/2008
• Issued: 07/05/2011
• Est. Priority Date: 08/12/2008
• Status: Expired due to Fees

• Current Assignee: icon-scm AG (E2open Parent Holdings, Inc.)
• Original Assignee: icon-scm GmbH & Co. KG (E2open Parent Holdings, Inc.)
• Inventors: Kowalewski, Marcus Klaus
• Primary Examiner(s): Patel; Ramesh B
• Assistant Examiner(s): STEVENS, THOMAS H
• Application Number:
  US12/189,864
• Publication Number:
  US 20100042240A1
• Time in Patent Office: 1,057 Days
• Field of Search: 700/97, 700/100, 705/8, 705/9, 705/10, 705/11, 702179-183
• US Class Current: 700/97
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling

Abstract

This invention relates to a method for production planning in which changing demands and current demands are combined and separated into fixed demands, time-flexible demands, and quantity-flexible demands before being prioritized according to a set of rules that optimize efficient handling of changing demands while minimizing changes in and maximizing flexibility of a production schedule.

Claims

1. In a timeframe comprised of a predetermined number of time periods, a dynamic fulfillment planning method, comprising the steps of:

providing a baseline demand signal signifying a current fulfillment plan;

providing an updated demand signal signifying desired changes to the current fulfillment plan;

calculating, using the baseline demand signal and the updated demand signal, a cumulative exceeding demand signal signifying an amount of updated demand which cannot be completed within the current fulfillment plan;

distributing the cumulative exceeding demand signal across the baseline demand signal according to a predetermined rule to create a normalized updated demand signal;

calculating a new fulfillment plan using the normalized updated demand signal.

2. The dynamic fulfillment planning method of claim 1, wherein the distributing step comprises the steps of:

calculating a normalized delta value for a specific time period in a specific timeframe based on a smaller value of either the updated demand signal at the specific time period or a total exceeded demand signal for the specific timeframe;

calculating the normalized updated demand signal by subtracting the normalized delta value for each of a plurality of time periods in the specific timeframe from the updated demand signal for the specific timeframe.

3. The dynamic fulfillment planning method of claim 1, additionally comprising the step of:

calculating, from the normalized updated demand signal, a series of individual normalized updated demand signals that signify different aspects of the normalized updated demand signal.

4. The dynamic fulfillment planning method of claim 3, wherein:

the series of individual normalized updated demand signals include at least one individual normalized updated demand signal selected from a list consisting of a satisfied normalized updated demand signal, an exceeding normalized updated demand signal, and a demand undershoot demand signal.

5. The dynamic fulfillment planning method of claim 3, wherein:

the calculating a new fulfillment plan step uses at least one of the normalized updated demand signals of the series of individual normalized updated demand signals.

6. The dynamic fulfillment planning method of claim 5, wherein:

the series of individual normalized updated demand signals contains at least two normalized updated demand signals; and

at least one of the normalized updated demand signals of the series of individual normalized updated demand signals is given fulfillment preference over a remainder of normalized updated demand signals of the series of individual normalized updated demand signals during the calculating a new fulfillment plan step.

7. The dynamic fulfillment planning method of claim 6 wherein:

a satisfied normalized updated demand signal is given fulfillment preference over an exceeding normalized updated demand signal during the calculating a new fulfillment plan step.

8. A computer readable medium that stores instructions executable by one or more processors to perform a method of dynamically preparing a new fulfillment plan based on a current fulfillment plan and a set of desired changes to the current fulfillment plan, comprising:

providing, a baseline demand signal signifying the current fulfillment plan;

providing, an updated demand signal signifying the desired changes to the current fulfillment plan;

calculating, using the baseline demand signal and the updated demand signal, a cumulative exceeding demand signal signifying an amount of updated demand which cannot be completed within the current fulfillment plan;

distributing the cumulative exceeding demand signal across the baseline demand signal according to a predetermined rule to create a normalized updated demand signal;

calculating a new fulfillment plan using the normalized updated demand signal.

9. The computer readable medium for performing the method of dynamically preparing a new fulfillment plan of claim 8, wherein the distributing step comprises the steps of:

calculating a normalized delta value for a specific time period in a specific timeframe based on a smaller value of either the updated demand signal at the specific time period or a total exceeded demand signal for the specific timeframe;

calculating the normalized updated demand signal by subtracting the normalized delta value for each of a plurality of time periods in the specific timeframe from the updated demand signal for the specific timeframe.

10. The computer readable medium for performing the method of dynamically preparing a new fulfillment plan of claim 8, additionally comprising the step of:

calculating, from the normalized updated demand signal, a series of individual normalized updated demand signals that signify different aspects of the normalized updated demand signal.

11. The computer readable medium for performing the method of dynamically preparing a new fulfillment plan of claim 10, wherein:

the series of individual normalized updated demand signals include at least one individual normalized updated demand signal selected from a list consisting of a satisfied normalized updated demand signal, an exceeding normalized updated demand signal, and a demand undershoot demand signal.

12. The computer readable medium for performing the method of dynamically preparing a new fulfillment plan of claim 10, wherein:

the calculating a new fulfillment plan step uses at least one of the normalized updated demand signals of the series of individual normalized updated demand signals.

13. The computer readable medium for performing the method of dynamically preparing a new fulfillment plan of claim 12, wherein:

the series of individual normalized updated demand signals contains at least two normalized updated demand signals; and

at least one of the normalized updated demand signals of the series of individual normalized updated demand signals is given fulfillment preference over a remainder of normalized updated demand signals of the series of individual normalized updated demand signals during the calculating a new fulfillment plan step.

14. The computer readable medium for performing the method of dynamically preparing a new fulfillment plan of claim 13 wherein:

a satisfied normalized updated demand signal is given fulfillment preference over an exceeding normalized updated demand signal during the calculating a new fulfillment plan step.