Supply Chain PN Optimization

Multi-objective optimization of
Supply Chain
L. AMODEO
Professor
University of Technology of Troyes
Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 70
References
§ Research develops in our Laboratory many years

§ Industrial contract with TYCO- SIMEL
§ Main Publications (3 chapters, 3 articles)
§ Sanchez D., Amodeo L., Prins C., Meta-heuristic Approaches for Multi-objective Simulation-based
Optimization in Supply Chain in Inventory Management, Artificial Intelligence Techniques for Networked
Manufacturing Enterprises Management, L. Benyoucef et B. Grabot (éd.), management, Springer Series in
Advanced Manufacturing, pp. 249-269, Springer, 2010.
§ Labadi K., Chen H., Amodeo L., Batch Deterministic and Stochastic Petri Nets and Transformation Analysis
Methods, in New Developments in Robotics Automation and Control, édité par A. Lazinica, I-Tech Education
and Publishing, 20 pages, 2008.
§ Amodeo L., Chen H., El Hadji A., Supply Chain Inventory Optimization with Multiple Objectives: An industrial
case study, Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management,
Studies in Computational Intelligence, Springer-Verlag, pp 211-230, 2008.
§ Labadi K., Chen H., Amodeo L., Modeling and Performance Evaluation of Inventory Systems using Batch
Deterministic and Stochastic Petri Nets, IEEE Transaction on Systems, Man, and Cybernetics - Part C:
Applications and Reviews, Vol 37(6), pp 1287- 1302, 2007.
§ Chen H., Amodeo L., Chu F. and Labadi K., Modelling and Performance Evaluation of Supply Chains using
Batch Deterministic and Stochastic Petri Nets, IEEE Transactions on Automation Science and Engineering,
Vol 2(2), pp 132-144, 2005.
§ Labadi K., Chen H., and Amodeo L., Application des BDSPN à la modélisation et à l'évaluation de
performance des chaînes logistiques, Journal Européen des Systèmes Automatisés, Vol 39, (7), pp 863-
886, 2005.

Study process
Application
Comparison and validation
!" !$
Performance
Modelization Evaluation Optimization
!#
(cost, service)
!%
Real Case or
project
(Supply chain) Linear programming Direct Exact Methods
State model Or indirecte Approach Methods
Markov Process Discrete (Heuristics -
Queuing files Event Metaheuristics)
Petri Nets Simulation
Introduction
§ For manufacturing companies, it is necessary to reduce costs while

improving customer services
§ to optimize the entire supply chain (from suppliers to customers)
Suppliers Producer Warehouse Customer
§ Supply chain optimization needs a modeling and performance evaluation tool

§ Capable of modeling the dynamic behavior, uncertainty,
material, information and financial flows and various
operational policies (production, inventory control).

Structure of the SC
Material flow
Financial flow
Information flow
Distributors
Producers
Suppliers (wholesaler, retailer)
Manufactories customers
Supply chain study
§ Why a new model?

§ After literature review: lack of suitable
models
§ Many operations in batch mode
§ Customer orders
§ Inventory replenishment
§ Distribution, delivery
§ Production process (lot sizing)
§ Flows evolve in batch quantities with
different and variable sizes

Supply chain study
§ Why a new Petri net model?

§ Existing Petri net models cannot well model DESs with batch
operations, particular for those with variable batch sizes
§ Supply chain is a discrete event system from a high level of
abstraction
§ Development of a new Petri net model
§ Takes into account 3 flows (Material, Financial, and Information)
and batch operations.
§ Called : Batch Deterministic and Stochastic Petri Net
Batch DSPN
• Extension of Deterministic and Stochastic

Petri Nets by introducing batch places and
batch tokens
• Batch tokens, residing in batch places, have
sizes and are viewed as different individuals
• Inhibitor arcs and marking-dependent arc
weights are incorporated in the model
§ Allow to keep the information
§ Quantities from supplier to customer

Batch DSPN
A Batch Deterministic and Stochastic PN is:

BDSPN = (P, T, I, O, V, W, P, D, µ0)
2
§ P = Pd U Pb: (set of discrete and batch places) 3
2
§ T = Ti U Td U Te: (set of immediate, deterministic and stochastic

transitions)
§ I, O, V: set of input, output and inhibitor arcs
§ W: weight for all arcs
§ P: priority function (for firing conflict)
§ D: firing delay of timed transitions
BDSPN- Marking
p1 p3
§ µ- Marking
t1
ìï n Î IN si p Î Pd
µ( p) = í 2 2
{
ïî µ µ Î IN
*
} si p Î Pb
p2
4
p4
§ M- Marking ì 3 ü é3ù
ï{2,2,4}ï ê8ú
ì µ ( p) si p Î Pd ï ï M0 = ê ú
ï µ0 = í ý ê0ú
M ( p) = í å µ
ïî µÎµ( p )
si p Î Pb ï 0 ï ê ú
ïî Æ ïþ ë0û

Transition enabling and firing
p1 2 p2 p1 p2 !"#$%"
Firing
1 1 1 1
2-enabling
2 t 3 2 t 3
&''
p3 p4 p3 6 p4
2x2 tokens 1 batch token

size 6 (2x3)
Transition enabling and firing
Discrete Transition • t Ç P = Æ
b
P1 P2 P1 P2
2 2
Firing
2 2
1 T 3 1 T 3
P3 P4 P3 3 P4
Batch Transition • t Ç P ¹ Æ
b
P1 P2
P1 2 P2 Firing
1 1
1 1
2 T 3
2 T 3
P3 6 P4
P3 P4

Batch firing
Stock of raw material

Stock of batch finished
T1 products
P1
P2
2 P3
Batch
3 process
Batch orders
of products
T1
P1
2
P2
Firing of de T1 with q = 2 2 P3
Batch firing
P1
Stock P4
of products: Type A T1 T2
P2
Stock 2 Batch
of products:Type B 3 assembling
3
P3
Customer
Batch orders
4
2 P5 P1
P4
T1 T2
2
P2
2
3
3
Firing of T1 with q = 2
P3
4
2 P5

State Equation
µ k +1 = µ k + W ´ F t1
4
p1
4 2
t3
4
p2
2 2
§ Caracteristic vector
t2
Firing of t3
ì 0 if i ¹ j With q= 4/2 = 2
F[]
i i=1à m =í k
îqj if i = j t3[2]
k
q Firing indice of Tj from µk
é ù é ù é ù
ê0ú
{}
j
é ù
ê{2,4} ú ê4 2 -2ú ê0ú ê2ú
ê ú + ê
4 úûú
´ ê ú= ê ú
ì 1 if upstream places are discrete ê
ë 0 ú
û ëê0 0 êê2úú ê8ú
qkj í
îb / W (P, Tj ) if upstream places are batch places ë û ë û
m : nb of transitions
Other developments
§ Qualitative analysis methods

§ Methods based on reachability graph (with µ-markings)
§ Reduction methods
§ Methods based on linear algebra (state equation, invariant of
marking)
§ Transformation methods (from BDSPN to SPN)
§ Performance evaluation
§ Analytical methods based on reachability graph (Markov
process)
§ Discrete event simulation

Performance analysis of BDSPNs
Two differents approaches

§ Analytical approach
Associated
stochastic process Studying the
BDSPN µ-marking Graph
(Markov chain, se stochastic process
mi-Markov chain,
§ Simulation approach etc)
Simulation of the Simulation results

BDSPN
model analysis
Exercice
§ Give the reachability of this BDSPN.
P1
P4
T1 T2
2
P2
3
2
2
P3
3
2 P5

Exercice - solution
1 T2(q=2) 1
T1(q=2)
3 3
3 {3} {3}
µ1 {2,2} µ3 {2}
9
µ0 {3,2} 0
4
{2} T2(q=2) 0
0 0
T1(q=3) 0
0
µ4 {2}
µ2 {2}
{3}
{2,3}
2
6
T2(q=3)
0
0
µ5
{2}
{2}
0
Production policies
§ Make to stock (stock of finished goods)

Production
Forecast Machine 1 Machine 2 Exit

T1 P1 T2 P2 T3 P3 T4 P4 T5
Upstream Downstream
Stock Stock
Customer Demand

Production policies
§ Make to order (no stock of finished goods)

Production
Input Machine 1 Machine 2 Ouput

T1 P1 T2 P2 T3 P3 T4 P4 T5
Upstream Downstream
Stock Stock
Customer demand
Lead time
Production policies
§ Assemble to order: stock of work-in-process

Production
Assembling
Forecast Machine 1 Machine Exit
T1 P1 T2 P2 T3 P3 T4 P4 T5
Upstream Downstream
stock stock
Customer
demand
Lead time
Assembly line
machine 1
Assembly machine 3
machine 2
T1 P1
T3 P3 T4
T2 P2 d
Demand
P4 T5
Inventory system
§ Stock FIFO
3 2 1
l µ
Arrival Exit
T1 P1 T2 P2 T3 P3 T4
l P4 P5 P6 µ

Inventory system
§ Stock LIFO
3 2 1
l µ
Arrival Exit
Inventory system
P4
§ Stock LIFO P5
T5 T7
P6
T1 P1 T2 P2 T3 P3 T4
l µ
P7
P8
T6 T8
Zhou, Di Cesare,1996
Queueing file M/M/1
System
§ Arrivals are Poisson process with
parameter: l Arrival Exit
§ Service time is a random process
(expo) with parameter: µ Queue Service
§ Single server
§ Unlimited queue capacity
Queue Service
T1 P1 T2 P2 T3
l P3 µ
Availability of the server

Queuing file M/M/2/5/6
§ 2 servers
§ Capacity of the queue: 5
§ Population of 6 customers
T1 Queue T2 T3
Service
l P3 µ

Inventory system modeling
§ (R, Q) inventory policy On-hand

inventory
Replenishment Delivery
T3 P2 T2 P1 T1
Material
Flow
P4 T4 P3 P5 T5
Q Information
Outstanding Q
Flow
order
R+M(P5)
Generation of Inventory Backorder

batch order level
Inventory system modeling
§ Example (2,4) On-hand

inventory
Replenishment Delivery
T3 P2 T2 P1 T1
P4 T4 P3 P5 T5
Outstanding 4 4
order
4 3
2+M(P5)
Generation of Inventory Backorder

batch order level

Industrial case study
§ Collaboration with Tyco Simel Company

§ The plant produces electrical connectors for
high voltage lines
junction
Junction with
with the pylon
electrical wire
Aluminum cylinder Flat of copper
Industrial case study
§ Configuration of the supply chain

Customer 1
Upstream
Supplier 1
transporter 1
Upstream Downstream
Supplier 2 Manufacturer Customer i
transporter 2 transporter
Upstream
Supplier 3
transporter 3 Customer n
Logistic Process
Welding by friction
BDSPN Model
Stock 1
Supplier 1
Demand
Supplier 2
Information
Assembling Flow
Supplier 3 Material
flow
Paiement
Producer –
supplier
Financial
flow
Material flow
Supplier 1 Transporter 1
Supplier 2 Transporter 2
Supplier 3 Transporter 3 Manufacturer Transporter
Assembly Packaging
Raw materials Finished product
Information flow
Inventory policy
Transporter Stock 2 Assembly
Stock S2 : flats
Outstanding Inventory position

orders
Generation of
Purchase orders
§ Information of outstanding and delivered orders

§ Customer order arrival
Financial flow
Transition: Payment between each entity of the supply chain
Batch place: Information of the orders delivered
Discrete place: Available money Finished

product
Producer delivered
Raw material Raw material to transporter
transported delivered
Produccer
to manufacturer
Producer Supplier Producer Manufacturer Customer

to transporter to supplier
Performance evaluation
§ Obtained by simulation, developed in C++

§ Data
§ Lead times: replenishment (40, 20, 70, 20) and 2 days for
transportation
§ Average demand: 845 pieces/month (l = 0.0355)
§ Prices and holding costs (12%)
§ Periodic review batch ordering policy (each week)
§ Inventory policy parameters Ri and Qi (i = 1, … , 4)
Stock Reorder Order Price /

point quantity piece
S1 2300 5000 0.3€
S2 590 3000 0.6€
S3 2000 9300 0.16€
S4 400 2000 3€
Performance evaluation
§ Parameters setting (chosen after several tests)

§ Horizon: 1000 days (3 years)
§ Warm-up: 10% of the horizon
§ Replications: 10 and 100 (stochastic behavior)
§ Performances (*) standard deviation
Stock Average Average Service level Average
inventory level backorder size inventory cost
S1 3408 (11.9*) 0 (0.00) 1 (0.00) 123 (0.43)
S2 1240 (8.5) 182 (0) 0.69 (0.009) 89 (0.69)
S3 4529 (35) 0.49 (1.55) 0.89 (0.06) 87 (0.67)
S4 588 (8) 20.37 (1.68) 0.83 (0.007) 211 (2.93)
!"#$%&'"(#)&*+,&-
Average number of tokens in place P7
Simulation based Optimization
Service level
Inventory cost
!"
!$ Optimization
!#
Tool
Inventory Parameters (EA)
!%
S3(R3,Q3) R Î [Rmin, Rmax]
Q Î [Qmin, Q Qmax].
Discrete Event Simulator
• Simulator contains structure (SC), operational policies, times, …

• Simulator is coupled with the optimization tool.
• As interface, we have performance indices and inventory parameters.
• At each generation, EA gives new values of R and Q and obtains new perf.
• Minimal and maximal value are fixed to R and Q.
Optimization
§ 2 approaches
§ Mono-objective: 1 solution is given to the decision maker
§ Aggregative Method: F = aF1 + bF2
§ e-constraint method
§ To achieve a minimum Service Level ( > 95%)
§ To minimize the Total Inventory cost
§ Multi-objectifve: front of non dominated solutions
§ To maximize the Service Level
§ To minimize the Total Inventory Cost
§ The decision maker has to chose between several
best non-dominated solutions
Multi-objectif case
Service Level
Ideal Point
1
To maximize
Pareto
front
0 To minimize Inventory cost
Mono-objective optimization : Genetic algorithm
Generation of the initial population
Individual evaluation
Genetic operations
Parents selection Crossover Mutation Individual

(Children creation) evaluation
new
Itération
Insertion in the population
Optimization: GA
§ Coding R1 Q1 R2 Q2 R3 Q3 R4 Q4
§ Crossover (Pc)
R1 Q1 R2 Q2 R3 Q3 R4 Q4
2 Parents
R1’ Q1’ R2’ Q2’ R3’ Q3’ R4’ Q4’
1 pt crossover
R1 Q1 R2 Q2 R3’ Q3’ R4’ Q4’
2 Children
R1’ Q1’ R2’ Q2’ R3 Q3 R4 Q4
§ Mutation (Pm) 1 pt mutation - random

R1 Q1 R2+c Q2 R3 Q3 R4 Q4
Results – Mono-objective
§ Expected revenu Inventory level evolution

§ Service: +14.5 % 6000
§ From 83 to 95% 5000
§ Inventory cost: -3% 4000
§ From 517 to 502€ 3000
2000
1000
0
S1 S2 S3 S4
Before opti
After opti
Results: Mono-objective
Sensitivity analysis (transport and customer demand)
Instance 1 Ins 2 Inst 3 Ins 4 Ins 5 Ins 6

CVd = 0.1 CVd = 0.2 CVd = 0.3 CVd = 0.1 CVd = 0.1 CVd = 0.1
CVlt = 0 CVlt = 0 CVlt = 0 CVlt = 0.1 CVlt = 0.2 CVlt = 0.3
R1 900 1017 1013 1002 939 1073
R2 478 499 421 458 433 519
R3 1855 1601 1498 1771 1838 1664
R4 652 639 677 644 682 685
SL 0.9501 0.9501 0.9500 0.9500 0.9501 0.9506

(0.0078) (0.0111) (0.0121) (0.0079) (0.0178) (0.0196)
TC 504.26 504.84 504.94 505.42 513.50 522.37

(5.10) (6.85) (8.66) (5.68) (11.90) (17.50)
CT 1345 1270 1328 1228 1485 1060
Multi-objective optimization
§ Multi-objective optimization method are chosen:

§ Bi-objective population methods based on
Pareto optimality
§ NSGA2 (Deb et al., 2000) (Non Dominated Genetic algorithm,
version 2)
§ SPEA2 (Zitzler et al., 2001) (Streng Pareto Evolutionary
Algorithm, version 2)
§ MOPSO (Tripathi et al., 2007) Multi-Objective Particle Swarm
Optimization
§ Why these choices

§ Robust search method that produces good quality solutions
quickly and accurately.
§ More than one objective in SC to consider
§ Facility of encoding inventory policy parameters
§ Ability to find multiple Pareto optimal solutions in one single
simulation run.
§ NSGA 2 method is classified among the relevant algorithm

(convergence and diversity)
§ Based on the concept of Pareto dominance
§ Produce a set of non-dominated solutions
§ Tournament selection, crossover and mutation are used to

create a child population
§ New pop is sorted based on non-dominated solutions
§ Incorporates elitism
NSGA-II: Overall structure
'()(*+,-.)/, Parent t Offspring t
Non dominated
sorting
Repeat until
!" !# !$ !% !& stopping
conditions
Diversity with
crowding distance
'()(*+,-.)/,0"
Parentt+1 Offspringt+1
Genetic operations: tournament

selection, crossover, mutation
SPEA-2
§ Works with an external archive.
§ Fitness of solution X: its strength (number of solutions it dominates).
§ Selection, crossover, mutation : like in NSGA-2.
§ Archive truncated using a density measure (like spacing).
§ We also modified SPEA-2 to get a variant SPEA-2b, using the gene-
wise reproduction method of Daniel & Rajendran (2005) and the
crowding distance of NSGA-2.
MOPSO
§ First PSO used for supply chain optimization.
§ A particle (solution)
§ has a position (R1,Q1,…, Ri,Qi,…,Rn,Qn), a velocity and an
experience (best score found).
§ Moves in solution space controlled by time-varying inertia and
acceleration coefficients.
§ External archive like in SPEA-2.
Computational Experiments
Parameters setting for optimization methods

§ SPEA2, SPEA2b, NSGA2
§ Population size: 100
§ Archive size: 50
§ Mutation probability: 0.1, 0.4 and 0.009
§ Crossover probability: 0.9
§ Crossover: single point and gene-wise
§ MOPSO
§ Social coefficient: C1i = 2.5, C1f = 2.5
§ Local coefficient: C2i = 2.5, C2f = 2.5
§ Inertia coefficient: wi = 2.5, wf = 2.5
§ Mutation probability: 0.1
§ Variation of the nb of generations: 25 to 1000
!"#$%"&'#(
– )*()+,-'.(/0(.'123&%$3/"# 41'.(#3,+2%$3/"5*(67(%"8(677
– )+,-'.(/0(9'"'.%$3/"#* 67:(;<:(<7:(677:(;<7:(<77:(=<7:(6777
>./-2',*(?/@($/(&/,1%.'(#'A'.%2(0./"$#B
;($C1'#(/0(,'%#+.'#('D3#$(3"($E'(23$'.%$+.'*(4,'$.3&#5
F'%#+.'#(&/,1+$'8(@3$E(/"2C(/"'(0./"$
)- /0("/"(8/,3"%$'8(#/2+$3/"#:(Spacing metric (Schott, 1995),
Hypervolume (Zitzler and Thiele, 1998), Spread metric (D):
F'%#+.'#(/-$%3"'8(@3$E(;(0./"$#(46(.'0'.'"&'(0./"$5
G(H3#$%"&'(4I33#'5:(J3$K2'. F'%#+.'(:(L
!"#$%&'%()*+",-)(#-)% %-#",.*/#+"0(*",*12%-#")+/(%+,#/3
– 4)(5&#-"6#%/'-#" 7089:"8!3
– ;"*<"/*&'()*+/"0893"=*1)+%(#= >?"%("&#%/("*+#"/*&'()*+"*<"8!
– @"A)/(%+,#"0B))/#3"µ C"S) =)
– =)"C"=)/(%+,#">#(D##+"%"/*&'()*+")"0893"%+=")("*-(.*E*+%&"
2-*F#,()*+"*+"8!
– G+"*'-",%/#
– H>"*<"+*+I=*1)+%(#="/*&'()*+/"C"/)5#"*<"(.#"2*2'&%()*+
§ Distributed Pareto-optimal Front

§ Industrial Solution vs Front (10, 500)
SL = 99 % Industrial solution
SL = 83%
Cost = 510 €
Pareto
front
Cost = 550 € 125

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017
Comparison between 2 fronts
!"'#"$$%"$$&
!"#"$%"$&
*#%+,)-./)&$0-) µ!"#$%&'()
Na N Ng Time(s) |F| C(Fi; F1) C(F1; Fi) µ µ̅
F1 10 10 71 100 0 0 0.00 0.0000
F2 10 25 180 100 0 84 0.98 0.0098
F3 10 50 335 100 0 89 1.08 0.0108
F4 10 100 665 100 0 94 1.15 0.0105

F5 10 250 1343 100 0 92 1.14 0.0104
F6 10 500 3292 100 0 89 1.10 0.0110
F7 10 750 4926 100 0 92 1.14 0.0114
F8 10 1000 6542 100 0 95 1.21 0.0121
F9 100 10 727 100 25 31 0.30 0.0030
F10 100 25 1713 100 20 67 0.72 0.0072
F11 100 50 3387 100 0 78 0.93 0.0093
F12 100 100 6624 100 1 90 0.99 0.0099
F13 100 250 13302 100 0 88 1.01 0.0101
F14 100 500 32669 100 2 85 1.04 0.0104

F15 100 750 49077 100 0 85 1.02 0.0102
F16 100 1000 65342 100 0 86 1.00 0.0100

IS ̶ ̶ 1 1 100 0 ̶ -0.090
"&'$%
"&'$%( Rapid
convergence
for SPEA2
and
!"#$% SPEA2b
25 generations
Industrial
Solution
(.83, 510)
"&'$%(
)*&"*
"&'$%
!"#$%
Best Pareto
front for
SPEA2b
1000 generations
§ Ziztler measure
§ NSGA2 front is taken as reference
C(NSGA-2, i) C(i, NSGA-2)
Generations 25 50 100 500 1000 25 50 100 500 1000
SPEA-2 0 0 2 36 32 100 100 64 24 26
SPEA-2b 0 0 0 0 0 100 100 100 100 100
MOPSO 90 0 70 68 58 20.5 49 17 7 10
Best results for SPEA2b

At least one solution of SPEA2b dominated solutions from NSGA2
No solution of NSGA2 dominated solution from SPEA2b
§ Spacing measure (average distance between two consecutive

solutions)
Nb gen. 25 50 75 100 250 500 750 1000
SPEA-2 3.137 1.332 1.521 1.400 1.233 1.293 1.500 1.550
SPEA-2b 1.656 2.091 2.034 1.627 1.407 1.754 1.501 1.403
NSGA-2 1.993 1.385 1.157 1.380 0.802 0.814 0.874 0.790
MOPSO 3.423 3.304 2.447 2.053 1.372 1.334 1.456 1.411
NSGA 2 has the most uniform spacing (may be due to its crowding distance)
Not much difference between the three other Metaheuristics
§ Computational times (in second)

Nb gen. 25 50 75 100 250 500 750 1000
SPEA-2 396 828 1269 1706 4315 8520 12711 17080
SPEA-2b 431 872 1306 1713 4066 7964 11907 15849
NSGA-2 1416 2758 4190 5543 13580 27132 41107 55762
MOPSO 440 859 1285 1701 4278 8683 13086 17485
More than 4h
SPEA2b and SPEA2 are the quickest optimization methods
§ Solutions given to the decision maker
Industrial
NS = 90% Solution
SL = 83%
Cost = 517 €
Pareto
R Q
Front S1 2300 5000
S2 590 3000
R Q
S3 2000 9300
S1 1150 2510
S4 400 2000
S2 521 2009
S3 1918 5031 Cost = 250 €
S4 622 1004

Supply Chain PN Optimization

Uploaded by

Copyright:

Available Formats

You might also like

Supply Chain PN Optimization

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Supply Chain PN Optimization

Uploaded by

Copyright:

Available Formats

Multi-objective optimization of

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 70

§ Research develops in our Laboratory many years

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 71

Comparison and validation

§ For manufacturing companies, it is necessary to reduce costs while

Suppliers Producer Warehouse Customer

§ Supply chain optimization needs a modeling and performance evaluation tool

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 73

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 74

Supply chain study

§ Why a new model?

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 75

§ Why a new Petri net model?

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 76

• Extension of Deterministic and Stochastic

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 77

A Batch Deterministic and Stochastic PN is:

§ T = Ti U Td U Te: (set of immediate, deterministic and stochastic

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 79

2x2 tokens 1 batch token

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 80

Transition enabling and firing

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 81

Stock of raw material

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 82

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 83

§ Qualitative analysis methods

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 85

Two differents approaches

Simulation of the Simulation results

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 86

§ Give the reachability of this BDSPN.

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 87

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 88

§ Make to stock (stock of finished goods)

Forecast Machine 1 Machine 2 Exit

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 89

§ Make to order (no stock of finished goods)

Input Machine 1 Machine 2 Ouput

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 90

§ Assemble to order: stock of work-in-process

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 93

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 94

Availability of the server

Queuing file M/M/2/5/6

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 97

§ (R, Q) inventory policy On-hand

Generation of Inventory Backorder

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 98

Inventory system modeling

§ Example (2,4) On-hand

Generation of Inventory Backorder

Prof Lionel Amodeo – Inventory Optimization– All rights reserved – 2017 99

§ Collaboration with Tyco Simel Company

Aluminum cylinder Flat of copper

Industrial case study

§ Configuration of the supply chain