Task 879.1: Intelligent Demand Aggregation and Forecasting Task - - PowerPoint PPT Presentation

task 879 1 intelligent demand aggregation and forecasting
SMART_READER_LITE
LIVE PREVIEW

Task 879.1: Intelligent Demand Aggregation and Forecasting Task - - PowerPoint PPT Presentation

SRC Project 879 Progress Report March 2003 Task 879.1: Intelligent Demand Aggregation and Forecasting Task Leader: Argon Chen Co-Investigators: Ruey-Shan Guo Shi-Chung Chang Students: Janet Cheng, Odey Ho, Legend Fu, Tony Huang, Kyle Yang 1


slide-1
SLIDE 1

1

Task 879.1: Intelligent Demand Aggregation and Forecasting

Task Leader: Argon Chen Co-Investigators: Ruey-Shan Guo Shi-Chung Chang Students: Janet Cheng, Odey Ho, Legend Fu, Tony Huang, Kyle Yang

SRC Project 879 Progress Report March 2003

slide-2
SLIDE 2

2

Outline

Prior work: Demand Planning Hierarchy (DPH)

Product Hierarchy DPH Extension for Product Hierarchy DPH Analysis System Prototype Feature Works

slide-3
SLIDE 3

3

Problem Description

Strategies for Demand Planning:

Top-down approach Bottom-up approach Middle-out approach

Problems:

What dimension should be considered to

aggregate/disaggregate first?

What’s the difference?

Objectives:

Define Demand Planning Views Develop an optimal strategy for Demand Planning:

Demand Planning Hierarchy (DPH)

slide-4
SLIDE 4

4

Demand Planning Hierarchy (DPH)

Example:

Two demands views:

Time and Geography

Strategy: Top-down

  • Path 1: break down along

Geography View first, then along Time View

  • Path 2: break down along Time

View first, then along Geography View

  • Path 3: ……

Question: which path?

Demand Planning Hierarchy: Sequence of Aggregation Levels

slide-5
SLIDE 5

5

Representation of Demand Views

View with Hierarchical Levels: e.g. time horizon (necessary), geography view, etc.. Notation: VIEWlevel1•level2 Example: TIMEYear•Quarter•Month•Week GEOGRAPHYContinent•Country•City View with Attributes: e.g. product type Notation: VIEWattribute × attribute Example: PRODUCTGeneration × Function × Technology View with Mixed Attributes Example: PRODUCT(Generation × Function × Technology) •PartNumber

slide-6
SLIDE 6

6

DPH Evaluation Metric: Actual Demand Fluctuation

Coefficient of Variation (CV): Weighted Average CV: by demand volume

Std.Dev of demand (σ) Mean of demand (µ)

CV = = degree of fluctuation

n n i i n n i i n i i

CV CV CV ⋅ + + ⋅ + ⋅

∑ ∑ ∑

= = = 1 2 1 2 1 1 1

µ µ µ µ µ µ L

Weighted-average CV values at all levels are averaged to represent the demand stability of a DPH

slide-7
SLIDE 7

7

Case Study

Demand Views

Product: ASIC Views with Hierarchical Levels:

Time: Quarter, Month, Week Customer: Geocorp Geography (GG), Geocorp Code (GC)

View with Mixed Attributes:

Product: Technology (T), Number of Metal Layers(L), Package (P); PartNum is hierarchical to the combination of T, L, P

slide-8
SLIDE 8

8

Least-Fluctuation DPH

Dynamic programming search:

TimeQuarter•Month x CustomerGG x ProductAll TimeQuarter•Month x CustomerGG•GC x ProductAll TimeQuarter•Month x CustomerGG•GC x ProductL TimeQuarter•Month x CustomerGG•GC x ProductLxT TimeQuarter•Month x CustomerGG•GC x ProductLxTxP TimeQuarter•Month•Week x CustomerGG•GC x Product LxTxP TimeQuarter•Month•Week x CustomerGG•GC x Product (LxTxP)•PartNum TimeQuarter x CustomerGG x ProductAll TimeQuarter x CustomerAll x ProductAll

Inflation(%)

  • W. Avg. CV

1.48

  • 0.68

12.30 41.15 1.60 11.16 39.80 72.61 Shrinkage(%)

  • W. Avg. CV

1.46

  • 0.68

10.92 29.13 1.57 10.04 28.47 42.07 Value

  • W. Avg. CV

0.731 0.726 0.815 1.150 1.169 1.299 1.817 3.136 0.720

  • Avg. of W. Avg. CV: 1.284784
  • Avg. of Sum of Std. Dev: 3,295,969.3
slide-9
SLIDE 9

9

DPH Extension - Motivation

Prior work: DPH for only one product type DPH for an entire product hierarchy?

A product hierarchy example

All Desktop Server Notebook Home Business

CPU, Memory,.. Power Power No of CPU, Hard disk type Pointer device LCD type/size, … Hard disk type, Monitor type

slide-10
SLIDE 10

10

Outline

Prior work: Demand Planning Hierarchy (DPH)

Product Hierarchy

DPH Extension for Product Hierarchy DPH Analysis System Prototype Feature Works

slide-11
SLIDE 11

11

Product Hierarchy

Product Differentiation

Base on the substitutive and/or heterogeneous properties

  • f different products, we can classify and arrange all

products into a product hierarchy

Product Hierarchy

Hierarchical product differentiation Example:

All Desktop Server Notebook Home Business

CPU, Memory,.. Power Power No of CPU, Hard disk type Pointer device LCD type/size, … Hard disk type, Monitor type

slide-12
SLIDE 12

12

Common Attributes in Product Hierarchy

Common Attributes

It is possible for different nodes have the same

product attributes

We may like to raise some of the attribute to a

higher planning level that called common attribute

Desktop Home CPU, Motherboard…… Business CPU, Motherboard …… Desktop CPU Home Motherboard… BusinessMotherboard… Common Attribute Common Attribute Private Attributes Private Attributes

slide-13
SLIDE 13

13

A Semiconductor Example

ASIC RR RQ Memory All

Package Technology, Levels of Metal, Size Target Appl, Processor, Speed

slide-14
SLIDE 14

14

A DPH Solution

ProductAll x TimeYear x CustomerAll ProductAll x TimeYear x CustomerGG ProductASIC x TimeYear x CustomerGG ProductMemory x TimeYear x CustomerGG ProductASIC(Package) x TimeYear x CustomerGG•GC ProductMemory(Package) x TimeYear x CustomerGG•GC ProductASIC(Package, Levls of Metal) x TimeYear x CustomerGG•GC ProductMemory(Package, Target Appl) x TimeYear x CustomerGG•GC

ProductASIC(Package, Levls of Metal, Technology) x TimeYear x CustomerGG•GC ProductRR(Package, Target Appl) x TimeYear x CustomerGG•GC ProductRQ(Package, Target Appl) x TimeYear x CustomerGG•GC ProductASIC(Package, Levls of Metal, Technology, Size) x TimeYear x CustomerGG•GC ProductRR(Package, Target Appl, Processor) x TimeYear x CustomerGG•GC ProductRQ(Package, Target Appl, Processor) x TimeYear x CustomerGG•

ProductASIC x TimeYear x CustomerGG•GC ProductMemory x TimeYear x CustomerGG•GC

slide-15
SLIDE 15

15

Outline

Prior work: Demand Planning Hierarchy (DPH) Product Hierarchy

DPH Extension for Product Hierarchy

DPH Analysis System Prototype Feature Works

slide-16
SLIDE 16

16

Balanced DPH – Example

ProductAll ProductAll(Package) ProductASIC(Package) ProductMemory(Package) ProductASIC(Package, Size) ProductMemory(Package, Speed) ProductRR(Package, Speed) ProductRQ(Package, Speed) ProductASIC(Package, Size, Technology) For every branches, disaggregate by For every branches, disaggregate by

  • ne of the attributes or one of the middle nodes
  • ne of the attributes or one of the middle nodes

Product Hierarchy

slide-17
SLIDE 17

17

Unbalanced DPH – Example

We focus on product dimension only

Product Hierarchy

ProductAll ProductAll(Package) ProductASIC(Package) ProductMemory(Package) ProductASIC(Package, Size) ProductMemory(Package) ProductASIC(Package,Size) ProductMemory(Package, Speed)

Disaggregate by one of the Disaggregate by one of the middle nodes or one of the middle nodes or one of the attributes at one step attributes at one step

slide-18
SLIDE 18

18

Optional Planning Constrains

There are optional constrains that can be set

to prevent irrational hierarchical relations

Example

ProductAll ProductASIC ProductMemory ProductASIC(Package)ProductMemory(Speed) ProductAll ProductASIC ProductMemory ProductASIC(Package)ProductMemory(Package) ProductAll(Package) ProductASIC ProductMemory

slide-19
SLIDE 19

19

Outline

Prior work: Demand Planning Hierarchy (DPH) Product Hierarchy DPH Extension for Product Hierarchy

DPH Analysis System Prototype

Feature Works

slide-20
SLIDE 20

20

System Architecture

Data Warehouse OLTP / Data Mart OLTP / Data Mart OLTP / Data Mart OLAP Meta Data Demand Planning Hierarchy System Application MDX Query Result Dataset Pre-process of product data Dimension Information T-SQL Result Dataset

DPH system, OLAP database, metadata database

can be located in one system or separated systems

Platform: .NET; Language: C#

DPH System DPH System – – System Architecture System Architecture

slide-21
SLIDE 21

21

DPH System Preview

Planning Flow

Create a New Project

  • New Project Wizard

Allocate Dimensions Solve DPH Network

  • Top-down Greedy Search
  • Button-up Greedy Search
  • Dynamic Programming

Search

DPH System DPH System – – User Interface User Interface

slide-22
SLIDE 22

22

DPH System Demo

New Project Wizard Dimension Allocation Solve DPH Network

slide-23
SLIDE 23

23

New Project Wizard

Step 1 of 5:

DPH System DPH System – – New Project Wizard New Project Wizard

slide-24
SLIDE 24

24

New Project Wizard (cont.)

Step 2 of 5:

DPH System DPH System – – New Project Wizard New Project Wizard

slide-25
SLIDE 25

25

New Project Wizard (cont.)

Step 3 of 5:

DPH System DPH System – – New Project Wizard New Project Wizard

slide-26
SLIDE 26

26

New Project Wizard (cont.)

Step 4 of 5:

DPH System DPH System – – New Project Wizard New Project Wizard

slide-27
SLIDE 27

27

New Project Wizard (cont.)

Step 5 of 5:

DPH System DPH System – – New Project Wizard New Project Wizard

slide-28
SLIDE 28

28

Dimension Allocation

Step 1 of 2:

slide-29
SLIDE 29

29

Dimension Allocation (cont.)

Step 2 of 2:

slide-30
SLIDE 30

30

Solve DPH Network

UI 1 of 2:

DPH System DPH System – – Top Top-

  • Down Search: Calculation

Down Search: Calculation

slide-31
SLIDE 31

31

Solve DPH Network (cont.)

UI 2 of 2:

DPH System DPH System – – Top Top-

  • Down Search: Result

Down Search: Result

slide-32
SLIDE 32

32

Case Study

Dimension Considered:

Product Time Customer / Geography

Product Dimension

Total number of attributes*1:

8

  • Prior case: 4

Possible attribute

combination: 1,126,182,528

  • One-product case: 325,863

ASIC RR RQ Memory All

Package Technology, Levels of Metal, Size Target Appl, Processor, Speed

Case Study Case Study – – Product Hierarchy Product Hierarchy *1. Part Number is also considered

slide-33
SLIDE 33

33

Case Study – Performance

System Architecture: stand along

CPU: Pentium 4-m, 1.4G Memory: 512MB

Planning Strategy: Balanced DPH Solving Time Cost (H:M:S):

Weekly demand plan:

  • Top-down search: 0:3:19
  • Button-up search: 0:11:55
  • Dynamic programming search: 0:28:9

Daily demand plan:

  • Top-down search: 0:4:26
  • Button-up search: 1:15:50
  • Dynamic programming search: 2:22:22
slide-34
SLIDE 34

34

Case Study – DP Search

ProductAll x TimeYear x CustomerAll ProductAll x TimeYear x CustomerGG ProductASIC x TimeYear x CustomerGG ProductMemory x TimeYear x CustomerGG ProductASIC(Package) x TimeYear x CustomerGG•GC ProductMemory(Package) x TimeYear x CustomerGG•GC ProductASIC(Package, Levls of Metal) x TimeYear x CustomerGG•GC ProductMemory(Package, Target Appl) x TimeYear x CustomerGG•GC

ProductASIC(Package, Levls of Metal, Technology) x TimeYear x CustomerGG•GC ProductRR(Package, Target Appl) x TimeYear x CustomerGG•GC ProductRQ(Package, Target Appl) x TimeYear x CustomerGG•GC ProductASIC(Package, Levls of Metal, Technology, Size) x TimeYear x CustomerGG•GC ProductRR(Package, Target Appl, Processor) x TimeYear x CustomerGG•GC ProductRQ(Package, Target Appl, Processor) x TimeYear x CustomerGG•

ProductASIC x TimeYear x CustomerGG•GC ProductMemory x TimeYear x CustomerGG•GC

Left Sub-Tree Right Sub-Tree

slide-35
SLIDE 35

35

Case Study – DP Search (cont.)

Left sub-tree

ProductASIC(Package, Levls of Metal, Technology, Size) x TimeYear x CustomerGG•GC ProductASIC(Package, Levls of Metal, Technology, Size) x TimeYear x CustomerGG•GC ProductASIC((Package, Levls of Metal, Technology, Size)•PartNo) x TimeYear x CustomerGG•GC ProductASIC((Package, Levls of Metal, Technology, Size)•PartNo) x TimeYear•Quarter x CustomerGG•GC ProductASIC((Package, Levls of Metal, Technology, Size)•PartNo) x TimeYear•Quarter•Month x CustomerGG•GC ProductASIC((Package, Levls of Metal, Technology, Size)•PartNo) x TimeYear•Quarter•Month•Day x CustomerGG•GC

slide-36
SLIDE 36

36

Case Study – DP Search (cont.)

ProductRR(Package, Target Appl, Processor) x TimeYear x CustomerGG•GC ProductRQ(Package, Target Appl, Processor) x TimeYear x CustomerGG•GC ProductRR(Package, Target Appl, Processor, Speed) x TimeYear x CustomerGG•GC ProductRQ(Package, Target Appl, Processor, Speed) x TimeYear x CustomerGG•GC

ProductRR((Package, Target Appl, Processor, Speed) •PartNo) x TimeYear x CustomerGG•GC ProductRQ((Package, Target Appl, Processor, Speed) •PartNo) x TimeYear x CustomerGG•GC ProductRR((Package, Target Appl, Processor, Speed) •PartNo) x TimeYear•Quarter x CustomerGG•GC ProductRQ((Package, Target Appl, Processor, Speed) •PartNo) x TimeYear•Quarter x CustomerGG•GC ProductRR((Package, Target Appl, Processor, Speed) •PartNo) x TimeYear•Quarter•Month x CustomerGG•GC ProductRQ((Package, Target Appl, Processor, Speed) •PartNo) x TimeYear•Quarter•Month x CustomerGG•GC ProductRR((Package, Target Appl, Processor, Speed) •PartNo) x TimeYear•Quarter•Month•Day x CustomerGG•GC ProductRQ((Package, Target Appl, Processor, Speed) •PartNo) x TimeYear•Quarter•Month•Day x CustomerGG•GC

Right sub-tree

ProductMemory(Package, Target Appl) x TimeYear x CustomerGG•GC

ProductRR(Package, Target Appl) x TimeYear x CustomerGG•GC ProductRQ(Package, Target Appl) x TimeYear x CustomerGG•GC

slide-37
SLIDE 37

37

Feature Works

DPH - what-if analysis Computation time improvement