• Non ci sono risultati.

Part II: non-periodic orders

N/A
N/A
Protected

Academic year: 2021

Condividi "Part II: non-periodic orders"

Copied!
43
0
0

Testo completo

(1)

Inventory Management

Claudio Arbib

Università dell’Aquila __________

Part II: non-periodic orders

(2)

Contents

Non-periodic problems

– equilibrium conditions

Cost functions A convex model

– LP formulation – example

A concave model

– properties of the polyhedron

– properties of optimal solutions

– Wagner-Whitin’s Algorithm

– examples

(3)

Non-periodic management

magazine

magazine plant plant

market market A plant must fulfill market

demand in different periods, minimizing production,

delivery and inventory costs

(4)

Non-periodic management

• For simplicity, consider

a single product type, to be manufactured in a finite planning horizon, divided in

control periods{1, 2, …, T}, corresponding to

a known demand d

1

, …, d

T

, variable with time, and to

decision variables

x

t

= amount produced/delivered in period t s

t

= stock level in period t

x

1

s

1

d

1

x

2

s

2

d

2

x

3

s

3

d

3

x

T

d

T

s

T–1

1 2 3 T

(5)

Non-periodic management

x

1

s

1

d

1

x

2

s

2

d

2

x

3

s

3

d

3

x

T

d

T

s

T–1

1 2 3 T

tempo Production chart

Delivery chart Stock level chart x1

x2

x3

d1

d2 d3

s1

s2

s3

(6)

Equilibrium conditions

x

1

s

1

d

1

x

2

s

2

d

2

x

3

s

3

d

3

x

T

d

T

s

T–1

1 2 3 T

x

1

= d

1

+ s

1

x

t

+ s

t–1

= d

t

+ s

t

t = 2, …, T – 1 x

T

+ s

T–1

= d

T

x

t

, s

t

> 0 t = 1, 2, …, T

• The values introduced are in the following relation

possible initial and/or final stock

+ s

0

+ s

T

(7)

Cost function

The solution technique depends on the form of the cost function.

Let f: IR

n

→ IR, and λ

1

, …, λ

m

> 0 such that Σ λ

i

= 1.

Let x

1

, …, x

m

∈ IR

n

. We say that f is

m i=1

f (x

2

)

x

1

x

2

f (x

1

)

x = λ x

1

+ (1 – λ )x

2

f (x)

λ f(x

1

) + (1 – λ )f (x

2

)

• convex if

f ( Σ

i

λ

i

x

i

) < Σ

i

λ

i

f (x

i

)

(8)

Cost function

The solution technique depends on the form of the cost function.

Let f: IR

n

→ IR, and λ

1

, …, λ

m

> 0 such that Σ λ

i

= 1.

Let x

1

, …, x

m

∈ IR

n

. We say that f is

m i=1

f (x

2

)

x

1

x

2

f (x

1

)

• concave if instead

f ( Σ

i

λ

i

x

i

) > Σ

i

λ

i

f (x

i

)

x = λ x

1

+ (1 – λ )x

2

f (x)

λ f(x

1

) + (1 – λ )f (x

2

)

(9)

x f (x)

Cost function

For instance, the following

• are convex functions

• are neither concave nor convex

x f (x)

• are concave functions

x

f (x)

(10)

A piecewise-linear convex model

• inventory costs G

t

(s

t

), proportional to the stock level

g

t

cost per each unit held in during period t

x

t

, b

t

• production costs P

t

(x

t

) with the following form

p

t

cost per unit produced up to quantity q

t

P

t

> p

t

extra cost per unit produced beyond q

t

(overtime labor)

p

t

x

t

q

t

P

t

(x

t

)

p

t

q

t

+ P

t

(x

t

– q

t

) G

t

(s

t

)

g

t

s

t

Suppose that the activities of

day t entail

(11)

Objective

The objective is to minimize the total (non linear) cost

min P

1

(x

1

) + P

2

(x

2

) + … + P

T–1

(x

T–1

) + P

T

(x

T

) + + G

1

(s

1

) + G

2

(s

2

) + … + G

T–1

(s

T–1

)

In order to obtain a linear cost function, let us distinguish

between the part of x

t

(say u

t

) produced without overtime labor and that (say w

t

) produced with overtime labor:

x

t

= u

t

+ w

t

0 < u

t

< q

t

, 0 < w

t

min p

1

u

1

+ p

2

u

2

+ … … … … + p

T

u

T

+

+ P

1

w

1

+ P

2

w

2

+ … … … … + P

T

w

T

+

+ g

1

s

1

+ g

2

s

2

+ … + g

T–1

s

T–1

(12)

Minimize the total cost

Σ

t=1,..,T

[P

t

(x

t

) + G

t

(b

t

)]

assuming zero backlog ( s

t

> 0 per t = 1, …, T )

and with the constraint of fulfilling the demand (equilibrium equations)

min p

1

u

1

+ p

2

u

2

+ … … … … + p

T

u

T

+ + P

1

w

1

+ P

2

w

2

+ … … … … + P

T

w

T

+ + g

1

s

1

+ g

2

s

2

+ … + g

T–1

s

T–1

subject to

u

t

+ w

t

+ s

t–1

s

t

= d

t

u

t

< q

t

u

t

, w

t

, s

t

> 0 for t = 1, …, T

Problem

(13)

Example ( data )

Period jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

Production cost 25 25 30 40 20 20

Extra cost 40 45 45 50 40 45

Inventory cost 25 20 30 30 30 30

Plant capacity 100 100 100 100 120 120

Demand 80 210 315 270 240 120

(14)

Example ( constraints )

Period jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

Demand 80 210 315 270 240 120

Plant capacity 100 100 100 100 120 120

u Ordinary production w Overtime production

Present stock Previous stock

1 1 1 1 1 1

1 1 1 1 1 1

-1 -1 -1 -1 -1 -1

1 1 1 1 1 1

Reference

Equilibrium equations s

0

= SUMPRODUCT(C13:C16,C8:C11) =

80

80

(15)

Example ( cost )

Period jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

Production cost 25 25 30 40 20 20

Extra cost 40 45 45 50 40 45

Inventory cost 25 20 30 30 30 30

u Ordinary production w Overtime production

Present stock Previous stock

Total cost s

= SUMPRODUCT(C4:H6,C8:H10)

0

(16)

A concave model

• In general the production cost in a period t does not only

depend on the amount manufactured: producing any amount, even a small one, entails a fixed cost; the same is for inventory cost (in which one can include material handling, magazine rental etc.)

• Due to economy of scale, however, passing from a production (inventory) level of 10 units to 20 costs less than passing from zero production to producing 10 units

• Last, we can imagine that, sometimes, the day production and stock are not sufficient to cover demand. In this case (backlog

= negative stock level), orders can be fulfilled by calling, at an additional cost, freight from other plants

• To take into account all these issues, the cost function must be

modified

(17)

A concave model

• inventory costs G

t

(s

t

)

γ

t

fixed holding cost + cost for maintaining a specific amount σ

t

fixed backlog cost + cost of the amount ordered outside

x

t

, s

t

G

t

(s

t

)

σ

t

γ

t

P

t

(x

t

)

π

t

• production costs P

t

(x

t

)

π

t

fixed cost to activate production in period t

+ operational cost to produce a specific amount

Here we assume that the costs associated with the activities

of day t have the following form:

(18)

x

1

= d

1

+ s

1

x

2

+ s

1

= d

2

+ s

2

x

3

+ s

2

= d

3

+ s

3

x

T

+ s

T–1

= d

T

Properties of the polyhedron

Σ

t=1T

x

t

= Σ

t=1T

d

t

, x

t

> 0

Property 1 The polyhedron of this problem is limited

(NB: even if s

t

is not constrained non-negative)

s

t

= Σ x

k

Σ d

k

|s

t

| <

k<t k<t

x

1

+ x

2

+ x

3

= Σ d

i

x

1

, x

2

, x

3

> 0

3

i=1

x

⇒ |x

t

| < ∞

(19)

Properties of the polyhedron

Property 2 A concave function defined on a limited polyhedron has a minimum point in a vertex

P

f (x)

*

minimum

(20)

Proof

• Given a limited polyhedron P, let v

1

, …, v

p

be its vertices:

P = conv(v

1

, …, v

p

)

that is, each yP, and therefore a point y* of minimum of f in P, can be expressed as convex combination of the vertices of P:

• Then, if v* is a minimum of f in {v

1

, …, v

p

}, one has

• But if f is concave one has

f( y* ) = f ( Σ

i=1..p

λ

i

v

i

) > Σ

i=1..p

λ

i

f (v

i

)

y* = Σ λ

i

v

i

with Σ λ

i

= 1, λ

i

> 0

p i=1

p i=1

f (v*) < Σ λ

i

f (v

i

) < f (y*)

p i=1

hence also v* is a minimum of f in P

(21)

A property of optimal solutions

• z* = (x*, s*) vertexz* basic solution of Az = d z > 0

where A is a T × (2T – 1) matrix In other words, no more than T components of z* are > 0

• If the initial stock level is s

0

= 0, it follows

x

1

> d

1

> 0 s

t–1

+ x

t

> d

t

> 0

i.e., at least one between s

t–1

and x

t

must be > 0 for t = 2, …, T In other words, at least T components of z* are > 0

• Exactly one between s

t–1

and x

t

must be > 0 for t = 2, …, T

(22)

… and pauses production periods…

s

k

d

k

d

t

s

t–1

k t

x

i

d

i

s

k–1

d

k–1

x

k–1

i k–1

A property of optimal solutions

From the argument above one derives that every optimal solution

has the following structure:

(23)

Algorithm ( Wagner-Whitin, 1958 )

1) Compute the amount x

i

necessary to fulfill the demand from day i to day t

i+1 t

s

i+1

d

i+1

d

t

s

t–1

s

i

i

d

i

x

i

= d

i

+ d

i+1

+ … + d

t

(24)

Algorithm

2) Compute the amounts s

i

, s

i+1

, …, s

t–1

that one has to stock in order to fulfill d

i+1

, d

i+2

, …, d

t

i+1 t

d

i+1

d

t

i

d

i

x

i

s

i+1

= d

i+2

+ … + d

t

s

t–1

= d

t

s

i

= d

i+1

+ … + d

t

(25)

Algorithm

3) Compute the cost of producing (holding) on day i enough products to fulfill the demand from i to t:

C(i, t) = P

i

(x

i

) + G

i

(s

i

) + G

i+1

(s

i+1

) + … + G

t–1

(s

t–1

) 4) Suppose to know the minimum costs c

0

, c

1

, …, c

k–1

to be borne if one wants to fulfill the demand in a planning horizon of 0, 1, …, k–1 days

(initially, c

0

= 0) 5) Then the cost borne to fulfill the demand up to day k is

given by

c

k

= min

i=1,…,k

{c

i–1

+ C(i, k)}

(26)

Computing c k

Minimum among:

1 c

1

1 2 c

2

1 k–2 c

k–2

+ C(k–1, k) k–1 k

+ C(2, k) 2 k–2 k–1 k

+ C(3, k) 3 k–2 k–1 k

+ C(1, k) 1 2 k–2 k–1 k

c

0

= 0

1 k–1 c

k–1

+ C(k, k) k

(27)

Example 1

cost

level

1

x

1

s

1

5

1/2

1/3

x

2

2

s

2

3

1/3 2/3

3

x

3

s

3

4

2/3

1/6

s

4

4

x

4

6

1/6 2/3

5

x

5

2

1

= 10

(28)

Example 1

cost

level

1/2

1/3 1/3

2/3 2/3

1/6

1/6 2/3

1

= 10 Construct matrix C of the C(i, t)’s

P

1

(d

1

) P

1

(d

1

+ d

2

) + G

1

(d

2

) P

1

(d

1

+ d

2

+ d

3

) + G

1

(d

2

+ d

3

) + G

2

(d

3

) … P

2

(d

2

) P

2

(d

2

+ d

3

) + G

2

(d

3

) …

C = P

3

(d

3

) …

Production of day 1, covering the amount required in days 1, 2 e 3

Inventory on day 1 to cover the amount required in days 2 e 3

Inventory on day 2 to cover the amount required in day 3

(29)

Example 1

cost

level

1/2

1/3 1/3

2/3 2/3

1/6

1/6 2/3

1

= 10

d

1

= 5 d

2

= 3 d

3

= 4 d

4

= 6 d

5

= 2

P

1

(d

1

) P

1

(d

1

+ a

2

) + G

1

(d

2

) P

1

(d

1

+ d

2

+ d

3

) + G

1

(d

2

+ d

3

) + G

2

(d

3

) … P

2

(d

2

) P

2

(d

2

+ d

3

) + G

2

(d

3

) …

C = P

3

(d

3

) …

P

1

(5) P

1

(8) + G

1

(3) P

1

(12) + G

1

(7) + G

2

(4) P

2

(3) P

2

(7) + G

2

(4)

P

3

(4)

(30)

Example 1

cost

level

1/2

1/3 1/3

2/3 2/3

1/6

1/6 2/3

1

= 10

d

1

= 5 d

2

= 3 d

3

= 4 d

4

= 6 d

5

= 2 C =

(15 + 5) (15 + 8) + (10 + 3) (15 + 12) + (10 + 7) + (5 + 4) (10 + 3) (10 + 7) + (5 + 4)

(15 + 4)

1 3

2 3 1

2

1 3 2 3 1 2

1 3 1

3 1 2

2 3

C(1,1) = 17 ,5 C(1,2) = 30 ,0 C(1,3) = 41 ,0 … C(2,2) = 11 ,0 C(2,3) = 20 ,0 … C(3,3) = 17 ,7 …

(31)

Example 1

cost

level

1/2

1/3 1/3

2/3 2/3

1/6

1/6 2/3

1

= 10 Based on the C(i, t)’s we can now compute:

c

1

= C(1, 1) = 17 ,5

c

2

= min{C(1, 2); c

1

+ C(2, 2)} = min{30 ,0 ; 17 ,5 + 11 ,0 } = 28 ,5

c

3

= min{C(1, 3); c

1

+ C(2, 3); c

2

+ C(3, 3)} =

= min{41 ,0 ; 17 ,5 + 20 ,0 ; 28 ,5 + 17 ,7 } = 37 ,5

… and so on

(32)

Example 1

Based on the C(i, t)’s we can now compute:

c

1

= C(1, 1) = 17 ,5

c

2

= min{C(1, 2); c

1

+ C(2, 2)} = min{30 ,0 ; 17 ,5 + 11 ,0 } = 28 ,5

c

3

= min{C(1, 3); c

1

+ C(2, 3); c

2

+ C(3, 3)} =

= min{41 ,0 ; 17 ,5 + 20 ,0 ; 28 ,5 + 17 ,7 } = 37 ,5

… and so on

… and so on

Up to T = 1 the optimal solution is clearly……..

5

1

5

Up to T = 3 the optimal solution is ..……

7

2

3

3

4 5 4

1

5

Up to T = 2 the optimal solution is………

5

1

5

2

3

3

(33)

Example 2 ( data )

jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

fixed 25 25 30 40 20 20

per unit up to Q 400 450 540 500 400 420

per unit over Q 120 140 180 170 140 150

Inventory cost per unit 250 200 300 300 300

300 250 250 200 200 200

80 210 315 270 240 120

Production cost

Q Demand

0 20.000 40.000 60.000 80.000 100.000 120.000 140.000 160.000 180.000 200.000

50 150 250 350 450 550 650 750

production cost in the first two months inventory cost in the first two months

(34)

Example 2 ( computing P t )

jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

fixed 25 25 30 40 20 20

per unit up to Q 400 450 540 500 400 420

per unit over Q 120 140 180 170 140 150

Inventory cost per unit 250 200 300 300 300

80 210 315 270 240 120

from 1 to t 80 290 605 875 1115 1235

from 2 to t 210 525 795 1035 1155

from 3 to t 315 585 825 945

from 4 to t 270 510 630

from 5 to t 240 360

from 6 to t 120

300 250 250 200 200 200

from 1 to t from 2 to t from 3 to t from 4 to t from 5 to t from 6 to t Production cost

Cumulative demand Production cost

Demand

Q

= SEGNO(G9)*$E$2 + SE(G9 <= $E$15; $E$3*G9; $E$3*$E$15+ $E$4*(G9$E$15))

G

2 3 4

9

15

E

(35)

Example 2 ( computing P t )

jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

fixed 25 25 30 40 20 20

per unit up to Q 400 450 540 500 400 420

per unit over Q 120 140 180 170 140 150

Inventory cost per unit 250 200 300 300 300

80 210 315 270 240 120

from 1 to t 80 290 605 875 1115 1235

from 2 to t 210 525 795 1035 1155

from 3 to t 315 585 825 945

from 4 to t 270 510 630

from 5 to t 240 360

from 6 to t 120

300 250 250 200 200 200

from 1 to t from 2 to t from 3 to t from 4 to t from 5 to t from 6 to t Production cost

Cumulative demand Production cost

Demand

Q

= SEGNO(G9)*$E$2 + SE(G9 <= $E$15; $E$3*G9; $E$3*$E$15+ $E$4*(G9$E$15))

G

2 3 4

9

15

E

Production_cost(2,4)

(36)

Example 2 ( computing G t )

jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

fixed 25 25 30 40 20 20

per unit up to Q 400 450 540 500 400 420

per unit over Q 120 140 180 170 140 150

Inventory cost per unit 250 200 300 300 300

80 210 315 270 240 120

from 1 to t 80 290 605 875 1115 1235

from 2 to t 210 525 795 1035 1155

from 3 to t 315 585 825 945

from 4 to t 270 510 630

from 5 to t 240 360

from 6 to t 120

300 250 250 200 200 200

from 1 to t from 2 to t from 3 to t from 4 to t from 5 to t from 6 to t Inventory cost

Cumulative demand Production cost

Demand

Q

= MATR.PRODOTTO(D$5:D$5;E9:E9)

D E

5

9

(37)

Example 2 ( computing G t )

jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

fixed 25 25 30 40 20 20

per unit up to Q 400 450 540 500 400 420

per unit over Q 120 140 180 170 140 150

Inventory cost per unit 250 200 300 300 300

80 210 315 270 240 120

from 1 to t 80 290 605 875 1115 1235

from 2 to t 210 525 795 1035 1155

from 3 to t 315 585 825 945

from 4 to t 270 510 630

from 5 to t 240 360

from 6 to t 120

300 250 250 200 200 200

from 1 to t from 2 to t from 3 to t from 4 to t from 5 to t from 6 to t Inventory cost

Cumulative demand Production cost

Demand

Q

= MATR.PRODOTTO(D$5:E$5;F9:F10)

D E F

5

9 10

(38)

Example 2 ( computing G t )

jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

fixed 25 25 30 40 20 20

per unit up to Q 400 450 540 500 400 420

per unit over Q 120 140 180 170 140 150

Inventory cost per unit 250 200 300 300 300

80 210 315 270 240 120

from 1 to t 80 290 605 875 1115 1235

from 2 to t 210 525 795 1035 1155

from 3 to t 315 585 825 945

from 4 to t 270 510 630

from 5 to t 240 360

from 6 to t 120

300 250 250 200 200 200

from 1 to t from 2 to t from 3 to t from 4 to t from 5 to t from 6 to t Inventory cost

Cumulative demand Production cost

Demand

Q

= MATR.PRODOTTO(D$5:H$5;I9:I13)

D E F G H I

5

9 10 11 12 13

(39)

Example 2 ( computing G t )

jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

fixed 25 25 30 40 20 20

per unit up to Q 400 450 540 500 400 420

per unit over Q 120 140 180 170 140 150

Inventory cost per unit 250 200 300 300 300

80 210 315 270 240 120

from 1 to t 80 290 605 875 1115 1235

from 2 to t 210 525 795 1035 1155

from 3 to t 315 585 825 945

from 4 to t 270 510 630

from 5 to t 240 360

from 6 to t 120

300 250 250 200 200 200

from 1 to t from 2 to t from 3 to t from 4 to t from 5 to t from 6 to t Inventory cost

Cumulative demand Production cost

Demand

Q

= MATR.PRODOTTO(E$5:F$5;G10:G11)

E F G

5

10 11

Inventory_cost(2,4)

(40)

Example 2 ( computing C(i, t) )

jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

fixed 25 25 30 40 20 20

per unit up to Q 400 450 540 500 400 420

per unit over Q 120 140 180 170 140 150

Inventory cost per unit 250 200 300 300 300

80 210 315 270 240 120

300 250 250 200 200 200

C(i, t) jan-feb mar-apr may-jun jul-aug sep-oct nov-dec jan-feb

mar-apr may-jun jul-aug sep-oct nov-dec Production cost

Demand Q

C(2, 4)

= Production_cost(2, 4) + Inventory_cost(2, 4)

(41)

Example 2 ( solution )

jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

fixed 25 25 30 40 20 20

per unit up to Q 400 450 540 500 400 420

per unit over Q 120 140 180 170 140 150

Inventory cost per unit 250 200 300 300 300

80 210 315 270 240 120

300 250 250 200 200 200

C(i, t) jan-feb mar-apr may-jun jul-aug sep-oct nov-dec jan-feb C(1, 1) C(1, 2) C(1, 3) C(1, 4) C(1, 5) C(1, 6) mar-apr C(2, 2) C(2, 3) C(2, 4) C(2, 5) C(2, 6)

may-jun C(3, 3) C(3, 4) C(3, 5) C(3, 6)

jul-aug C(4, 4) C(4, 5) C(4, 6)

sep-oct C(5, 5) C(5, 6)

nov-dec C(6, 6)

c1 c2 c3 c4 c5 c6

minimum cost Production cost

Demand Q

12

D

= D$12

(42)

Example 2 ( solution )

jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

fixed 25 25 30 40 20 20

per unit up to Q 400 450 540 500 400 420

per unit over Q 120 140 180 170 140 150

Inventory cost per unit 250 200 300 300 300

80 210 315 270 240 120

300 250 250 200 200 200

C(i, t) jan-feb mar-apr may-jun jul-aug sep-oct nov-dec jan-feb C(1, 1) C(1, 2) C(1, 3) C(1, 4) C(1, 5) C(1, 6) mar-apr C(2, 2) C(2, 3) C(2, 4) C(2, 5) C(2, 6)

may-jun C(3, 3) C(3, 4) C(3, 5) C(3, 6)

jul-aug C(4, 4) C(4, 5) C(4, 6)

sep-oct C(5, 5) C(5, 6)

nov-dec C(6, 6)

c1 c2 c3 c4 c5 c6

minimum cost Production cost

Demand Q

= MIN(E$12; D19 + E$13)

D E

12 13

19

(43)

Example 2 ( solution )

jan-feb mar-apr may-jun jul-aug sep-oct nov-dec

fixed 25 25 30 40 20 20

per unit up to Q 400 450 540 500 400 420

per unit over Q 120 140 180 170 140 150

Inventory cost per unit 250 200 300 300 300

80 210 315 270 240 120

300 250 250 200 200 200

C(i, t) jan-feb mar-apr may-jun jul-aug sep-oct nov-dec jan-feb C(1, 1) C(1, 2) C(1, 3) C(1, 4) C(1, 5) C(1, 6) mar-apr C(2, 2) C(2, 3) C(2, 4) C(2, 5) C(2, 6)

may-jun C(3, 3) C(3, 4) C(3, 5) C(3, 6)

jul-aug C(4, 4) C(4, 5) C(4, 6)

sep-oct C(5, 5) C(5, 6)

nov-dec C(6, 6)

c1 c2 c3 c4 c5 c6

minimum cost Production cost

Demand Q

= MIN(F$12; D$19 + F$13; E$19 + F$14)

D E F

12 13 14

19

Riferimenti

Documenti correlati

Since the aim of this research is to prove the effectiveness of abrasive recycling with an economical approach, the final result will be the economics of the recycled GMA

This assembly system is confined in a controlled environment and consists, at the moment, of an assembly station equipped with various grippers (on the basis of the assembly tasks

In tali studi sono stati analizzati i vantaggi e le problematiche legate alla manipolazione delle pelli e proposto un nuovo sistema d’accatastamento automatico che risolva il

Directed Polymer, Pinning Model, Polynomial Chaos, Disordered System, Fourth Moment Theorem, Marginal Disorder Relevance, Stochastic Heat

of Mathematics, Computer Science, and Physics University of Udine, Italy. Course on Data Management for

In fact, despite the frequency limitation of 1 Hz, the comparison between observed and calculated intensities, obtained from ground motion scenarios, points toward a strike-slip

(1) University of Trieste, Dipartimento di Matematica e Geoscienze, trieste, Italy (lara.tiberi@gmail.com), (2) Geological Survey of Slovenia, Department for Regional

When there is no crashing of setup cost i.e. The lead-time data contains the normal duration and minimum duration with the respective crashing cost given in table 1. Lead time