Cost Analysis & Optimization of Repair Concepts and Spare Parts - - PowerPoint PPT Presentation

cost analysis optimization of repair concepts and spare
SMART_READER_LITE
LIVE PREVIEW

Cost Analysis & Optimization of Repair Concepts and Spare Parts - - PowerPoint PPT Presentation

Cost Analysis & Optimization of Repair Concepts and Spare Parts Using Marginal Analysis Justin Woulfe Patrik Alfredsson Thord Righard www.wpiservices.com Introduction The fundamental property of cost and capability trade studies is


slide-1
SLIDE 1

www.wpiservices.com

Cost Analysis & Optimization of Repair Concepts and Spare Parts Using Marginal Analysis

Justin Woulfe Patrik Alfredsson Thord Righard

slide-2
SLIDE 2

www.wpiservices.com

Introduction

  • The fundamental property of cost and capability trade studies is

that the model allows for a simultaneous optimization of two problems to achieve the highest performance at the lowest Life Cycle Cost:

  • What is the most cost effective repair strategy?
  • What is the optimal sparing strategy?
  • The choice of repair strategy concerns:

– Whether to discard or repair items

  • if the item is to be repaired, where the repair should take place

– The sparing strategy optimizes the amount of spares at each location,

when, and how much to reorder.

slide-3
SLIDE 3

www.wpiservices.com OPERATIONAL EFFECTIVENESS – E(x, y, z) TECHNICAL PERFORMANCE T(x, y) AVAILABILITY A(x, y, z)

SYSTEMS AND LOGISTICS ENGINEERING (ILS)

THE BASICS – ALL IN ONE PICTURE

TECHNICAL SYSTEM DESIGN (TSD) - x technical properties support reqs (RAMS, MTBM, MTTM) SUPPORT SYSTEM DESIGN (SSD) - z supportability (MLDT) OPERATIONAL CONCEPT (OP) - y LAC LOC LSC (CN) LSC (CI) LIFE CYCLE COST – C(x, y, z)

slide-4
SLIDE 4

www.wpiservices.com

OPERATIONAL CONCEPT (OP) - y

SYSTEMS AND LOGISTICS ENGINEERING (ILS)

PRIMARY OBJECTIVES

10 000 20 000 30 000 40 000 50 000

Cost

0.6 0.7 0.8 0.9 1.0

C

cost-effectiveness MAXIMAL OPERATIONAL EFFECTIVENESS AT MINIMAL LCC

SUPPORT SYSTEM (SSD) - z TECHNICAL SYSTEM (TSD) - x

slide-5
SLIDE 5

www.wpiservices.com

OPTIMAL SUPPORT SYSTEM DESIGN

  • given a technical system design (TSD) – x

– incl. RAMS properties (support requirements)

  • given an operational concept (OP) – y
  • design an optimal support solution – choose z so as to

– maximize A(x, y, z) and minimize LSC(x, y, z) – generate cost-effective support system designs – z*

  • identify LSC-related cost drivers in x and y

– feedback to TSD and operational ambition OP

slide-6
SLIDE 6

www.wpiservices.com

SUPPORT SYSTEM DESIGN

PRIMARY OBJECTIVE

10 000 20 000 30 000 40 000 50 000

Cost

0.6 0.7 0.8 0.9 1.0

C

cost-effectiveness MAXIMAL AVAILABILITY AT MINIMAL LSC

slide-7
SLIDE 7

www.wpiservices.com

REPAIR CONCEPT OPTIMIZATION (LORA-XT) SPARE PARTS OPTIMIZATION

DESIGN VARIABLES

DEGREES OF FREEDOM IN z

  • spares safety stocks

– OPUS classic

  • spares resupply strategy

– OPUS discardables

  • maintenance and support resources
  • maintenance concept

– what maintenance where

  • plus many more

– e,g., transportation policy

slide-8
SLIDE 8

www.wpiservices.com

LORA-XT

THE BASICS

  • extended scope compared to

spare parts optimization

  • necessary coordination
  • the extended scope is the right step

– towards total support system optimization – coordinated optimization over several design variables – power functionality

LORA-XT SPARE PARTS OPTIMIZATION maintenance concept spares requirements resource requirements

slide-9
SLIDE 9

www.wpiservices.com

LORA-XT

  • repair/discard decision per failure mode

– not per item

  • repair level (location) decision per task/failure mode

– not per item

  • maintenance level decision also includes preventive maintenance

– not only repair (corrective maintenance)

  • the output – cost effective allocation/definition of

– maintenance concept – spares – resources

slide-10
SLIDE 10

www.wpiservices.com

Calculation and optimization

slide-11
SLIDE 11

www.wpiservices.com

The basic scenario

Support organization (stores and workshops) Systems in operation

slide-12
SLIDE 12

www.wpiservices.com

Calculation model (1 level)

DT k

e k DT k X P

  ! ) ( ) (

Stochastic variable X:

  • Number of outstanding

demands

  • Steady-state distribution is

Poisson (D∙T) S Demand rate (D) Resupply time (T) Stock level (S)

Poisson process

slide-13
SLIDE 13

www.wpiservices.com

Measure of efficiency:

 

S k

k X P ) (

  • X > S => Shortage !
  • Risk of shortage (ROS)

– Probability that the stock is

empty

– P(X≥S)

  • Expected number of backorders

(NBO)

– Average queue – E(X-S)+

 

 

S k

k X P S k ) ( ) (

S

D T

slide-14
SLIDE 14

www.wpiservices.com

Calculation model (several levels)

  • T now depends on supporting stock
  • Steady-state distribution of X more complex
  • Approximate X with negative binomial

– Select parameters to match of EX and VX – Known as Varimetric approximation (Sherbrooke)

S Resupply time (T) Stock level (S) S0 Demand rate (D)

Poisson process

slide-15
SLIDE 15

www.wpiservices.com

Availability vs NBO

slide-16
SLIDE 16

www.wpiservices.com

Optimization

  • Objective: Total NBO
  • Minimize NBO  Maximize A
  • Decision variables: Stock levels S

– Per item and location – Non-linear integer problem

  • Minimize total NBO for different values on total cost (LSC)

=>

  • Not only ONE optimal point but a set of points (curve)
slide-17
SLIDE 17

www.wpiservices.com

Optimization

Spares A B C Item1 3 1 1 Item2 7 3 4 Item3 1 Item4 2 1 2 C NBO Maintenance A B C Resource A 1 Resource B 2 1 1

slide-18
SLIDE 18

www.wpiservices.com

Optimization:

  • Fast and efficient
  • Problem with 10000 variables only takes a few

seconds on an ordinary PC

  • Simplifies analysis of alternative scenarios and

sensitivity analysis

slide-19
SLIDE 19

www.wpiservices.com

Optimization

  • Marginal allocation

– Increase stock at location/item that gives

best improvement per dollar

– Calculate marginal effectiveness mbc at all

locations/items

– Easy to calculate and update

) 1 ( ... ) ( ) 1 (        s ROS s NBO s NBO NBO

C NBO mbc   

) ( ) ( ) 1 ( s X P s ROS s ROS ROS       

slide-20
SLIDE 20

www.wpiservices.com

Optimization several levels

  • Start at the ”far end” (least important)
  • Minimize NBO locally

– Generate a local solution curve

  • Proceed to next level with a selected subset of solution

points

– Perform a local optimization for each solution point

  • n the previous level

– Form the convex hull over all local curves

  • Heuristic approach that turns out to work very well

– Constraints (min/max stock) can cause some

problems

slide-21
SLIDE 21

www.wpiservices.com

Optimization several levels

C NBO

slide-22
SLIDE 22

www.wpiservices.com

Optimization several levels

C NBO

slide-23
SLIDE 23

www.wpiservices.com

Optimization several levels

C NBO

slide-24
SLIDE 24

www.wpiservices.com

Optimization several levels

C NBO

slide-25
SLIDE 25

www.wpiservices.com

Optimization several levels

C NBO

slide-26
SLIDE 26

www.wpiservices.com

Optimization several levels

C NBO

slide-27
SLIDE 27

www.wpiservices.com

Optimization several levels

C NBO

slide-28
SLIDE 28

www.wpiservices.com

Optimization several levels

C NBO

slide-29
SLIDE 29

www.wpiservices.com

Optimization several levels

C NBO

slide-30
SLIDE 30

www.wpiservices.com

Optimization several levels

C NBO

slide-31
SLIDE 31

www.wpiservices.com

Significance levels:

  • A way to organize positions according to importance

– Level 1 contains the most far away positions – Level N contains the system positions

  • Calculation are performed level by level starting from

level 1

  • Positions at level k depend on positions at level k-1
  • nly
  • Positions that are equally “important” are optimized

against each other

slide-32
SLIDE 32

www.wpiservices.com

Significance levels:

multi echelon and multi indenture

  • Significance refers both to station

distance and indenture distance

  • Only positions with demand are

included

C B A SSRU 1 2 3 SRU/DP 2 3 4 LRU/DU 3 4 5 System 6

C B A Stations Materiel ROOT, Fictive root ROOT, Fictive root SYSTEM, LRU, SRU, SSRU, DP, DU, Sign levels

slide-33
SLIDE 33

www.wpiservices.com

Subproblems:

  • Items are split into independent

subproblems

  • Maximal split based on primary items
  • Items with common subitems must

belong to the same subproblem

ROOT, Fictive root ROOT, Fictive root SY, LRU1, SRU1, SRU2, DP1, LRU2, DP2, SRU3, LRU3, LRU4, SRU4, LRU5, SRU4, SRU5, LRU6, DU1, DU2,

slide-34
SLIDE 34

www.wpiservices.com

Subproblems:

  • A separate C/E-curve is created for each

subproblem

  • The different subproblem are combined by

use of marginal allocation

  • Faster and “better”

+ +

slide-35
SLIDE 35

www.wpiservices.com

Different steps in the optimization:

  • Position

– A C/E-curve to describe Cost/Moe per position – Implicit recursion formulas except for reorder positions

  • Subproblem

– Traditional optimization based on significance levels

  • Total

– Combining subproblems into total C/E-curve

slide-36
SLIDE 36

www.wpiservices.com

Optimization of Maintenance Concepts (LORA):

  • Split into subproblems based on task category

– Related tasks needing same type of repair resources

  • For each task category

– Evaluate different maintenance concepts (resource allocations) – Include discard option (no resources) – Identify convex hull to find optimal solutions (C/E-curve)

  • Master problem

– combine subproblems using marginal allocation – generates (total) C/E-curve

slide-37
SLIDE 37

www.wpiservices.com

Task category subproblem:

  • Evaluate different maintenance

concepts

– Solve different spares problems

  • Identify convex hull

– optimal solution for this subproblem

slide-38
SLIDE 38

www.wpiservices.com

Master problem:

  • Given optimal C/E-curves for each task category subproblem
  • Combine to total C/E-curve by use of marginal allocation

+ +

slide-39
SLIDE 39

www.wpiservices.com

Conclusion

  • Through Marginal Analysis we are able to optimize:

– Repair Concepts – Spare Parts Requirements

  • We can model the actual system and it’s environment in a highly accurate

way

  • Find the lowest possible cost solution to met availability and KPP

requirements

  • By modeling reality and being able to quickly provide solutions for rapid

sensitivity and what if analysis, this method gives the analyst the ability to provide highly defensible results seconds rather than days