SlideShare a Scribd company logo
GOAL PROGRAMMING Serhat  ÖKSÜZ Ahmet  TATIŞ Mehmet YILMAZ
THE VIEW OF THE PRESENTATION ●   Introduction ●   System approach to concurrent engineering   ●   Goal Programming   ●   Application Areas   ●   Weighting Method and Preemptive Method   ●   The Case Study and The Example   ●   Demonstration of The Model By Using Sets ●   Managerial implications for the company   ●   Conclusions and assessment
INTRODUCTION ●   Life-Cycle Costing (LCC) ; ● Time-Based Competition (TBC) ; ● T he three planning-horizon levels ; ▪   S trategic, ▪   I ntermediate , ▪   T actical ,
Concurrent Engineering Is the collaboration among   functional areas; Product design ,design for quality ,process design,   design  for manufacturing and planning ,logistic design  etc.  In the early phases of product design CE requires  : ▪  fast adaptation  ▪  product innovation ▪  short product delivery time to market  for a firm to remain competitive .  ▪
 
GOAL PROGRAMMING Introduced by Charnes and Cooper in 1960’s Provides a method of dealing with a collection of goals, rather than an explicit objective function. Objective is to minimize the deviation from   each of the goals that have been established. Constraints are “soft” in that you may violate one (i.e. not meet one goal) if it means you can make better progress toward one of the other goals.
Goal Programming Versus Linear Programming Multiple Goals (instead of one goal) Deviational Variables Minimized (instead of maximizing profit or minimizing cost of LP) “   Satisficing   ” (instead of optimizing)
APPLICATION AREAS Accounting  Agriculture  Economics  Engineering  Finance  Government  I nternational Context  Management  Marketing
Types Of Goal Programming 􀂅 Weights method: the single objective function is the weighted sum of the of the   functions   representing the goals of the problem.  MIN Z= w 1 d 1 +w 2 d 2 +…+w n d n 􀂅 Preemptive method: prioritizes the goals in order of importance, then optimizes one  goal  at a time.
CASE STUDY AND THE EXAMPLE COMPANY PROFILE ▪   Medical manufacturing company  producing skin prepping applicators ▪   10 years in the Industry  ▪  Hospitals, first aid users and indust rial companies are the customers ▪   125 employees ▪   17 million $   annual sales
Aim of the study Minimized  life cycle cost and time Timely introduction of products to market Increased deliver reliability Measurable improvement in supplier performance Improvements in changeover and setup technologies
CE TEAM Product designer Manufacturing engineer Quality control manager Marketing manager Purchasing manager Product design activities and practices are coordinated and accomplished concurrently. Suppliers  inputs and assistance is in terms of part and product is taken into consideration.
STRATEGIC GOALS (P 1 ) COST OF PRODUDUCTS TO MARKET (P 11 ) TIME OF PRODUDUCTS TO MARKET (P 12 ) ▪ Products research and  development cost  ▪ Engineering design cost ▪ Product investment cost ▪ Product investment and  developing cost ▪ Cost of quality ▪ Speed of response to customers ▪ Product time to market ▪   Design lead time ▪ Order-to-delivery cycle ▪ Total product delivery  time
INTERMEDIATE GOALS (P 2 ) THROUGHPUT COST (P 21 ) THROUGHPUT   TIME (P 22 ) ▪ Procurement cost   ▪ Non-recurring manufacturing  costs ▪ Recurring manufacturing costs ▪ Facilities cost   ▪ Initial logistics/support costs ▪ Cost of quality ▪ Manufacturing lead time ▪ Set-up time ▪   Producrtion cycle time ▪ Changeover time ▪ Delay time ▪ Distribution lead time ▪ Manufacturing response time ▪ Procurement lead time
TACTICAL  GOALS (P 3 ) OPERATIONAL AND MATERIAL COST (P 31 ) DELIVERY   TIMES (P 32 ) ▪ Operations cost  ▪ Maintenance  cost ▪ Product modification cost ▪ Facilities cost  ▪ Product phase-out and  disposal cost ▪ Delivery reliability ▪ Delivery speed
 
THE GOALS OF THE COMPANY  For products X 1  and X 2  ; STRATEGIC GOALS ▪   Engineering Des i gn Cost under 240   $ ▪   Cost Of Quality under 130 $ ▪  Minimum  Value Added to Product  320   $ INTERMED I ATE GOALS ▪   Recurring manufacturing cost under 170 $ ▪   Set up Time under 60 min TACTICAL GOALS  ▪   Delivery Reliability over 22 ▪   Operation Cost under 45 $
Strategic Goal   Engineering Design Cost   Total  EDC : 2  x 1  +  4 x 2 Upper Resource Limit :   240 2  x 1  +  4 x 2   =  240 +  d 1 +   - d 1 -   2  x 1  +  4 x 2   +  d 1 -  -   d 1 +   =  240 { 2  x 1  +  4 x 2   <   =  240 } d 1 +   indicates the  EDC  over  240   while   d 1 -   indicates  the  EDC  under the  goal . The objective is to minimize  d 1 +
Strategic Goal   Cost of Quality Total  COQ :   1  x 1  +  2 x 2 Upper Resource Limit :   130 1  x 1  +  2 x 2   =  130 +  d 2 +   -  d 2 -   1  x 1  +  2 x 2   +  d 2 -  - d 2 +  =   130 { 1  x 1  +  2 x 2   <   =   130 } d 2 +   indicates the  COQ  over  130  while   d 2 -   indicates the  COQ  under the  goal . The objective is to minimize  d 2 +
Strategic Goal   Value Added to Product Total  VAP :   4 x 1  +  5 x 2 Upper Resource Limit :   320 4 x 1  +  5 x 2 =  320 +  d 3 + - d 3 -   4 x 1  +  5 x 2 +  d 3 -  - d 3 +  =   320 { 4 x 1  +  5 x 2  >   =   320 } d 3 +   indicates the  VAP  over  320   while   d 3 -   indicates the  VAP  under the  goal . The objective is to minimize  d 3 -
I ntermediate Goal   Recurring Manufacturing Cost Total  RMC :   4 x 1  +  3 x 2 Upper Resource Limit :   170 4 x 1  +  3 x 2 =  170 +  d 4 + - d 4 -   4 x 1  +  3 x 2 +  d 4 -  - d 4 +  =   170 { 4 x 1  +  3 x 2   <   =   170 } d 4 +   indicates the  RMC  over  170   while   d 4 -   indicates the  RMC  under the  goal . The objective is to minimize  d 4 +
I ntermediate Goal   Set-Up Time Total  SUT  :   3 x 1  +  4 x 2 Upper Resource Limit :   60 3 x 1  +  4 x 2 =  60 +  d 5 + - d 5 -   3 x 1  +  4 x 2 +  d 5 -  - d 5 +  =   60 { 3 x 1  +  4 x 2   <   =   60 } d 5 +   indicates the  SUT  over  60   while   d 5 -   indicates the  SUT  under the  goal . The objective is to minimize  d 5 +
Tactical Goal   Delivery Reliability Total  DR  :   3 x 1  +  4 x 2 Upper Resource Limit :   22 4 x 1  +  5 x 2 =  22 +  d 6 + - d 6 -   4 x 1  +  5 x 2 +  d 6 -  - d 6 +  =   22 { 4 x 1  +  5 x 2   >   =   22 } d 6 +   indicates the  DR  over  22   while   d 6 -   indicates the  DR  under the  goal . The objective is to minimize  d 6 -
Tactical Goal   Operations Cost Total  OC  :   3 x 1  +  4 x 2 Upper Resource Limit :   45 6 x 1  +  3 x 2 =  45 +  d 7 + - d 7 -   6 x 1  +  3 x 2 +  d 7 -  - d 7 +  =   45 { 6 x 1  +  3 x 2   <   =   45 } d 7 +   indicates the  OC  over  45   while   d 7 -   indicates the  OC  under the  goal . The objective is to minimize  d 7 +
The Model
The Model  The strategic goal  : Min d 1 +  + d 2 +  +   d 3 -  ; {   Min  w 1 d 1 +  +w 1 d 2 +  +w 1 d 3 -   +   w 2 d 4 +  +w 2 d 5 +   +   w 3   d 6 -  + w 3 d 7 +   } 2 x 1  +  4 x 2   +  d 1 -  -   d 1 +   =  240 ; 1 x 1  +  2 x 2   +  d 2 -  - d 2 +  =   130 ; 4 x 1  +  5 x 2 +  d 3 -  - d 3 +  =   320 ; 4 x 1  +  3 x 2 +  d 4 -  - d 4 +  =   170 ; 3 x 1  +  4 x 2 +  d 5 -  - d 5 +  =   60 ; 4 x 1  +  5 x 2 +  d 6 -  - d 6 +  =   22 ; 6 x 1  +  3 x 2 +  d 7 -  - d 7 +  =   45 ; x 1   ,  x 2   ,   d i +  ,   d i -     0
The solution Let the solution be: x 1   =  80  ,   x 2   = 0   ,  d 1 +  =0   , d 2 +  =   0 , d 3 -   =0
The Model  The intermediate goal  : Min d 4 +  + d 5 +  ; 2 x 1  +  4 x 2   +  d 1 -  -   d 1 +   =  240 ; 1 x 1  +  2 x 2   +  d 2 -  - d 2 +  =   130 ; 4 x 1  +  5 x 2 +  d 3 -  - d 3 +  =   320 ; 4 x 1  +  3 x 2 +  d 4 -  - d 4 +  =   170 ; 3 x 1  +  4 x 2 +  d 5 -  - d 5 +  =   60 ; 4 x 1  +  5 x 2 +  d 6 -  - d 6 +  =   22 ; 6 x 1  +  3 x 2 +  d 7 -  - d 7 +  =   45 ; d 1 +  =0  ;  d 2 +  =   0  ;  d 3 -   =   0  ;
The solution Let the solution be: x 1   =  13.33  ,   x 2   =  53.33  ,  d 4 +  = 43.33  , d 5 +  =  193.33
The Model  The  tactical goal  : Min d 6 -  + d 7 +  ; 2 x 1  +  4 x 2   +  d 1 -  -   d 1 +   =  240 ; 1 x 1  +  2 x 2   +  d 2 -  - d 2 +  =   130 ; 4 x 1  +  5 x 2 +  d 3 -  - d 3 +  =   320 ; 4 x 1  +  3 x 2 +  d 4 -  - d 4 +  =   170 ; 3 x 1  +  4 x 2 +  d 5 -  - d 5 +  =   60 ; 4 x 1  +  5 x 2 +  d 6 -  - d 6 +  =   22 ; 6 x 1  +  3 x 2 +  d 7 -  - d 7 +  =   45 ; d 1 +  =0  ;  d 2 +  =   0  ;  d 3 -   =   0  ; d 4 +  = 43.33 ;  d 5 +  =  193.33 ;
The solution Let the solution be: x 1   =  13.33  ,   x 2   =  53.33  ,  (EDC)   d 1 +  =   0  &  d 1 -   =  0  , (COQ)  d 2 +  =   0  &  d 2 -   =  10   ,  (VAP)   d 3 +  =   0  &  d 3 -   =0  , (RMC)   d 4 +  =  43.3  &  d 4 -   =0  , (SUT)  d 5 +  =  193.3  &  d 5 -   =0  , (DR)   d 6 +  =  298 &  d 6 -   =  0   ,  (OC)   d 7 +  =  195  &  d 7 -   =0  .
The solution Let the solution be: This means: EDC  =  2 x 1  +  4 x 2   +  d 1 -  -   d 1 +   =  240 ; COQ  =   1 x 1  +  2 x 2   - d 2 +  =   130  – 10  =  120 ; VAP =  4 x 1  +  5 x 2 +  d 3 -  - d 3 +  =   320 ; RMC =   4 x 1  +  3 x 2 +  d 4 -  =   170  + 43.3  =  213.3   ; SUT =  3 x 1  +  4 x 2 +  d 5 -   =   60  +193.33  = 253.33   ; DR =  4 x 1  +  5 x 2 +  d 6 -  =   22  + 298  =  320  ; OC =  6 x 1  +  3 x 2 +  d 7 -  =   45  + 195  = 240  .
Min d 1 + + d 2 + + d 3 -  2 x 1  + 4 x 2  + d 1 -   - d 1 +  = 240 1 x 1  + 2 x 2  + d 2 -   - d 2 +  = 130 4 x 1  + 5 x 2  + d 3 -  - d 3 +   = 320 4 x 1  + 3 x 2  + d 4 -   - d 4 +   = 170 3 x 1  + 4 x 2  + d 5 -   - d 5 +  = 60 4 x 1  + 5 x 2  + d 6 -   - d 6 +   = 22 6 x 1  + 3 x 2  + d 7 -  - d 7 +   = 45
X 1  = 80;  X 2  = 0; d 1 +   = 0 ;  d 2 + = 0 ; d 3 - = 0
Min d 4 + + d 5 +   2 x 1  + 4 x 2  + d 1 -   - d 1 +  = 240 1 x 1  + 2 x 2  + d 2 -   - d 2 +  = 130 4 x 1  + 5 x 2  + d 3 -  - d 3 +   = 320 4 x 1  + 3 x 2  + d 4 -   - d 4 +   = 170 3 x 1  + 4 x 2  + d 5 -   - d 5 +  = 60 4 x 1  + 5 x 2  + d 6 -   - d 6 +   = 22 6 x 1  + 3 x 2  + d 7 -  - d 7 +   = 45   d 1 + + d 2 + + d 3 -  = 0
X 1  = 13.33;  X 2  = 53.33; d 4 +  = 43.33 ;  d 5 +  = 193.33;
Min d 6 -  + d 7 +   2 x 1  + 4 x 2  + d 1 -   - d 1 +  = 240 1 x 1  + 2 x 2  + d 2 -   - d 2 +  = 130 4 x 1  + 5 x 2  + d 3 -  - d 3 +   = 320 4 x 1  + 3 x 2  + d 4 -   - d 4 +   = 170 3 x 1  + 4 x 2  + d 5 -   - d 5 +  = 60 4 x 1  + 5 x 2  + d 6 -   - d 6 +   = 22 6 x 1  + 3 x 2  + d 7 -  - d 7 +   = 45   d 1 + + d 2 + + d 3 -  = 0 d 4 +  +d 5 +   =  236.667;
X 1  = 13.33;  X 2  = 53.33; d 6 -  = 0.00 ;  d 7 + = 195.0;
CONCLUSION PGP is particularly appropriate where there is a hierarchy of priority levels for the goals, as is the case in this paper   The most important decisions with regard to time and cost of products are made at the product design stage   Using CE optimises the LCC and TBC in order to be competitive
THANKS

More Related Content

PPTX
Goal Programming
PDF
Goal programming
PDF
Unit.3. duality and sensetivity analisis
PPT
Linear programming
PDF
simplex method for operation research .pdf
PPTX
Duality in Linear Programming
PPSX
Linear programing
PPT
simplex method
Goal Programming
Goal programming
Unit.3. duality and sensetivity analisis
Linear programming
simplex method for operation research .pdf
Duality in Linear Programming
Linear programing
simplex method

What's hot (20)

PDF
Linear Programming Problems : Dr. Purnima Pandit
PPT
Duality
PDF
Simplex method: Slack, Surplus & Artificial variable
PPT
Goal programming 2011
PPTX
Mathematical formulation of lpp- properties and example
PPTX
Operations Research - Sensitivity Analysis
PPTX
Duel simplex method_operations research .pptx
PDF
Duality in Linear Programming Problem
PDF
Unit.5. transportation and assignment problems
PPTX
Special Cases in Simplex Method
PDF
linear programming
PPTX
Linear Programming
PPTX
the two phase method - operations research
PDF
Integer programming
PPTX
Simplex Method.pptx
PDF
Linear Programming (graphical method)
PPTX
Integer Linear Programming
PPTX
Operations Research - The Dual Simplex Method
PPTX
linear programming
PPT
Simplex Method
Linear Programming Problems : Dr. Purnima Pandit
Duality
Simplex method: Slack, Surplus & Artificial variable
Goal programming 2011
Mathematical formulation of lpp- properties and example
Operations Research - Sensitivity Analysis
Duel simplex method_operations research .pptx
Duality in Linear Programming Problem
Unit.5. transportation and assignment problems
Special Cases in Simplex Method
linear programming
Linear Programming
the two phase method - operations research
Integer programming
Simplex Method.pptx
Linear Programming (graphical method)
Integer Linear Programming
Operations Research - The Dual Simplex Method
linear programming
Simplex Method
Ad

Similar to Goal Programming (20)

PDF
goalprogramming-150911073618-lva1-app6891 (1).pdf
PPT
Management Science - Goal Programming Procedure
PPTX
Psimd open64 workshop_2012-new
PPTX
Dynamic Programming Matrix Chain Multiplication
PPTX
Coin change Problem (DP & GREEDY)
PPTX
K means clustering
PDF
Number Theory and Its Applications in Cryptography
PDF
python dict
PPT
Para mayra
PDF
Boosting Developer Productivity with Clang
PPT
Order of operations
PPTX
powerpoint presentation on square root factorising
PDF
Week 8- Integration (Intro) Part 7 Summary.pdf
PDF
Week 8- Integration (Intro) Part 7 Summary.pdf
PPTX
PDF
Statistical Schema Induction
PPTX
การเขียนคำสั่งควบคุมแบบวนซ้ำ กลุ่ม 4 ม.6 ห้อง2
PPTX
การเขียนคำสั่งควบคุมแบบวนซ้ำ กลุ่ม 4 ม.6 ห้อง2
PPTX
pseudocodes for interview preparation 2.pptx
goalprogramming-150911073618-lva1-app6891 (1).pdf
Management Science - Goal Programming Procedure
Psimd open64 workshop_2012-new
Dynamic Programming Matrix Chain Multiplication
Coin change Problem (DP & GREEDY)
K means clustering
Number Theory and Its Applications in Cryptography
python dict
Para mayra
Boosting Developer Productivity with Clang
Order of operations
powerpoint presentation on square root factorising
Week 8- Integration (Intro) Part 7 Summary.pdf
Week 8- Integration (Intro) Part 7 Summary.pdf
Statistical Schema Induction
การเขียนคำสั่งควบคุมแบบวนซ้ำ กลุ่ม 4 ม.6 ห้อง2
การเขียนคำสั่งควบคุมแบบวนซ้ำ กลุ่ม 4 ม.6 ห้อง2
pseudocodes for interview preparation 2.pptx
Ad

More from Evren E (20)

PPT
Lean Manufacturing , Yalın Üretim
PPT
Total Quality Management, Toplam Kalite Yönetimi 2
PPT
Automated Storage and Retrival Systems AS/RS
PPT
Material Handling Technologies
PPT
Latest Developments In CIM
PPT
Just in Time , Tam Zamanında Üretim
PPT
concurrent engineering, eş zamanlı mühendislik
PPT
Flexible Manufacturing Systems, Esnek Üretim Sistemleri
PPT
Industrial Robots
PPT
Agile Manufacturing, Çevik Üretim
PPT
Cellular Manufacturing
PPT
Computer Aided Manufacturing
PPT
Time-table Scheduling
PPT
Supply Chain Management
PPT
Staff Scheduling
PPT
NETWORK AND GRAPH PROBLEMS
PPT
Facility Location Problem
PPT
CREW SCHEDULING
PPT
AGGREGATE PLANNING MODELS FOR FIELD SERVICE DELIVERY
PPT
Assingment Problem3
Lean Manufacturing , Yalın Üretim
Total Quality Management, Toplam Kalite Yönetimi 2
Automated Storage and Retrival Systems AS/RS
Material Handling Technologies
Latest Developments In CIM
Just in Time , Tam Zamanında Üretim
concurrent engineering, eş zamanlı mühendislik
Flexible Manufacturing Systems, Esnek Üretim Sistemleri
Industrial Robots
Agile Manufacturing, Çevik Üretim
Cellular Manufacturing
Computer Aided Manufacturing
Time-table Scheduling
Supply Chain Management
Staff Scheduling
NETWORK AND GRAPH PROBLEMS
Facility Location Problem
CREW SCHEDULING
AGGREGATE PLANNING MODELS FOR FIELD SERVICE DELIVERY
Assingment Problem3

Recently uploaded (20)

PPTX
CkgxkgxydkydyldylydlydyldlyddolydyoyyU2.pptx
PDF
IFRS Notes in your pocket for study all the time
PDF
Module 3 - Functions of the Supervisor - Part 1 - Student Resource (1).pdf
PDF
Stem Cell Market Report | Trends, Growth & Forecast 2025-2034
PPT
Chapter four Project-Preparation material
PDF
Solara Labs: Empowering Health through Innovative Nutraceutical Solutions
PPTX
svnfcksanfskjcsnvvjknsnvsdscnsncxasxa saccacxsax
PDF
NEW - FEES STRUCTURES (01-july-2024).pdf
PPTX
Sales & Distribution Management , LOGISTICS, Distribution, Sales Managers
PDF
Laughter Yoga Basic Learning Workshop Manual
PDF
Deliverable file - Regulatory guideline analysis.pdf
PDF
Tata consultancy services case study shri Sharda college, basrur
PPT
340036916-American-Literature-Literary-Period-Overview.ppt
PPTX
ICG2025_ICG 6th steering committee 30-8-24.pptx
PPTX
Business Ethics - An introduction and its overview.pptx
PDF
Ôn tập tiếng anh trong kinh doanh nâng cao
PPTX
Principles of Marketing, Industrial, Consumers,
PPT
Lecture 3344;;,,(,(((((((((((((((((((((((
PPTX
Belch_12e_PPT_Ch18_Accessible_university.pptx
PPTX
3. HISTORICAL PERSPECTIVE UNIIT 3^..pptx
CkgxkgxydkydyldylydlydyldlyddolydyoyyU2.pptx
IFRS Notes in your pocket for study all the time
Module 3 - Functions of the Supervisor - Part 1 - Student Resource (1).pdf
Stem Cell Market Report | Trends, Growth & Forecast 2025-2034
Chapter four Project-Preparation material
Solara Labs: Empowering Health through Innovative Nutraceutical Solutions
svnfcksanfskjcsnvvjknsnvsdscnsncxasxa saccacxsax
NEW - FEES STRUCTURES (01-july-2024).pdf
Sales & Distribution Management , LOGISTICS, Distribution, Sales Managers
Laughter Yoga Basic Learning Workshop Manual
Deliverable file - Regulatory guideline analysis.pdf
Tata consultancy services case study shri Sharda college, basrur
340036916-American-Literature-Literary-Period-Overview.ppt
ICG2025_ICG 6th steering committee 30-8-24.pptx
Business Ethics - An introduction and its overview.pptx
Ôn tập tiếng anh trong kinh doanh nâng cao
Principles of Marketing, Industrial, Consumers,
Lecture 3344;;,,(,(((((((((((((((((((((((
Belch_12e_PPT_Ch18_Accessible_university.pptx
3. HISTORICAL PERSPECTIVE UNIIT 3^..pptx

Goal Programming

  • 1. GOAL PROGRAMMING Serhat ÖKSÜZ Ahmet TATIŞ Mehmet YILMAZ
  • 2. THE VIEW OF THE PRESENTATION ● Introduction ● System approach to concurrent engineering ● Goal Programming ● Application Areas ● Weighting Method and Preemptive Method ● The Case Study and The Example ● Demonstration of The Model By Using Sets ● Managerial implications for the company ● Conclusions and assessment
  • 3. INTRODUCTION ● Life-Cycle Costing (LCC) ; ● Time-Based Competition (TBC) ; ● T he three planning-horizon levels ; ▪ S trategic, ▪ I ntermediate , ▪ T actical ,
  • 4. Concurrent Engineering Is the collaboration among functional areas; Product design ,design for quality ,process design, design for manufacturing and planning ,logistic design etc. In the early phases of product design CE requires : ▪ fast adaptation ▪ product innovation ▪ short product delivery time to market for a firm to remain competitive . ▪
  • 5.  
  • 6. GOAL PROGRAMMING Introduced by Charnes and Cooper in 1960’s Provides a method of dealing with a collection of goals, rather than an explicit objective function. Objective is to minimize the deviation from each of the goals that have been established. Constraints are “soft” in that you may violate one (i.e. not meet one goal) if it means you can make better progress toward one of the other goals.
  • 7. Goal Programming Versus Linear Programming Multiple Goals (instead of one goal) Deviational Variables Minimized (instead of maximizing profit or minimizing cost of LP) “ Satisficing ” (instead of optimizing)
  • 8. APPLICATION AREAS Accounting Agriculture Economics Engineering Finance Government I nternational Context Management Marketing
  • 9. Types Of Goal Programming 􀂅 Weights method: the single objective function is the weighted sum of the of the functions representing the goals of the problem. MIN Z= w 1 d 1 +w 2 d 2 +…+w n d n 􀂅 Preemptive method: prioritizes the goals in order of importance, then optimizes one goal at a time.
  • 10. CASE STUDY AND THE EXAMPLE COMPANY PROFILE ▪ Medical manufacturing company producing skin prepping applicators ▪ 10 years in the Industry ▪ Hospitals, first aid users and indust rial companies are the customers ▪ 125 employees ▪ 17 million $ annual sales
  • 11. Aim of the study Minimized life cycle cost and time Timely introduction of products to market Increased deliver reliability Measurable improvement in supplier performance Improvements in changeover and setup technologies
  • 12. CE TEAM Product designer Manufacturing engineer Quality control manager Marketing manager Purchasing manager Product design activities and practices are coordinated and accomplished concurrently. Suppliers inputs and assistance is in terms of part and product is taken into consideration.
  • 13. STRATEGIC GOALS (P 1 ) COST OF PRODUDUCTS TO MARKET (P 11 ) TIME OF PRODUDUCTS TO MARKET (P 12 ) ▪ Products research and development cost ▪ Engineering design cost ▪ Product investment cost ▪ Product investment and developing cost ▪ Cost of quality ▪ Speed of response to customers ▪ Product time to market ▪ Design lead time ▪ Order-to-delivery cycle ▪ Total product delivery time
  • 14. INTERMEDIATE GOALS (P 2 ) THROUGHPUT COST (P 21 ) THROUGHPUT TIME (P 22 ) ▪ Procurement cost ▪ Non-recurring manufacturing costs ▪ Recurring manufacturing costs ▪ Facilities cost ▪ Initial logistics/support costs ▪ Cost of quality ▪ Manufacturing lead time ▪ Set-up time ▪ Producrtion cycle time ▪ Changeover time ▪ Delay time ▪ Distribution lead time ▪ Manufacturing response time ▪ Procurement lead time
  • 15. TACTICAL GOALS (P 3 ) OPERATIONAL AND MATERIAL COST (P 31 ) DELIVERY TIMES (P 32 ) ▪ Operations cost ▪ Maintenance cost ▪ Product modification cost ▪ Facilities cost ▪ Product phase-out and disposal cost ▪ Delivery reliability ▪ Delivery speed
  • 16.  
  • 17. THE GOALS OF THE COMPANY For products X 1 and X 2 ; STRATEGIC GOALS ▪ Engineering Des i gn Cost under 240 $ ▪ Cost Of Quality under 130 $ ▪ Minimum Value Added to Product 320 $ INTERMED I ATE GOALS ▪ Recurring manufacturing cost under 170 $ ▪ Set up Time under 60 min TACTICAL GOALS ▪ Delivery Reliability over 22 ▪ Operation Cost under 45 $
  • 18. Strategic Goal Engineering Design Cost Total EDC : 2 x 1 + 4 x 2 Upper Resource Limit : 240 2 x 1 + 4 x 2 = 240 + d 1 + - d 1 - 2 x 1 + 4 x 2 + d 1 - - d 1 + = 240 { 2 x 1 + 4 x 2 < = 240 } d 1 + indicates the EDC over 240 while d 1 - indicates the EDC under the goal . The objective is to minimize d 1 +
  • 19. Strategic Goal Cost of Quality Total COQ : 1 x 1 + 2 x 2 Upper Resource Limit : 130 1 x 1 + 2 x 2 = 130 + d 2 + - d 2 - 1 x 1 + 2 x 2 + d 2 - - d 2 + = 130 { 1 x 1 + 2 x 2 < = 130 } d 2 + indicates the COQ over 130 while d 2 - indicates the COQ under the goal . The objective is to minimize d 2 +
  • 20. Strategic Goal Value Added to Product Total VAP : 4 x 1 + 5 x 2 Upper Resource Limit : 320 4 x 1 + 5 x 2 = 320 + d 3 + - d 3 - 4 x 1 + 5 x 2 + d 3 - - d 3 + = 320 { 4 x 1 + 5 x 2 > = 320 } d 3 + indicates the VAP over 320 while d 3 - indicates the VAP under the goal . The objective is to minimize d 3 -
  • 21. I ntermediate Goal Recurring Manufacturing Cost Total RMC : 4 x 1 + 3 x 2 Upper Resource Limit : 170 4 x 1 + 3 x 2 = 170 + d 4 + - d 4 - 4 x 1 + 3 x 2 + d 4 - - d 4 + = 170 { 4 x 1 + 3 x 2 < = 170 } d 4 + indicates the RMC over 170 while d 4 - indicates the RMC under the goal . The objective is to minimize d 4 +
  • 22. I ntermediate Goal Set-Up Time Total SUT : 3 x 1 + 4 x 2 Upper Resource Limit : 60 3 x 1 + 4 x 2 = 60 + d 5 + - d 5 - 3 x 1 + 4 x 2 + d 5 - - d 5 + = 60 { 3 x 1 + 4 x 2 < = 60 } d 5 + indicates the SUT over 60 while d 5 - indicates the SUT under the goal . The objective is to minimize d 5 +
  • 23. Tactical Goal Delivery Reliability Total DR : 3 x 1 + 4 x 2 Upper Resource Limit : 22 4 x 1 + 5 x 2 = 22 + d 6 + - d 6 - 4 x 1 + 5 x 2 + d 6 - - d 6 + = 22 { 4 x 1 + 5 x 2 > = 22 } d 6 + indicates the DR over 22 while d 6 - indicates the DR under the goal . The objective is to minimize d 6 -
  • 24. Tactical Goal Operations Cost Total OC : 3 x 1 + 4 x 2 Upper Resource Limit : 45 6 x 1 + 3 x 2 = 45 + d 7 + - d 7 - 6 x 1 + 3 x 2 + d 7 - - d 7 + = 45 { 6 x 1 + 3 x 2 < = 45 } d 7 + indicates the OC over 45 while d 7 - indicates the OC under the goal . The objective is to minimize d 7 +
  • 26. The Model The strategic goal : Min d 1 + + d 2 + + d 3 - ; { Min w 1 d 1 + +w 1 d 2 + +w 1 d 3 - + w 2 d 4 + +w 2 d 5 + + w 3 d 6 - + w 3 d 7 + } 2 x 1 + 4 x 2 + d 1 - - d 1 + = 240 ; 1 x 1 + 2 x 2 + d 2 - - d 2 + = 130 ; 4 x 1 + 5 x 2 + d 3 - - d 3 + = 320 ; 4 x 1 + 3 x 2 + d 4 - - d 4 + = 170 ; 3 x 1 + 4 x 2 + d 5 - - d 5 + = 60 ; 4 x 1 + 5 x 2 + d 6 - - d 6 + = 22 ; 6 x 1 + 3 x 2 + d 7 - - d 7 + = 45 ; x 1 , x 2 , d i + , d i -  0
  • 27. The solution Let the solution be: x 1 = 80 , x 2 = 0 , d 1 + =0 , d 2 + = 0 , d 3 - =0
  • 28. The Model The intermediate goal : Min d 4 + + d 5 + ; 2 x 1 + 4 x 2 + d 1 - - d 1 + = 240 ; 1 x 1 + 2 x 2 + d 2 - - d 2 + = 130 ; 4 x 1 + 5 x 2 + d 3 - - d 3 + = 320 ; 4 x 1 + 3 x 2 + d 4 - - d 4 + = 170 ; 3 x 1 + 4 x 2 + d 5 - - d 5 + = 60 ; 4 x 1 + 5 x 2 + d 6 - - d 6 + = 22 ; 6 x 1 + 3 x 2 + d 7 - - d 7 + = 45 ; d 1 + =0 ; d 2 + = 0 ; d 3 - = 0 ;
  • 29. The solution Let the solution be: x 1 = 13.33 , x 2 = 53.33 , d 4 + = 43.33 , d 5 + = 193.33
  • 30. The Model The tactical goal : Min d 6 - + d 7 + ; 2 x 1 + 4 x 2 + d 1 - - d 1 + = 240 ; 1 x 1 + 2 x 2 + d 2 - - d 2 + = 130 ; 4 x 1 + 5 x 2 + d 3 - - d 3 + = 320 ; 4 x 1 + 3 x 2 + d 4 - - d 4 + = 170 ; 3 x 1 + 4 x 2 + d 5 - - d 5 + = 60 ; 4 x 1 + 5 x 2 + d 6 - - d 6 + = 22 ; 6 x 1 + 3 x 2 + d 7 - - d 7 + = 45 ; d 1 + =0 ; d 2 + = 0 ; d 3 - = 0 ; d 4 + = 43.33 ; d 5 + = 193.33 ;
  • 31. The solution Let the solution be: x 1 = 13.33 , x 2 = 53.33 , (EDC) d 1 + = 0 & d 1 - = 0 , (COQ) d 2 + = 0 & d 2 - = 10 , (VAP) d 3 + = 0 & d 3 - =0 , (RMC) d 4 + = 43.3 & d 4 - =0 , (SUT) d 5 + = 193.3 & d 5 - =0 , (DR) d 6 + = 298 & d 6 - = 0 , (OC) d 7 + = 195 & d 7 - =0 .
  • 32. The solution Let the solution be: This means: EDC = 2 x 1 + 4 x 2 + d 1 - - d 1 + = 240 ; COQ = 1 x 1 + 2 x 2 - d 2 + = 130 – 10 = 120 ; VAP = 4 x 1 + 5 x 2 + d 3 - - d 3 + = 320 ; RMC = 4 x 1 + 3 x 2 + d 4 - = 170 + 43.3 = 213.3 ; SUT = 3 x 1 + 4 x 2 + d 5 - = 60 +193.33 = 253.33 ; DR = 4 x 1 + 5 x 2 + d 6 - = 22 + 298 = 320 ; OC = 6 x 1 + 3 x 2 + d 7 - = 45 + 195 = 240 .
  • 33. Min d 1 + + d 2 + + d 3 - 2 x 1 + 4 x 2 + d 1 - - d 1 + = 240 1 x 1 + 2 x 2 + d 2 - - d 2 + = 130 4 x 1 + 5 x 2 + d 3 - - d 3 + = 320 4 x 1 + 3 x 2 + d 4 - - d 4 + = 170 3 x 1 + 4 x 2 + d 5 - - d 5 + = 60 4 x 1 + 5 x 2 + d 6 - - d 6 + = 22 6 x 1 + 3 x 2 + d 7 - - d 7 + = 45
  • 34. X 1 = 80; X 2 = 0; d 1 + = 0 ; d 2 + = 0 ; d 3 - = 0
  • 35. Min d 4 + + d 5 + 2 x 1 + 4 x 2 + d 1 - - d 1 + = 240 1 x 1 + 2 x 2 + d 2 - - d 2 + = 130 4 x 1 + 5 x 2 + d 3 - - d 3 + = 320 4 x 1 + 3 x 2 + d 4 - - d 4 + = 170 3 x 1 + 4 x 2 + d 5 - - d 5 + = 60 4 x 1 + 5 x 2 + d 6 - - d 6 + = 22 6 x 1 + 3 x 2 + d 7 - - d 7 + = 45 d 1 + + d 2 + + d 3 - = 0
  • 36. X 1 = 13.33; X 2 = 53.33; d 4 + = 43.33 ; d 5 + = 193.33;
  • 37. Min d 6 - + d 7 + 2 x 1 + 4 x 2 + d 1 - - d 1 + = 240 1 x 1 + 2 x 2 + d 2 - - d 2 + = 130 4 x 1 + 5 x 2 + d 3 - - d 3 + = 320 4 x 1 + 3 x 2 + d 4 - - d 4 + = 170 3 x 1 + 4 x 2 + d 5 - - d 5 + = 60 4 x 1 + 5 x 2 + d 6 - - d 6 + = 22 6 x 1 + 3 x 2 + d 7 - - d 7 + = 45 d 1 + + d 2 + + d 3 - = 0 d 4 + +d 5 + = 236.667;
  • 38. X 1 = 13.33; X 2 = 53.33; d 6 - = 0.00 ; d 7 + = 195.0;
  • 39. CONCLUSION PGP is particularly appropriate where there is a hierarchy of priority levels for the goals, as is the case in this paper The most important decisions with regard to time and cost of products are made at the product design stage Using CE optimises the LCC and TBC in order to be competitive